Tableau stabilization and lattice paths (Q5918474)

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.