Related papers: A symmetry theorem on a modified jeu de taquin
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…
Chalykh, Veselov and Feigin introduced the notions of quasiinvariants for Coxeter groups, which is a generalization of invariants. In [2], Bandlow and Musiker showed that for the symmetric group $S_n$ of order $n$, the space of…
The problem of the existence of an analytic normal form near an equilibrium point of an area-preserving map and analyticity of the associated coordinate change is a classical problem in dynamical systems going back to Poincar\'e and Siegel.…
We give new bounds and asymptotic estimates on the number of standard Young tableaux of skew shape in a variety of special cases. Our approach is based on Naruse's hook-length formula. We also compare our bounds with the existing bounds on…
We give a bijection between the symmetric group S_n, and the set of standard Young tableaux of rectangular shape m^n, m<=n, that have order n under jeu de taquin promotion.
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…
Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
We consider the set of forms of a toric variety over an arbitrary field: those varieties which become isomorphic to a toric variety after base field extension. In contrast to most previous work, we also consider arbitrary isomorphisms…
We present several equinumerous results between generalized oscillating tableaux and semistandard tableaux and give a representation-theoretical proof to them. As one of the key ingredients of the proof, we provide Pieri rules for the…
The rook graph is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m_1…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
Like the LR-tableau, a socle tableau is given as a skew diagram with certain entries. Unlike in the LR-tableau, the entries in the socle tableau are weakly increasing in each row, strictly increasing in each column and satisfy a modified…
We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…
A key fact about M.-P. Sch\"{u}tzenberger's (1972) promotion operator on rectangular standard Young tableaux is that iterating promotion once per entry recovers the original tableau. For tableaux with strictly increasing rows and columns,…
A {\em pointed partition} of $n$ is a pair $(\lambda, v)$ where $\lambda\vdash n$ and $v$ is a cell in its Ferrers diagram. We construct an involution on pointed partitions of $n$ exchanging "hook length" and "part length". This gives a…
We prove a $q$-analog of the following result due to McKay, Morse and Wilf: the probability that a random standard Young tableau of size $n$ contains a fixed standard Young tableau of shape $\lambda\vdash k$ tends to $f^{\lambda}/k!$ in the…
Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…
Based on Thomas and Yong's K-theoretic jeu de taquin algorithm, we prove a uniform Littlewood-Richardson rule for the K-theoretic Schubert structure constants of all minuscule homogeneous spaces. Our formula is new in all types. For the…
We define a solitary game, the Yamanouchi toppling game, on any connected graph of n vertices. The game arises from the well-known chip-firing game when the usual relation of equivalence defined on the set of all configurations is replaced…