On the degrees of polynomial divisors over finite fields

DOI10.1017/S030500411600044XMaRDI QIDQ5360417zbMATH OpenOpenAlexFDO

Authors Andreas Weingartner

Publication date 28 September 2017

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.01920

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Polynomials in general fields (irreducibility, etc.) (12E05)

Abstract: We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q{n}^{-1}+O(n^{-2})$. More generally, we give an asymptotic formula for the proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than $m$. To that end, we first derive an improved estimate for the proportion of polynomials of degree $n$, all of whose non-constant divisors have degree greater than $m$. In the limit as $qoinfty$, these results coincide with corresponding estimates related to the cycle structure of permutations.

Recommendations

• On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
• Un problème de diviseurs dans $F_q [X]$
• scientific article; zbMATH DE number 874215
• Polynômes de $F_q[X]$ ayant un diviseur de degré donné
• Polynomials with divisors of every degree

Cites work

• scientific article; zbMATH DE number 4160880 (Why is no real title available?)
• scientific article; zbMATH DE number 3827993 (Why is no real title available?)
• scientific article; zbMATH DE number 1234413 (Why is no real title available?)
• scientific article; zbMATH DE number 473229 (Why is no real title available?)
• scientific article; zbMATH DE number 1008373 (Why is no real title available?)
• A Differential Delay Equation Arising from the Sieve of Eratosthenes
• Analysis of Ben-Or's polynomial irreducibility test
• Analytic combinatorics
• Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
• Integers with dense divisors 3
• Integers with dense divisors. I
• Local probabilities and total variation distance for random permutations
• On integers \(n\) for which \(X^n-1\) has a divisor of every degree
• On the degrees of divisors of \(T^{n}-1\)
• On the divisors of \(x^n-1\) in \(\mathbb F_p[x]\)
• Polynomials with divisors of every degree
• Practical numbers and the distribution of divisors
• Prime Suspects
• Some problems in analytic number theory for polynomials over a finite field
• Sur un problème de crible et ses applications
• Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel

Cited in

(12)

• Divisibility of polynomials over finite fields and combinatorial applications
• Uniform estimates for almost primes over finite fields
• On counting polynomials over finite fields
• Set partitions without blocks of certain sizes
• Degree bounds for the division problem in polynomial ideals
• Degree \(k\) linear recursions mod \((p)\) and number fields
• On the constant factor in several related asymptotic estimates
• On the mean value of the functions related to the divisor function on the ring of polynomials over a finite field
• Asymptotic estimates for the number of permutations without short cycles
• On the common index divisors of a dihedral field of prime degree
• On the degrees of irreducible factors of polynomials over a finite field
• On the degrees of divisors of \(T^{n}-1\)

This page was built for publication: On the degrees of polynomial divisors over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5360417)