Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lattice homomorphisms between weak orders (1712.01723v5)

Published 5 Dec 2017 in math.CO

Abstract: We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly, surjective homomorphisms exist quite generally: They exist if and only if the diagram of $W'$ is obtained from the diagram of $W$ by deleting vertices, deleting edges, and/or decreasing edge labels. A surjective homomorphism $W\to W'$ is determined by its restrictions to rank-two standard parabolic subgroups of $W$. 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.

Summary

We haven't generated a summary for this paper yet.