Tableau stabilization and lattice paths

DOI10.4310/JOC.2022.V13.N1.A5MaRDI QIDQ5918474zbMATH OpenOpenAlexFDO

Authors Connor Ahlbach, Jacob David, Suho Oh, Christopher Wu

Publication date 3 February 2022

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.02644

zbMATH Keywords

cyclic sievingjeu-de-taquinpermutationpromotionrectificatonstabilizationtableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Group actions on combinatorial structures (05E18)

Abstract: If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally developed to construct the sufficiently large rectangular tableaux fixed by given powers of promotion, the purpose of this paper is to improve the original bound on tableau stabilization to the number of rows of the skew tableau. In order to prove this bound, we encode increasing subsequences as lattice paths and show that various operations on these lattice paths weakly increase the maximum combined length of the increasing subsequences.

Review text

The purpose of this paper is to prove a conjecture of \textit{C. Ahlbach} [J. Algebr. Comb. 53, No. 4, 1057--1116 (2021; Zbl 1473.05318)] on tableau stabilization, a notion introduced in [loc. cit.] to construct large rectangular tableaux fixed by powers of the promotion operator. The basic idea of tableau stabilization is the following: starting with a standard tableau \(T\) whose (skew) shape has weakly decreasing row sizes, attach shifted copies of \(T\) to the right of itself; after how many copies will the entries in the right-most shifted copy of \(T\) remain in the same row upon rectification? The conjecture asserts that the number of rows of \(T\) is an upper bound for the number of shifted copies of \(T\) which must be added to achieve stabilization. The proof is accomplished using \textit{C. Greene}'s [Adv. Math. 14, 254--265 (1974; Zbl 0303.05006)] theorem on increasing subsequences and a further reformulation in terms of lattice paths. The paper is very well-written and contains illuminating examples.

Recommendations

• Tableau stabilization and lattice paths
• Tableau stabilization and rectangular tableaux fixed by promotion powers
• Dual equivalence with applications, including a conjecture of Proctor
• Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
• Some results on two conjectures of Schützenberger

Cited in

(2)

• Tableau stabilization and rectangular tableaux fixed by promotion powers
• Tableau stabilization and lattice paths

This page was built for publication: Tableau stabilization and lattice paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918474)