A generalization in affine type A of Coxeter sortable elements and Reading's bijection with noncrossing partitions
Jad Abou-Yassin

TL;DR
This paper extends the concept of Coxeter sortable elements and their bijection with noncrossing partitions from finite to affine symmetric groups, using biclosed sets and pattern avoidance criteria.
Contribution
It introduces a new characterization of affine c-sortable elements via pattern avoidance and establishes a bijection with affine c-noncrossing partitions through combinatorial objects.
Findings
Characterization of affine c-sortable elements by pattern avoidance.
Definition of c-sortable biclosed sets using TITOs on ℤ.
Establishment of a bijection with affine c-noncrossing partitions.
Abstract
This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite Coxeter groups. The generalization to the affine symmetric group of the c-sortable elements is achieved by using biclosed sets of reflections. Using recent works from Barkley and Speyer, these biclosed sets admit a sort of "one-line notation" called a TITO on (translation-invariant total order on ) that coincides with the usual one-line notation in the case of an affine permutation. We characterize the c-sortable elements of the affine symmetric group by pattern avoidance on their one-line notation, mirroring the well-known characterizations of c-sortable elements in the classical finite types. Based on this criterion, we…
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.
