scholarly journals Promotion of Increasing Tableaux: Frames and Homomesies

10.37236/6836 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Oliver Pechenik

A key fact about M.-P. Schü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, H. Thomas and A. Yong (2009) introduced a theory of $K$-jeu de taquin with applications to $K$-theoretic Schubert calculus. The author (2014) studied a $K$-promotion operator $\mathcal{P}$ derived from this theory, but observed that this key fact does not generally extend to $K$-promotion of such increasing tableaux. Here, we show that the key fact holds for labels on the boundary of the rectangle. That is, for $T$ a rectangular increasing tableau with entries bounded by $q$, we have $\mathsf{Frame}(\mathcal{P}^q(T)) = \mathsf{Frame}(T)$, where $\mathsf{Frame}(U)$ denotes the restriction of $U$ to its first and last row and column. Using this fact, we obtain a family of homomesy results on the average value of certain statistics over $K$-promotion orbits, extending a $2$-row theorem of J. Bloom, D. Saracino, and the author (2016) to arbitrary rectangular shapes.


10.37236/5885 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Kevin Purbhoo ◽  
Donguk Rhee

We give a bijection between the symmetric group $S_n$, and the set of standard Young tableaux of rectangular shape $m^n$, $m \geq n$, that have order $n$ under jeu de taquin promotion. 



2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Robin Sulzgruber

International audience The number of standard Young tableaux of a fixed shape is famously given by the hook-length formula due to Frame, Robinson and Thrall. A bijective proof of Novelli, Pak and Stoyanovskii relies on a sorting algorithm akin to jeu-de-taquin which transforms an arbitrary filling of a partition into a standard Young tableau by exchanging adjacent entries. Recently, Krattenthaler and Müller defined the complexity of this algorithm as the average number of performed exchanges, and Neumann and the author proved it fulfils some nice symmetry properties. In this paper we recall and extend the previous results and provide new bijective proofs.



2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu


1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.



10.37236/6466 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Ping Sun

Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and $g_{n,5}$ respectively. Specifically, $g_{n,4}$ is the $(2n-1)$-st Pell number.



10.37236/3890 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Ping Sun

In this paper the number of standard Young tableaux (SYT) is evaluated by the methods of multiple integrals and combinatorial summations. We obtain the product formulas of the numbers of skew SYT of certain truncated shapes, including the skew SYT $((n+k)^{r+1},n^{m-1}) / (n-1)^r $ truncated by a rectangle or nearly a rectangle, the skew SYT of truncated shape $((n+1)^3,n^{m-2}) / (n-2) \backslash \; (2^2)$, and the SYT of truncated shape $((n+1)^2,n^{m-2}) \backslash \; (2)$.





1984 ◽  
Vol 17 (1) ◽  
pp. 19-45 ◽  
Author(s):  
R C King ◽  
N G I El-Sharkaway




Sign in / Sign up

Export Citation Format

Share Document