The following pages link to (Q5626468):
Displaying 14 items.
- The formal series Witt transform (Q556844) (← links)
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- Necklaces, symmetries and self-reciprocal polynomials (Q1252858) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- The standard factorization of Lyndon words: an average point of view (Q1764900) (← links)
- Semisimple orbits of Lie algebras and card-shuffling measures on Coxeter groups (Q1970984) (← links)
- Groups acting on necklaces and sandpile groups (Q2256648) (← links)
- Difference equations with delay (Q2258375) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Witt vectors. Part 1 (Q3053864) (← links)
- A Method to Compute Minimal Polynomials (Q3735078) (← links)
- Zeta Functions of Formal Languages (Q4711989) (← links)
- Randomness and Representation of Span n Sequences (Q5448574) (← links)
- Applications of the Brauer complex: card shuffling, permutation statistics, and dynamical systems (Q5949413) (← links)
