Mathematics – Combinatorics
Scientific paper
2010-02-04
Mathematics
Combinatorics
Scientific paper
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a theorem of Putcha and Renner which identifies the cross section lattice in the Boolean lattice of subsets of the nodes of a Dynkin diagram. We determine the join irreducibles of the cross section lattice. Exploiting this we find characterizations of the relatively complemented intervals. By a result of Putcha, this determines the M\"{o}bius function for $\Lambda$. We show that an interval of the cross section lattice is Boolean if and only if it is relatively complemented if and only if it is atomic. We characterize distributive cross section lattices, showing that they are products of chains. We determine which cross section lattices are supersolvable, and furthermore, we compute the characteristic polynomials of these supersolvable cross section lattices. At the end of the article we indicate some future research directions.
No associations
LandOfFree
Supersolvable lattices of $J$-classes 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 Supersolvable lattices of $J$-classes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supersolvable lattices of $J$-classes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-155556