The Insertion Encoding of Restricted Growth Functions
Abstract
Abstract We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for which these languages are regular. For the horizontal insertion encoding, we also prove that the conditions to be regular are the same for restricted growth functions of matchings.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
semigroups and automata theory
Advanced Graph Theory Research
Publication details
- Journal / source
- Annals of Combinatorics
- Publisher
- Springer Science and Business Media LLC
- Publication date
- 20 June 2026
- Language
- EN