EUVIMEDSkopri EUVIMED
Crossref

The Insertion Encoding of Cayley Permutations

Christian Bean, Paul Bell, Abigail Ollson

The Electronic Journal of Combinatorics · 2026-08-07 · 33 (3)

DOI: 10.37236/14191 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-08-07. Written by Christian Bean and 2 co-authors.

AstrattDettalji biblijografiċiCiteRelated studies

Abstract (original language)

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 com- puting the rational generating functions. We use our algorithm to solve an open problem of Cerbai by enumerating the hare pop-stack sortable Cayley permutations.

Cite

APA

Bean, C., Bell, P., & Ollson, A. (2026). The Insertion Encoding of Cayley Permutations. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/14191

Vancouver

Bean C, Bell P, Ollson A. The Insertion Encoding of Cayley Permutations. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/14191

BibTeX
@article{Bean2026,
  author = {Bean, Christian and Bell, Paul and Ollson, Abigail},
  title = {The Insertion Encoding of Cayley Permutations},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {3},
  doi = {10.37236/14191}
}
Start for free →