12 citations · 28 across the 10 of their papers we have counts for
Showing 2009 · math.AGShow all
2 papers · 2 filters
math.AG2009★ 1 cited
Generating series for irreducible polynomials over finite fields
Arnaud Bodin
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formu…
math.AG2009★ 2 cited
Decomposition of polynomials and approximate roots
Arnaud Bodin
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), wi…