English

Lattice congruences of the weak order

Combinatorics 2026-05-13 v1

Abstract

We study the congruence lattice of the poset of regions of a hyperplane arrangement, with particular emphasis on the weak order on a finite Coxeter group. Our starting point is a theorem from a previous paper which gives a geometric description of the poset of join-irreducibles of the congruence lattice of the poset of regions in terms of certain polyhedral decompositions of the hyperplanes. For a finite Coxeter system (W,S) and a subset K of S, let \eta_K:w \mapsto w_K be the projection onto the parabolic subgroup W_K. We show that the fibers of \eta_K constitute the smallest lattice congruence with 1\equiv s for every s\in(S-K). We give an algorithm for determining the congruence lattice of the weak order for any finite Coxeter group and for a finite Coxeter group of type A or B we define a directed graph on subsets or signed subsets such that the transitive closure of the directed graph is the poset of join-irreducibles of the congruence lattice of the weak order.

Keywords

Cite

@article{arxiv.math/0401404,
  title  = {Lattice congruences of the weak order},
  author = {Nathan Reading},
  journal= {arXiv preprint arXiv:math/0401404},
  year   = {2026}
}

Comments

26 pages, 4 figures