EUVIMEDScopri EUVIMED
Crossref

Cylindric Growth Diagrams, Walks in Simplices, and Exclusion Processes

Sergi Elizalde

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

DOI: 10.37236/14467 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-07-03. Written by Sergi Elizalde.

AbstractDati bibliograficiCiteRelated studies

Abstract (original language)

We establish bijections between three classes of combinatorial objects that have been studied in very different contexts: lattice walks in simplicial regions as introduced by Mortimer--Prellberg, standard cylindric tableaux as introduced by Gessel--Krattenthaler and Postnikov, and sequences of states in the totally asymmetric simple exclusion process. This perspective allows us to translate symmetries from one setting into another, revealing unexpected properties of these objects. Specifically, we show that a recent bijection of Courtiel, Elvey Price and Marcovici between certain simplicial walks with forward and backward steps is equivalent to a special case of a cylindric analogue of the Robinson--Schensted--Knuth correspondence. Originally defined by Neyman by iterating an insertion operation, we provide an alternative description of this correspondence by introducing a cylindric version of Fomin's growth diagrams. This natural description elucidates the symmetry obtained when switching the insertion an recording tableaux, and it allows us to interpret the above walks as oscillating cylindric tableaux.

Cite

APA

Elizalde, S. (2026). Cylindric Growth Diagrams, Walks in Simplices, and Exclusion Processes. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/14467

Vancouver

Elizalde S. Cylindric Growth Diagrams, Walks in Simplices, and Exclusion Processes. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/14467

BibTeX
@article{Elizalde2026,
  author = {Elizalde, Sergi},
  title = {Cylindric Growth Diagrams, Walks in Simplices, and Exclusion Processes},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {3},
  doi = {10.37236/14467}
}
Start for free →