Tower tableaux and Schubert polynomials
Combinatorics
2016-08-11 v2
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.
Cite
@article{arxiv.1303.7389,
title = {Tower tableaux and Schubert polynomials},
author = {Olcay Coşkun and Müge Taşkın},
journal= {arXiv preprint arXiv:1303.7389},
year = {2016}
}