Abstract
We show that if G is a finite group then no chain of modular elements in its subgroup lattice L ( G ) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L ( G ) has length at least two more than the chief length of G, thereby providing a converse of a result of J. Kohler. Our results enable us to give a new characterization of finite solvable groups involving only the combinatorics of subgroup lattices. Namely, a finite group G is solvable if and only if L ( G ) contains a maximal chain X and a chain M consisting entirely of modular elements, such that X and M have the same length.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
