The work defines c-sortable biclosed sets in the affine symmetric group via pattern-avoiding TITOs and proves a bijection to c-noncrossing partitions using correspondences with arc diagrams and annular partitions.
On the Weak Order of Coxeter Groups , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
An algorithm computes joins in the weak order of type B Coxeter groups, extending Markowsky's algorithm to signed permutations and confirming Dyer's geometric conjecture.
citing papers explorer
-
A generalization in affine type A of Coxeter sortable elements and Reading's bijection with noncrossing partitions
The work defines c-sortable biclosed sets in the affine symmetric group via pattern-avoiding TITOs and proves a bijection to c-noncrossing partitions using correspondences with arc diagrams and annular partitions.
-
Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach
An algorithm computes joins in the weak order of type B Coxeter groups, extending Markowsky's algorithm to signed permutations and confirming Dyer's geometric conjecture.