Richardson tableaux and Motzkin paths
arXiv:2608.21245
Abstract
Richardson tableaux were introduced by Karp and Precup in their study of irreducible components of Springer fibers that are Richardson varieties. Guo gave an explicit bijection between Richardson tableaux and Motzkin paths through noncrossing involutions and the Robinson--Schensted (RS) algorithm. In this paper, we study Richardson tableaux of a fixed shape from the viewpoint of Motzkin paths. We introduce a shape algorithm, independent of the RS algorithm, that directly determines the shape of the corresponding Richardson tableau from a Motzkin path. Based on this algorithm, we construct a local bijection which keeps track of the major statistic and reproves combinatorially Karp and Precup's -enumeration formula for Richardson tableaux of a given shape. We also prove a conjecture of Guo on the comajor generating function for Richardson tableaux with a prescribed number of odd columns.
20 pages, 10 figures