Enumerating Staircase Diagrams and Smooth Schubert Varieties over type $E$ Dynkin Diagrams
Andean E. Medjedovic, William Slofstra

TL;DR
This paper counts staircase diagrams over finite type E Dynkin diagrams, linking them to smooth Schubert varieties, thereby completing their enumeration over all finite type Dynkin diagrams.
Contribution
It extends previous work by enumerating staircase diagrams over E-type Dynkin diagrams, connecting them to smooth Schubert varieties and completing the enumeration for finite types.
Findings
Number of staircase diagrams over E-type Dynkin diagrams is explicitly enumerated.
Bijection established between staircase diagrams and smooth Schubert varieties.
Completes enumeration of staircase diagrams for all finite type Dynkin diagrams.
Abstract
We enumerate the number of staircase diagrams over classically finite -type Dynkin diagrams, extending the work of Richmond and Slofstra (Staircase Diagrams and Enumeration of smooth Schubert varieties) and completing the enumeration of staircase diagrams over finite type Dynkin diagrams. The staircase diagrams are in bijection to smooth and rationally smooth Schubert varieties over -type thereby giving an enumeration of these varieties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
