Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings
From MaRDI portal
Publication:4652621
DOI10.1137/S0895480103428053zbMath1071.05009MaRDI QIDQ4652621
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
finite field; combinatorial enumeration; Möbius inversion; multinomial coefficient; Lyndon word; integers mod \(q\)
05A15: Exact enumeration problems, generating functions
05A19: Combinatorial identities, bijective combinatorics
05E05: Symmetric functions and generalizations
Related Items
Counting irreducible polynomials with prescribed coefficients over a finite field, On the enumeration of irreducible polynomials over \(\mathrm{GF}(q)\) with prescribed coefficients