Direct factors of polynomial rings over finite fields

DOI10.1016/0097-3165(85)90102-5MaRDI QIDQ1074663zbMATH OpenOpenAlexFDO

Authors John Knopfmacher

Publication date 1985

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(85)90102-5

zbMATH Keywords

asymptotic formulafinite fieldpolynomial

Mathematics Subject Classification ID

Asymptotic results on counting functions for algebraic and topological structures (11N45) Polynomials over finite fields (11T06)

Review text

An asymptotic formula is derived for the total number of polynomials of degree n in an arbitrary direct factor of the set G of all monic polynomials in one unknown over a finite field with q elements. A direct factor of G is a subset \(B_ 1\) of G such that for some subset \(B_ 2\) of G, every polynomial w in G has a unique factorization of the form \(w=b_ 1b_ 2\), where \(b_ i\in B_ i\). The asymptotic formula is given as \(c_ 1q^ n\), where \(c_ 1\) is a constant depending on \(B_ 1\).

Recommendations

• On the distribution of polynomials having a given number of irreducible factors over finite fields
• On the number of factorizations of polynomials over finite fields
• Random polynomials over a finite field
• On counting polynomials over finite fields
• On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials

Cites work

• scientific article; zbMATH DE number 1186086 (Why is no real title available?)
• On the Density of Direct Factors of the Set of Positive Integers

Cited in

(3)

• Dirichlet's theorem for the ring of polynomials over \(\mathrm{GF}(2)\)
• On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
• The Probability That a Random Monicp-adic Polynomial Splits

This page was built for publication: Direct factors of polynomial rings over finite fields

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