A modular characterization of supersolvable lattices
Combinatorics
2022-01-31 v2
Abstract
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our characterization replaces the condition of gradedness with a second modularity condition on the maximal chain of left-modular elements.
Keywords
Cite
@article{arxiv.2011.11657,
title = {A modular characterization of supersolvable lattices},
author = {Stephan Foldes and Russ Woodroofe},
journal= {arXiv preprint arXiv:2011.11657},
year = {2022}
}
Comments
9 pages, 2 figures; v2 includes corrections for publication