On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
DOI10.1007/BF02465438zbMath0958.11078OpenAlexW2023132896MaRDI QIDQ1382695
Eugenijus Manstavicius, Arnold Knopfmacher
Publication date: 1 April 1998
Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02465438
symmetric grouppolynomials over a finite fieldgreatest length of a cycle in a random permutationlargest degree of an irreducible factor
Asymptotic results on counting functions for algebraic and topological structures (11N45) Polynomials over finite fields (11T06) Arithmetic functions in probabilistic number theory (11K65)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gaussian limiting distributions for the number of components in combinatorial structures
- Three problems in combinatorial asymptotics
- Distribution statistique de l'ordre d'un élément du groupe symétrique. (Statistical distribution of the order of an element of the symmetric group)
- Direct factors of polynomial rings over finite fields
- Counting irreducible factors of polynomials over a finite field
- Remarks on the semigroup elements free of large prime factors
- Arithmetical semigroups. IV: Selberg's analysis
- Arithmetical semigroups. II: Sieving by large and small prime elements. Sets of multiples
- Limit distributions of sums of random variables defined on a finite homogeneous Markov chain. I
- Reciprocal Sums over Partitions and Compositions
- Singularity Analysis of Generating Functions
- Distinct Degree Factorizations for Polynomials over a Finite Field
- On some problems of a statistical group-theory. I
- Ordered Cycle Lengths in a Random Permutation
This page was built for publication: On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\)
