Mathematics – Combinatorics
Scientific paper
2004-04-30
Mathematics
Combinatorics
7 pages; 2 figures. Version 2: typos and a small error corrected; diagrams prettier; exposition improved following referee's s
Scientific paper
We provide a direct proof that a finite graded lattice with a maximal chain of left modular elements is supersolvable. This result was first established via a detour through EL-labellings in [McNamara-Thomas] by combining results of McNamara and Liu. As part of our proof, we show that the maximum graded quotient of the free product of a chain and a single-element lattice is finite and distributive.
No associations
LandOfFree
Graded left modular lattices are supersolvable 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 Graded left modular lattices are supersolvable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graded left modular lattices are supersolvable will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-287258