For any positive integers n ≥ 3 and r ≥ 1, we prove that the number of monic irreducible polynomials of degree n over F2r in which the coefficients of Tn−1, Tn−2 and Tn−3 are prescribed has period 24 as a function of n, after a suitable normalization. A similar result holds over F5r, with the period being 60. We also show that this is a phenomena unique to characteristics 2 and 5. The result is strongly related to the supersingularity of certain curves associated with cyclotomic function fields, and in particular it complements an equidistribution result of Katz
AbstractWe prove estimates for the number of self-reciprocal monic irreducible polynomials over a fi...
AbstractFor an odd positive integer n, we determine formulas for the number of irreducible polynomia...
L'objectif de ce mémoire est de dénombrer les polynômes irréductibles unitaires sur un corps fini en...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
In this paper we evaluate the number of monic irreducible polynomials in ??2[??] of even degree ?? w...
For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polyn...
We present an efficient deterministic algorithm which outputs exact expressions in terms of n for th...
We present an efficient deterministic algorithm which outputs exact expressions in terms of n for th...
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palin...
AbstractWe obtain an equivalent version of Carlitz's formula for the number of monic irreducible pol...
AbstractFor an even positive integer n, we determine formulas for the number of irreducible polynomi...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractWe prove estimates for the number of self-reciprocal monic irreducible polynomials over a fi...
AbstractFor an odd positive integer n, we determine formulas for the number of irreducible polynomia...
L'objectif de ce mémoire est de dénombrer les polynômes irréductibles unitaires sur un corps fini en...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
For any positive integers n≥3, r≥1 we present formulae for the number of irreducible polynomials of ...
In this paper we evaluate the number of monic irreducible polynomials in ??2[??] of even degree ?? w...
For any positive integers $n\geq 3, r\geq 1$ we present formulae for the number of irreducible polyn...
We present an efficient deterministic algorithm which outputs exact expressions in terms of n for th...
We present an efficient deterministic algorithm which outputs exact expressions in terms of n for th...
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palin...
AbstractWe obtain an equivalent version of Carlitz's formula for the number of monic irreducible pol...
AbstractFor an even positive integer n, we determine formulas for the number of irreducible polynomi...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
Abstract. A classical conjecture predicts how often a polynomial in Z[T] takes prime values. The nat...
AbstractWe prove estimates for the number of self-reciprocal monic irreducible polynomials over a fi...
AbstractFor an odd positive integer n, we determine formulas for the number of irreducible polynomia...
L'objectif de ce mémoire est de dénombrer les polynômes irréductibles unitaires sur un corps fini en...