Graded left modular lattices are supersolvable
| dc.creator | Thomas, Hugh | |
| dc.date | 2004-04-30 | |
| dc.date | 2004-10-12 | |
| dc.date.accessioned | 2026-07-07T05:07:49Z | |
| dc.date.available | 2026-07-07T05:07:49Z | |
| dc.description | 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. | |
| dc.description | 7 pages; 2 figures. Version 2: typos and a small error corrected; diagrams prettier; exposition improved following referee's suggestions; version to appear in Algebra Universalis | |
| dc.identifier | https://arxiv.org/abs/math/0404544 | |
| dc.identifier | http://arxiv.org/abs/math/0404544 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71013 | |
| dc.subject | Combinatorics | |
| dc.subject | 06B05; 06B25 | |
| dc.title | Graded left modular lattices are supersolvable | |
| dc.type | text |