Involution words: counting problems and connections to Schubert calculus for symmetric orbit closures
Zachary Hamaker, Eric Marberg, and Brendan Pawlowski

TL;DR
This paper introduces involution words and their enumerative properties, connecting combinatorics with geometry and Schubert calculus, and provides formulas for orbit closure cohomology classes.
Contribution
It defines involution analogues of key permutation objects and links them to geometric interpretations and representation theory, extending Schubert calculus to involutions.
Findings
Involution Stanley symmetric function for the longest element factors into staircase-shaped Schur functions.
Number of involution words equals the dimension of a Weyl group representation.
Provides formulas for cohomology classes of orbit closures in flag varieties.
Abstract
Involution words are variations of reduced words for involutions in Coxeter groups, first studied under the name of "admissible sequences" by Richardson and Springer. They are maximal chains in Richardson and Springer's weak order on involutions. This article is the first in a series of papers on involution words, and focuses on their enumerative properties. We define involution analogues of several objects associated to permutations, including Rothe diagrams, the essential set, Schubert polynomials, and Stanley symmetric functions. These definitions have geometric interpretations for certain intervals in the weak order on involutions. In particular, our definition of "involution Schubert polynomials" can be viewed as a Billey-Jockusch-Stanley type formula for cohomology class representatives of - and -orbit closures in the flag variety, defined…
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.
