scientific article; zbMATH DE number 874215

MaRDI QIDQ4876749zbMATH OpenFDO

Authors Arnold Knopfmacher, Richard Warlimont

Publication date 6 May 1996

zbMATH Keywords

asymptotic probabilityirreducible factorspermutationspolynomial

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06)

Recommendations

• Enumerating permutation polynomials over finite fields by degree. II
• On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
• Enumerating permutation polynomials. I: Permutations with non-maximal degree
• Distinct Degree Factorizations for Polynomials over a Finite Field

Cited in

(12)

• On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
• Permutation polynomials and factorization
• On the enumeration of polynomials with prescribed factorization pattern
• Factorization patterns on nonlinear families of univariate polynomials over a finite field
• Liminal reciprocity and factorization statistics
• The Probability That a Random Monicp-adic Polynomial Splits
• scientific article; zbMATH DE number 5163456 (Why is no real title available?)
• Uniform estimates for almost primes over finite fields
• On the degrees of polynomial divisors over finite fields
• A counting scheme and some algebraic properties of a class of special permutation patterns
• Enumeration of decomposable combinatorial structures with restricted patterns
• Smooth permutations and polynomials revisited

This page was built for publication:

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