The insertion encoding of Cayley permutations
classification
🧮 math.CO
keywords
cayleypermutationsinsertionalgorithmencodingcasescerbaiclasses
read the original abstract
We introduce the vertical and horizontal insertion encodings for Cayley permutations which naturally generalise the insertion encoding for permutations. In both cases, we fully classify the Cayley permutation classes for which these languages are regular, and provide an algorithm for computing the rational generating functions. We use our algorithm to solve an open problem of Cerbai by enumerating the hare pop-stack sortable Cayley permutations.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The insertion encoding of restricted growth functions
Classifies regularity of vertical and horizontal insertion encodings for restricted growth functions and extends the horizontal result to matchings.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.