Tower tableaux and Schubert polynomials

2013/03/29 by Coşkun, Olcay, Taşkın, Müge
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1303.7389

Abstract

We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the characterization, we obtain descriptions of Schubert polynomials and Stanley symmetric functions.

Related

• Inversions Tableaux
• Tower Diagrams and Pieri's Rule
• Combinatorial models for Schubert polynomials
• Constructed tableaux and a new shifted Littlewood-Richardson rule
• Bumpless Pipedreams, Reduced Word Tableaux and Stanley Symmetric Functions