arXiv subjects
Publications and source records attributed to Gary McGuire.
We present a proof of a conjecture we made about primitive polynomials, for $q$ sufficiently large. The argument follows a standard route, however a deeper result than usual with a character sum bound is required. This is a theorem of Fu and Wan. The proof is AI assisted.
It is well known that, given two curves $\mathcal{X}: y^p+cy=x^m$ and $\mathcal{Y}:y^p+cy=x^n$, defined over $\F_p$, if $n$ divides $m$ then there exists a nonconstant morphism $\mathcal{X} \longrightarrow \mathcal{Y}$. In this paper we are interested in studying whether the converse of this statement is true, i.e., if there exists a morphism $\mathcal{X} \longrightarrow\mathcal{Y}$ then must it be true that $n$ divides $m$? In particular, we consider the case when $m=p^{k}+1$ and $n=p^\ell+1$. We prove that the converse is true under certain hypotheses. We deal with both the cases of Galois morphisms and non-Galois morphisms.
In this work, we define Generalized Monomial Cartesian Codes (GMCC), which constitute a natural extension of generalized Reed-Solomon codes. We describe how two different generalized Reed-Solomon codes can be combined to construct one GMCC. We further establish sufficient conditions ensuring that the GMCC are Hermitian self-orthogonal, thus leading to new constructions of quantum codes.
Let $q$ be a prime power. Let $λ>1$ be a divisor of $q-1$, and let $τ>1$ and $ρ>1$ be divisors of $q+1$. Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $n=λτσ$ where $2\le σ\le ρ$. This is a flexible construction, which includes new MDS parameters not known before.
Let $F$ be any field. We give a short and elementary proof that any finite subgroup $G$ of $PGL(2,F)$ occurs as a Galois group over the function field $F(x)$. We also develop a theory of descent to subfields of $F$. This enables us to realize the automorphism groups of finite subgroups of $PGL(2,F)$ as Galois groups.
Let $F$ be any field containing the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that all powers of $x$ that appear in $L$ with nonzero coefficient have exponent a power of $q$. It is well known that given any ordinary polynomial $f$ in $F[x]$, there exists a $q$-polynomial that is divisible by $f$. We study the smallest degree of such a $q$-polynomial. This is equivalent to studying the $\mathbb{F}_q$-span of the roots of $f$ in a splitting field. We relate this quantity to the representation theory of the Galois group of $f$. As an application we give a simultaneous construction of the binary Golay code of length 24, and the Steiner system on 24 points.
We realize Frobenius conjugacy classes in Galois groups of certain $q$-polynomials over $\mathbb{F}_q(t)$ using specific degree 1 ideals. We combine this with methods from elementary linear algebra and group theory to realize transvections in some linear Galois groups. This enables the Galois group to be identified as a known classical group in several reasonably general cases.
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials in $m$ variables. When $m=1$ our codes are MDS, and when $m=2$ and our lower bound for the minimum distance is $3$ the codes are at least Hermitian Almost MDS. For an infinite family of parameters when $m=2$ we prove that our codes beat the Gilbert-Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.
Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those powers of $x$ that occur as terms of $L$ with nonzero coefficient have exponent a power of $q$. If the exponent of the leading term of $L$ is $q^n$, we say that $L$ has $q$-degree $n$. We assume that the coefficient of the $x$ term of $L$ is nonzero. We investigate the Galois group $G$, say, of $L$ over $F$, under the assumption that $L(x)/x$ is irreducible in $F[x]$. It is well known that if $L$ has $q$-degree $n$, its roots are an $n$-dimensional vector space over the field of order $q$ and $G$ acts linearly on this space. Our main theorem is the following. We consider a monic $q$-polynomial $L$ whose $q$-degree is a prime, $r$, say, with $L(x)/x$ irreducible over $F$. Assuming that the coefficient of the $x$ term of $L$ is $(-1)^r$, we show that the Galois group of $L$ over $F$ must be the special linear group $SL(r,q)$ of degree $r$ over the field of order $q$ when $q>2$. We also prove a projective version for the projective special linear group $PSL(r,q)$, and we present the analysis when $q=2$.
Let $L(x)$ be any $q$-linearized polynomial with coefficients in $\mathbb{F}_q$, of degree $q^n$. We consider the Galois group of $L(x)+tx$ over $\mathbb{F}_q(t)$, where $t$ is transcendental over $\mathbb{F}_q$. We prove that when $n$ is a prime, the Galois group is always $GL(n,q)$, except when $L(x)=x^{q^n}$. Equivalently, we prove that the arithmetic monodromy group of $L(x)/x$ is $GL(n,q)$.
We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as a subspace of the splitting field of another linearized polynomial.
For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and the other on the rational function field $F(x)$. The invariant functions in $F(x)$ are used to show that regular patterns exist in the factorization of certain polynomials into irreducible polynomials. We use some results about group actions and the orbit polynomial, whose proofs are included. An unusual connection to the conjugacy classes of $PGL(2,q)$ is shown. At the end of the paper we present an alternative approach, using Lang's theorem on algebraic groups.
We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as do cyclotomic polynomials.
Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a different method of lattice enumeration in three dimensions will provide a significant speedup. We use the successive minima and shortest vectors of the lattice instead of transition vectors to iterate through lattice points. We showcase the new method by a record computation in a 133-bit subgroup of $\mathbb{F}_{p^6}$, with $p^6$ having 423 bits. Our overall timing nearly $3$ times faster than the previous record of a 132-bit subgroup in a 422-bit field. The approach generalizes to dimensions 4 or more, overcoming a key obstruction to the implementation of the tower number field sieve.
We present new quantum codes with good parameters which are constructed from self-orthogonal algebraic geometry codes. Our method permits a wide class of curves to be used in the formation of these codes, which greatly extends the class of a previous paper due to Munuera, Tenório and Torres. These results demonstrate that there is a lot more scope for constructing self-orthogonal AG codes than was previously known.
The XL algorithm is an algorithm for solving overdetermined systems of multivariate polynomial equations, which was initially introduced for quadratic equations. However, the algorithm works for polynomials of any degree, and in this paper we will focus on the performance of XL for polynomials of degree $\geq3$, where the optimal termination value of the parameter $D$ is still unknown. We prove that the XL algorithm terminates at a certain value of $D$ in the case that the number of equations exceeds the number of variables by 1 or 2. We also give strong evidence that this value is best possible, and we show that this value is smaller than the degree of regularity. Part of our analysis requires proving that ordinary multinomials are strongly unimodal, and this result may be of independent interest.
Linearized polynomials over finite fields have been much studied over the last several decades. Recently there has been a renewed interest in linearized polynomials because of new connections to coding theory and finite geometry. We consider the problem of calculating the rank or nullity of a linearized polynomial $L(x)=\sum_{i=0}^{d}a_i x^{q^i}$ (where $a_i\in \mathbb{F}_{q^n}$) from the coefficients $a_i$. The rank and nullity of $L(x)$ are the rank and nullity of the associated $\mathbb{F}_q$-linear map $\mathbb{F}_{q^n} \longrightarrow \mathbb{F}_{q^n}$. McGuire and Sheekey defined a $d\times d$ matrix $A_L$ with the property that $$\mbox{nullity} (L)=\mbox{nullity} (A_L -I).$$ We present some consequences of this result for some trinomials that split completely, i.e., trinomials $L(x)=x^{q^d}-bx^q-ax$ that have nullity $d$. We give a full characterization of these trinomials for $n\le d^2-d+1$.
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive nature. These results follow from our main theorem which characterizes the number of roots using the rank of a matrix that is smaller than the Dickson matrix.