Noncrossing arc diagrams of type B (2504.14393v1)

Abstract: Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for signed permutations. One model features centrally symmetric noncrossing arc diagrams, while the other features their quotients modulo the central symmetry. We demonstrate the utility of the models by applying them to various questions about lattice quotients of the weak order.