Lattice congruences of the weak order

Details Lattice congruences of the weak order Lattice congruences of the weak order

2004-01-28

arxiv.org/abs/math/0401404v1

Order, 21 (2004) no.4, 315-344.

Mathematics

Combinatorics

26 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Lattice congruences of the weak order does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lattice congruences of the weak order, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lattice congruences of the weak order will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-588125