English
Related papers

Related papers: Promotion and cyclic sieving via webs

200 papers

We prove a collection of conjectures of D. White \cite{WComm}, as well as some related conjectures of Abuzzahab-Korson-Li-Meyer \cite{AKLM} and of Reiner and White \cite{ReinerComm}, \cite{WComm}, regarding the cyclic sieving phenomenon of…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades

We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hook shapes, where we use the cocharge generating polynomial as…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Ezgi Kantarci Oğuz , Svante Linusson

We give a new proof of the cyclic sieving phenomena for promotion on rectangular standard tableaux. This uses an action of the cactus groups in the seminormal bases of the irreducible representations of the Hecke algebras.

Representation Theory · Mathematics 2019-06-18 Bruce W. Westbury

We introduce the notion of a generalized oscillating tableau and define a promotion operation on such tableaux that generalizes the classical promotion operation on standard Young tableaux. As our main application, we show that this…

Combinatorics · Mathematics 2017-09-14 Rebecca Patrias

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Stephan Pfannerer , Martin Rubey , Joakim Uhlin

Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…

Combinatorics · Mathematics 2021-02-04 Tair Akhmejanov , Balázs Elek

In our companion paper, we develop a new $SL_4$-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. A guiding principle behind our…

Combinatorics · Mathematics 2025-05-02 Christian Gaetz , Oliver Pechenik , Stephan Pfannerer , Jessica Striker , Joshua P. Swanson

The first author recently introduced toric promotion, an operator that acts on the labelings of a graph $G$ and serves as a cyclic analogue of Sch\"utzenberger's promotion operator. Toric promotion is defined as the composition of certain…

Combinatorics · Mathematics 2023-06-01 Colin Defant , Rachana Madhukara , Hugh Thomas

We prove a cyclic sieving result for the set of $3 \times k$ packed increasing tableaux with maximum entry $m :=3+k$ under K-promotion. The "curiosity" is that the sieving polynomial arises from the $q$-hook formula for standard tableaux of…

Combinatorics · Mathematics 2022-05-09 Christian Gaetz , Oliver Pechenik , Jessica Striker , Joshua P. Swanson

We introduce toric promotion as a cyclic analogue of Sch\"utzenberger's promotion operator. Toric promotion acts on the set of labelings of a graph $G$. We discuss connections between toric promotion and previously-studied notions such as…

Combinatorics · Mathematics 2022-09-20 Colin Defant

Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under…

Combinatorics · Mathematics 2025-08-18 Rebecca Patrias , Oliver Pechenik , Jessica Striker

In this note, we provide a short proof of Theorem 3.3 in the paper titled \emph{Crystals, semistandard tableaux and cyclic sieving phenomenon}, by Y.-T.~Oh and E.~Park, which concerns a cyclic sieving phenomenon on semi-standard Young…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson

In this work we study Sch\"utzenberger's promotion operator on standard Young tableaux via a corresponding graphical construction known as $m-$diagrams. In particular, we prove that certain internal structures of SYT are preserved under…

Combinatorics · Mathematics 2025-06-30 Elise Catania , Jack Kendrick , Heather M. Russell , Julianna Tymoczko

(Dual-)promotion and (dual-)evacuation are bijections on SYT(\lambda) for any partition \lambda. Let c^r denote the rectangular partition (c,...,c) of height r, and let sc_k (k > 2) denote the staircase partition (k,k-1,...,1). B. Rhoades…

Combinatorics · Mathematics 2015-03-13 Steven Pon , Qiang Wang

In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(\lambda)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if…

Combinatorics · Mathematics 2019-06-19 Young-Tak Oh , Euiyong Park

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

Combinatorics · Mathematics 2022-07-08 Kevin Purbhoo , Shelley Wu

Recently, Armon and Swanson introduced signed standard tableaux and a corresponding super major index that refines the classical major index. In this paper, we prove that signed standard tableaux of rectangular shape exhibit a cyclic…

Combinatorics · Mathematics 2026-03-18 Stephan Pfannerer

We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,n^b)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial^{b+2} \rangle, f(q))$ exhibits the…

Combinatorics · Mathematics 2023-03-01 Joshua Basman Monterrubio , Graeme Henrickson , Anna Stokke

We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small $m$-Schr\"oder paths and give a bijection between the set of increasing rectangular tableaux and small…

Combinatorics · Mathematics 2018-08-20 Timothy Pressey , Anna Stokke , Terry Visentin

The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple…

Combinatorics · Mathematics 2011-02-10 Bruce E. Sagan
‹ Prev 1 2 3 10 Next ›