scientific article; zbMATH DE number 3351382

MaRDI QIDQ5626468zbMATH OpenFDO

Authors S. W. Golomb

Publication date 1969

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06) Synchronization error-correcting codes (94B50)

Cited in

(15)

• An algorithm for generating necklaces of beads in two colors
• Necklaces, symmetries and self-reciprocal polynomials
• Average cost of Duval's algorithm for generating Lyndon words
• The standard factorization of Lyndon words: an average point of view
• Semisimple orbits of Lie algebras and card-shuffling measures on Coxeter groups
• Groups acting on necklaces and sandpile groups
• Difference equations with delay
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Witt vectors. I
• A Method to Compute Minimal Polynomials
• Zeta Functions of Formal Languages
• Randomness and Representation of Span n Sequences
• The formal series Witt transform
• Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems
• Necklaces, permutations, and periodic critical orbits for quadratic polynomials

This page was built for publication:

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