Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings

DOI10.1137/S0895480103428053zbMath1071.05009OpenAlexW2061027724MaRDI QIDQ4652621

C. Robert Miers, Frank Ruskey

Publication date: 28 February 2005

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

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

zbMATH Keywords

finite fieldcombinatorial enumerationMöbius inversionmultinomial coefficientLyndon wordintegers mod \(q\)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Symmetric functions and generalizations (05E05)

Related Items (2)

Counting irreducible polynomials with prescribed coefficients over a finite field ⋮ On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients

This page was built for publication: Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings