2000 character limit reached
Enumerating Staircase Diagrams and Smooth Schubert Varieties over type $E$ Dynkin Diagrams
Published 10 Jan 2021 in math.CO and math.AG | (2101.03476v3)
Abstract: We enumerate the number of staircase diagrams over classically finite $E$-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 $E$-type thereby giving an enumeration of these varieties.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.