Graded left modular lattices are supersolvable
نویسندگان
چکیده
منابع مشابه
Graded Left Modular Lattices Are Supersolvable
Abstract. 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 [MT] by combining results of McNamara [Mc] and Liu [Li]. 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 di...
متن کاملLeft-Modular Elements of Lattices
Left-modularity is a concept that generalizes the notion of modularity in lattice theory. In this paper, we give a characterization of left-modular elements and derive two formulae for the characteristic polynomial, /, of a lattice with such an element, one of which generalizes Stanley's theorem [6] about the partial factorization of / in a geometric lattice. Both formulae provide us with induc...
متن کاملSupersolvable Frame-matroid and Graphic-lift Lattices
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...
متن کاملA Generalization of Semimodular Supersolvable Lattices
Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular latt...
متن کاملSupersolvable LL-lattices of binary trees
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra universalis
سال: 2005
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-005-1914-4