Related papers: Promotion and cyclic sieving via webs
Using Henriques' and Kamnitzer's cactus groups, Sch\"utzenberger's promotion and evacuation operators on standard Young tableaux can be generalised in a very natural way to operators acting on highest weight words in tensor products of…
Schutzenberger's promotion operator, pro, is a fundamental map in dynamical algebraic combinatorics. At first, its action was mainly considered on standard Young tableaux. But pro was subsequently shown to have interesting properties when…
We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees…
We define piecewise-linear and birational analogues of the toggle-involutions on order ideals of posets studied by Striker and Williams and use them to define corresponding analogues of rowmotion and promotion that share many of the…
The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…
Promotion permutations have recently been associated to each rectangular standard Young tableau by Gaetz--Pechenik--Pfannerer--Striker--Swanson. Here we relate promotion permutations to the Robinson--Schensted (RS) correspondence. More…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…
We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…
We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of…
We construct a large class of examples of the cyclic sieving phenomenon by expoiting the representation theory of semi-simple Lie algebras. Let $M$ be a finite dimensional representation of a semi-simple Lie algebra and let $B$ be the…
We study rotation of invariant vectors in tensor products of minuscule representations. We define a combinatorial notion of rotation of minuscule Littelmann paths. Using affine Grassmannians, we show that this rotation action is realized…
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…
Inspired by recent work on refraction billiards in dynamics, we introduce a notion of refraction for combinatorial billiards. This allows us to define a generalization of toric promotion that we call toric promotion with reflections and…
We study piecewise-linear and birational lifts of Sch\"utzenberger promotion, evacuation, and the RSK correspondence defined in terms of toggles. Using this perspective, we prove that certain chain statistics in rectangles shift predictably…
Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the…
Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, [Gaetz, Pechenik, Pfannerer, Striker, Swanson 2023+] found a rotation-invariant web basis for $\mathrm{SL}_4$, as well…