The Number of Irreducible Polynomials and Lyndon Words with Given Trace

DOI10.1137/S0895480100368050zbMath0973.05002MaRDI QIDQ2719166

C. Robert Miers, Frank Ruskey, Joe Sawada

Publication date: 21 June 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100368050

zbMATH Keywords

trace; irreducible polynomial; Lyndon word

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

11T06: Polynomials over finite fields

Related Items

Counting irreducible polynomials over GF(3) with first and third coefficients given, A GENERIC HALL ALGEBRA OF THE KRONECKER ALGEBRA, The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace, Hall numbers and the composition algebra of the Kronecker algebra., Euclidean strings, Irreducible polynomials over GF(2) with prescribed coefficients., The action of \(\mathrm{GL}_2(\mathbb{F}_q)\) on irreducible polynomials over \(\mathbb{F}_q\), revisited, Normal bases and irreducible polynomials, Irreducible polynomials over \(\mathbb{F}_{2^r}\) with three prescribed coefficients, Counting solutions of special linear equations over finite fields, Counting irreducible polynomials with prescribed coefficients over a finite field, On the number of irreducible polynomials of special kinds in finite fields, On the enumeration of polynomials with prescribed factorization pattern, Finite noncommutative geometries related to \(\mathbb{F}_p[x\)], Irreducible polynomials over finite fields with prescribed trace/prescribed constant term, On the number of primitive polynomials over finite fields, PERIODIC 2-GRAPHS ARISING FROM SUBSHIFTS