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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A randomized algorithm exactly samples weighted partial triangulations of convex polygons in expected O((n sqrt(lambda) + 1) log n) time for large n.
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.
-
On weighted partial triangulations of convex polygons
A randomized algorithm exactly samples weighted partial triangulations of convex polygons in expected O((n sqrt(lambda) + 1) log n) time for large n.