An official website of the United States government
Abstract We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert’s Irreducibility Theorem for degree $$n$$ polynomials $$f$$ with $$\textrm {Gal}(f) \subseteq A_n$$. We study this both for monic polynomials and non-monic polynomials. Second, we study lower bounds on the number of degree $$n$$ monic polynomials with almost prime discriminants, as well as the closely related problem of lower bounds on the number of degree $$n$$ number fields with almost prime discriminants.
more »
« less
This content will become publicly available on May 1, 2026
On 2-superirreducible polynomials over finite fields
We investigate k-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most k. Let F be a finite field of characteristic p. We show that no 2-superirreducible polynomials exist in F[t] when p=2 and that no such polynomials of odd degree exist when p is odd. We address the remaining case in which p is odd and the polynomials have even degree by giving an explicit formula for the number of monic 2-superirreducible polynomials having even degree d. This formula is analogous to that given by Gauss for the number of monic irreducible polynomials of given degree over a finite field. We discuss the associated asymptotic behaviour when either the degree of the polynomial or the size of the finite field tends to infinity.
more »
« less
- PAR ID:
- 10618636
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Indagationes Mathematicae
- Volume:
- 36
- Issue:
- 3
- ISSN:
- 0019-3577
- Page Range / eLocation ID:
- 753 to 763
- Subject(s) / Keyword(s):
- irreducibility finite fields polynomial compositions
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract For every integer k there exists a bound $$B=B(k)$$ B = B ( k ) such that if the characteristic polynomial of $$g\in \textrm{SL}_n(q)$$ g ∈ SL n ( q ) is the product of $$\le k$$ ≤ k pairwise distinct monic irreducible polynomials over $$\mathbb {F}_q$$ F q , then every element x of $$\textrm{SL}_n(q)$$ SL n ( q ) of support at least B is the product of two conjugates of g . We prove this and analogous results for the other classical groups over finite fields; in the orthogonal and symplectic cases, the result is slightly weaker. With finitely many exceptions ( p , q ), in the special case that $$n=p$$ n = p is prime, if g has order $$\frac{q^p-1}{q-1}$$ q p - 1 q - 1 , then every non-scalar element $$x \in \textrm{SL}_p(q)$$ x ∈ SL p ( q ) is the product of two conjugates of g . The proofs use the Frobenius formula together with upper bounds for values of unipotent and quadratic unipotent characters in finite classical groups.more » « less
-
Abstract We consider negative moments of quadratic Dirichlet $$L$$–functions over function fields. Summing over monic square-free polynomials of degree $2g+1$ in $$\mathbb{F}_{q}[x]$$, we obtain an asymptotic formula for the $$k^{\textrm{th}}$$ shifted negative moment of $$L(1/2+\beta ,\chi _{D})$$, in certain ranges of $$\beta $$ (e.g., when roughly $$\beta \gg \log g/g $$ and $k<1$). We also obtain non-trivial upper bounds for the $$k^{\textrm{th}}$$ shifted negative moment when $$\log (1/\beta ) \ll \log g$$. Previously, almost sharp upper bounds were obtained in [ 3] in the range $$\beta \gg g^{-\frac{1}{2k}+\epsilon }$$.more » « less
-
Abstract We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $$\mathbb {F}_q$$ -isomorphism classes of abelian varieties over a finite field $$\mathbb {F}_q$$ which belong to an isogeny class determined by a characteristic polynomial hof Frobenius when his ordinary, or qis prime and hhas no real roots.more » « less
-
Abstract We formulate a general problem: Given projective schemes and over a global fieldKand aK‐morphism η from to of finite degree, how many points in of height at mostBhave a pre‐image under η in ? This problem is inspired by a well‐known conjecture of Serre on quantitative upper bounds for the number of points of bounded height on an irreducible projective variety defined over a number field. We give a nontrivial answer to the general problem when and is a prime degree cyclic cover of . Our tool is a new geometric sieve, which generalizes the polynomial sieve to a geometric setting over global function fields.more » « less
