A bijection between words and multisets of necklaces

DOI10.1016/j.ejc.2012.03.016zbMath1244.05016OpenAlexW2023927275MaRDI QIDQ444410

Ira M. Gessel, Antonio Restivo, Christophe Reutenauer

Publication date: 14 August 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.016

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Formal languages and automata (68Q45)

Related Items (8)

Wheeler graphs: a framework for BWT-based data structures ⋮ A new class of string transformations for compressed text indexing ⋮ On a curious variant of the \(S_n\)-module \(\text{Lie}_n\) ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ Unnamed Item ⋮ Inverse Lyndon words and inverse Lyndon factorizations of words ⋮ The alternating BWT: an algorithmic perspective ⋮ A new class of searchable and provably highly compressible string transformations

Cites Work

• Burrows-Wheeler transform and Sturmian words
• Counting permutations with given cycle structure and descent set
• Plethysm and conjugation of quasi-symmetric functions.
• A note on the Burrows-Wheeler transformation
• An extension of the Burrows-Wheeler transform
• Generalized Lie Elements
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bijection between words and multisets of necklaces