Lattice Congruences of the Weak Order
Order · 2004-11 · 21 (4) · 315-344
DOI: 10.1007/s11083-005-4803-8 ↗Kurz gefasst
Fachartikel in der Zeitschrift Order, online erschienen am 04.10.2005. Verfasst von Nathan Reading. Die Arbeit wurde bisher 53-mal zitiert (Crossref) und nennt 25 Literaturangaben.
Abstract (Originalsprache)
AbstractWe 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\subseteq S$ , let ηK: w↦wK be the projection onto the parabolic subgroup WK. We show that the fibers of ηK constitute the smallest lattice congruence with 1≡s for every s∈(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.
Zitieren
APA
Reading, N. (2004). Lattice Congruences of the Weak Order. Order, 21(4), 315-344. https://doi.org/10.1007/s11083-005-4803-8
Vancouver
Reading N. Lattice Congruences of the Weak Order. Order. 2004;21(4):315-344. doi:10.1007/s11083-005-4803-8
BibTeX
@article{Reading2004,
author = {Reading, Nathan},
title = {Lattice Congruences of the Weak Order},
journal = {Order},
year = {2004},
volume = {21},
number = {4},
pages = {315--344},
doi = {10.1007/s11083-005-4803-8}
}
EUVIMED