English

Lattice homomorphisms between weak orders

Combinatorics 2026-05-20 v6

Abstract

We classify surjective lattice homomorphisms WWW\to W' between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences Θ\Theta on WW such that the quotient W/ΘW/\Theta is isomorphic to WW'. Surprisingly, surjective homomorphisms exist quite generally: They exist if and only if the diagram of WW' is obtained from the diagram of WW by deleting vertices, deleting edges, and/or decreasing edge labels. A surjective homomorphism WWW\to W' is determined by its restrictions to rank-two standard parabolic subgroups of WW. Despite seeming natural in the setting of Coxeter groups, this determination in rank two is nontrivial. Indeed, from the combinatorial lattice theory point of view, all of these classification results should appear unlikely a priori. As an application of the classification of surjective homomorphisms between weak orders, we also obtain a classification of surjective homomorphisms between Cambrian lattices and a general construction of refinement relations between Cambrian fans.

Keywords

Cite

@article{arxiv.1712.01723,
  title  = {Lattice homomorphisms between weak orders},
  author = {Nathan Reading},
  journal= {arXiv preprint arXiv:1712.01723},
  year   = {2026}
}

Comments

46 pages. Version 2: Minor expository changes, in the abstract and introduction only. Version 3: Added uniform Lie-theoretic proof of root system containment result for Kac-Moody root systems. Version 4: Added citation for the proof added in version 3. Version 5: Final version (modulo formatting) to appear in the Electronic Journal of Combinatorics. Version 6: Some post-publication corrections

R2 v1 2026-06-22T23:07:31.144Z