Search arXiv⌕ Search

arXiv · 2507.01097

Cylindric growth diagrams, walks in simplices, and exclusion processes

Abstract

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 cylindric analogue of the Robinson--Schensted 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 of the correspondence, and it allows us to interpret the above walks as oscillating cylindric tableaux.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergi Elizalde. 2026-06-06. Cylindric growth diagrams, walks in simplices, and exclusion processes. https://arxiv.org/abs/2507.01097

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$

Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework unifies classical Roman, double, triple, and higher-strength protection schemes by allowing each fortified vertex to provide up to $k$ levels of support. In this paper, we investigate the $[k]$-Roman domination number $γ_{[k]R}(G)$ on cylindrical grids $C_m \Box P_n$. We relate $[k]$-Roman domination to efficient domination and establish exact values for regular graphs admitting an efficient dominating set; as a consequence, we obtain explicit values for broad families of toroidal grids and determine exactly when the cylindrical graphs $C_m\Box P_n$ admit an efficient dominating set. Building on these structural insights, we derive several upper bounds for $γ_{[k]R}(C_m \Box P_n)$ for small fixed values of $m$, accompanied by explicit labeling patterns that attain these bounds. All obtained bounds are systematically compared, revealing parameter ranges in which different constructions dominate depending on the value of $k$ and the length of the path. In addition, we present exact packing numbers for selected cylindrical graphs, which complement the domination results and enable further refinements via local weight reductions. Our results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.

math.CO↗