A new proof of a theorem of \textit{M. Aigner} [Math. Ann. 207, 1-22 (1973; Zbl 0257.06002)] is presented and then the following result is deduced: Let L be a supersolvable geometric lattice in which each quotient [x,1] has a characteristic polynomial which equals the characteristic polynomial of a partition lattice. Then L is isomorphic to a partition lattice.
Recommendations
- scientific article; zbMATH DE number 724048
- scientific article; zbMATH DE number 67323
- scientific article; zbMATH DE number 5799716
- scientific article; zbMATH DE number 802723
- Characterizable classes of lattices
- The restricted partition lattices
- Convex partitions of a finite lattice
- The lattice of finite subspace partitions
- Lattices on simplicial partitions
- scientific article; zbMATH DE number 4068271
Cites work
Cited in
(12)- Techniques in matroid reconstruction
- The restricted partition lattices
- Integral characteristics by keyspace partitioning
- Representing partition lattices through FCA
- A geometric study of cores of idempotent stochastic matrices
- scientific article; zbMATH DE number 5799716 (Why is no real title available?)
- scientific article; zbMATH DE number 50252 (Why is no real title available?)
- scientific article; zbMATH DE number 67323 (Why is no real title available?)
- scientific article; zbMATH DE number 781255 (Why is no real title available?)
- scientific article; zbMATH DE number 802723 (Why is no real title available?)
- Factoring the characteristic polynomial of a lattice
- Lattice of all subsets of a finite set and partition lattice of a \(n\)-set.
This page was built for publication: Characterizations of partition lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759778)