Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more irreducible polynomials, and that if $f(x)$ is a product of $m>1$ irreducible polynomials, then its Galois group must be a union of conjugates of $m$ proper subgroups. We prove that for any $m>1$, every finite solvable group which is a union of conjugates of $m$ proper subgroups (where all these conjugates have trivial intersection) occurs as the Galois group of such a polynomial, and that the same result (with $m=2$) holds for all Frobenius groups. It is also observed that every nonsolvable Frobenius group is realizable as the Galois group of a geometric--i.e. regular-- extension of $\dQ(t)$.
Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $μ_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and $X^rh(X)^{q-1}$ permutes $μ_{q+1}$. There are many ad hoc constructions of permutation polynomials of $\Bbb F_{q^2}$ of this type such that $h(X)^{q-1}$ induces monomial functions on the cosets of a subgroup of $μ_{q+1}$. We give a general construction that can generate, through an algorithm, {\em all} permutation polynomials of $\Bbb F_{q^2}$ with this property, includin…
Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots+X^{q^a-2}$ is a permutation polynomial of $\Bbb F_{q^e}$ if and only if (i) $a=2$ and $q=2$, or (ii) $a=1$ and $\text{gcd}(q-2,q^e-1)=1$. In the present paper we confirm this conjecture.
Let $k$ be a positive integer and $S_{2k}={\tt x}+{\tt x}^4+...+{\tt x}^{4^{2k-1}}\in\Bbb F_2[{\tt x}]$. It was recently conjectured that ${\tt x}+S_{2k}^{4^{2k}}+S_{2k}^{4^k+3}$ is a permutation polynomial of $\Bbb F_{4^{3k}}$. In this note, the conjecture is confirmed and a generalization is obtained.
This short paper is concerned with polynomial Pell equations \[P^2-DQ^2=1,\] with $P,Q,D\in\Bbb C[X]$ and ${deg}(D)=2$. The main result shows that the polynomials $P$ and $Q$ are closely related to Chebyshev polynomials. We then investigate the existence of such polynomials in $\Bbb Z[X]$ specializing to fixed solutions of ordinary Pell equations over the integers.
Let $q$ be a prime power, $2\le r\le q$, and $f=a{\tt X}+{\tt X}^{r(q-1)+1}\in\Bbb F_{q^2}[{\tt X}]$, where $a\ne 0$. The conditions on $r,q,a$ that are necessary and sufficient for $f$ to be a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ are not known. (Such conditions are known under an additional assumption that $a^{q+1}=1$.) In this paper, we prove the following: (i) If $f$ is a PP of ${\Bbb F}_{q^2}$, then $\text{gcd}(r,q+1)>1$ and $(-a)^{(q+1)/\text{gcd}(r,q+1)}\ne 1$. (ii) For a fixed $r>2$ and subject to the conditions that $q+1\equiv 0\pmod r$ and $a^{q+1}\ne 1$, there are only fin…
Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive $3$rd root of unity. (ii) $(q,a)$ belongs to a finite set which is determined in the paper.
Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related problem. Let $g_{n,q}\in\Bbb F_p[{\tt x}]$ ($n\ge 0$, $p=\text{char}\,\Bbb F_q$) be the polynomial defined by the functional equation $\sum_{c\in\Bbb F_q}({\tt x}+c)^n=g_{n,q}({\tt x}^q-{\tt x})$. We determine all $n$ of the form $n=q^α-q^β-1$, $α>β\ge 0$, for which $g_{n,q}$ is a permutation polynomial of $\Bbb F_{q^2}$.
Let $p$ be a prime and $q$ a power of $p$. For $n\ge 0$, let $g_{n,q}\in\Bbb F_p[{\tt x}]$ be the polynomial defined by the functional equation $\sum_{a\in\Bbb F_q}({\tt x}+a)^n=g_{n,q}({\tt x}^q-{\tt x})$. When is $g_{n,q}$ a permutation polynomial (PP) of $\Bbb F_{q^e}$? This turns out to be a challenging question with remarkable breath and depth, as shown in the predecessor of the present paper. We call a triple of positive integers $(n,e;q)$ {\em desirable} if $g_{n,q}$ is a PP of $\Bbb F_{q^e}$. In the present paper, we find many new classes of desirable triples whose corresponding PPs we…
Let $K_{m}=\Bbb{Q}(ζ_{m})$ where $ζ_{m}$ is a primitive $m$th root of unity. Let $p>2$ be prime and let $C_{p}$ denote the group of order $p.$ The ring of algebraic integers of $K_{m}$ is $\Cal{O}_{m}=\Bbb{Z}[ζ_{m}].$ Let $Λ_{m,p}$ denote the order $\Cal{O}_{m}[C_{p}]$ in the algebra $K_{m}[C_{p}].$ Consider the kernel group $D(Λ_{m,p})$ and the Swan subgroup $T(Λ_{m,p}).$ If $(p,m)=1$ these two subgroups of the class group coincide. Restricting to when there is a rational prime $p$ that is prime in $\Cal{O}_{m}$ requires $m=4$ or $q^{n}$ where $q>2$ is prime. For each such $m$, $3 \leq m \leq…
Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $°f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $ν_p(|Z(f)|)\ge m(\lceil n/d\rceil-1)$, where $p=\text{char}\,\Bbb F_q$, $q=p^m$, and $ν_p$ is the $p$-adic valuation. In this paper, we determine a condition on the coefficients of $f$ that is necessary and sufficient for $f$ to meet Ax's bound, that is, $ν_p(|Z(f)|)=m(\lceil n/d\rceil-1)$. Let $R_q(d,n)$ denote the $q$-ary Reed-Muller code $\{f\in\Bbb F_q[X_1,\dots,X_n]: °f\le d,\ °_{X_j}f\le q-…
We introduce a notion of full level structure for the group scheme $μ_p \times μ_p$, and show that scheme of full level structures is flat over $\Bbb{Z}$.
We investigate geometric and combinatorial aspects of the mysterious relationship between the action of the motivic Galois group on the motivic fundamental group of the projective line punctured at zero, infinity, and N-th roots of unity, and the geometry of modular manifolds for the congruence subgroup Y(m;N) of GL(m,Z) fixing (0, ... , 0, 1) modulo N. To achieve this, we consider a canonical collection of elements in the image of the motivic Galois Lie algebra, spanning it over Q. These elements are the motivic correlators at N-th roots of unity. We assign to them chains in the complex compu…
Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and $\text{Tr}_{q/2}(\frac 1t)=0$; (ii) $q\equiv 1\pmod 8$ and $t^2=-2$.
We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this polynomial. In addition, we show the probability that a random polynomial of degree $n$ has more than $\log n$ roots is $O\big(n^{-K}\big)$ for some $K > 0$.
We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.
Hooley proved that if $f\in \Bbb Z [X]$ is irreducible of degree $\ge 2$, then the fractions $\{ r/n\}$, $0<r<n$ with $f(r)\equiv 0\pmod n$, are uniformly distributed in $(0,1)$. In this paper we study such problems for reducible polynomials of degree $2$ and $3$ and for finite products of linear factors. In particular, we establish asymptotic formulas for exponential sums over these normalized roots.
Kopparty and Wang studied in [3] the relation between the roots of a univariate polhynomial over GF(q) and the zero-nonzero pattern of its coefficients. We generalize their results to polynomials in more variables.
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
