Extended weak order for the affine symmetric group

Abstract

The extended weak order on a Coxeter group W is the poset of biclosed sets in its root system. In (Barkley-Speyer 2024), it was shown that when W=Sn is the affine symmetric group, then the extended weak order is a quotient of the lattice Ln of translation-invariant total orderings of the integers. In this article, we give a combinatorial introduction to Ln and the extended weak order on Sn. We show that Ln is an algebraic completely semidistributive lattice. We describe its canonical join representations using a cyclic version of Reading's non-crossing arc diagrams. We also show analogous statements for the lattice of all total orders of the integers, which is the extended weak order on the symmetric group S∞. A key property of both of these lattices is that they are profinite; we also prove that a profinite lattice is join semidistributive if and only if its compact elements have canonical join representations. We conjecture that the extended weak order of any Coxeter group is a profinite semidistributive lattice.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…