A Unified Approach to Combinatorial Formulas for Schubert Polynomials
Cristian Lenart
Abstract
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials; we also present simplifications in some of the existing approaches to this area. We designate certain line diagrams known as rc-graphs as the main structure. The other structures in the literature we study include: semistandard Young tableaux, Kohnert diagrams, and balanced labelings of the diagram of a permutation. The main tools in our investigation are certain operations on rc-graphs, which correspond to the coplactic operations on tableaux, and thus define a crystal graph structure on rc-graphs; a new definition of these operations is presented. One application of these operations is a straightforward, purely combinatorial proof of a recent formula (due to Buch, Kresch, Tamvakis, and Yong), which expresses Schubert polynomials in terms of products of Schur polynomials. In spite of the fact that it refers to many objects and results related to them, the paper is mostly self-contained.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.