Two partial orders for standard Young tableaux (Q2315441)

The box and dominance partial orders are two natural combinatorial partial orders on standard Young tableaux of the same shape. These partial orders describe the geometry of varieties of invariant subspaces of nilpotent linear operators. It is easy to see that the dominance order is finer than the box order; several other orders known to be between these two are also of algebraic or geometric interest [\textit{J. Kosakowska} and \textit{M. Schmidmeier}, Math. Z. 290, No. 3--4, 953--972 (2018; Zbl 1408.14150)]. The authors give two proofs that the box and dominance partial orders, and thus all the intermediate partial orders, are equivalent. The first proof relates the ordering relations to the Bruhat order. The second proof is algorithmic; if \(ZX\) in the dominance order, it gives a sequence of covers in the box order connecting \(Z\) to \(X\).