 |
Discrete Mathematics & Theoretical Computer Science |
Edward Richmond ; William Slofstra - Staircase diagrams and the enumeration of smooth Schubert varieties
dmtcs:6411 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6411Staircase diagrams and the enumeration of smooth Schubert varietiesArticle
Authors: Edward Richmond 
1,2; William Slofstra 3
- 1 Oklahoma State University [Stillwater]
- 2 University of Oklahoma
- 3 Institute for Quantum Computing [Waterloo]
In this extended abstract, we give a complete description and enumeration of smooth and rationally smooth Schubert varieties in finite type. In particular, we show that rationally smooth Schubert varieties are in bijection with a new combinatorial data structure called staircase diagrams.
Source: HAL:hal-02166337v1
Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Consultation statistics
This page has been seen 180 times.
This article's PDF has been downloaded 195 times.