Characterizations of partition lattices
type: Item
instance of: scholarly article
title: Characterizations of partition lattices
zbMATH Open document ID: 0554.06008
DOI: 10.1007/BF01191496
author: J. Randolph Stonesifer
author: Kenneth P. Bogart
published in: Algebra Universalis
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 06C10
Mathematics Subject Classification ID: 05A17
zbMATH DE Number: 3882497
zbMATH Keywords: supersolvable geometric lattice
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: partition lattice
reviewed by: Ján Jakubík
MaRDI profile type: Publication
cites work: Q5619114
cites work: Q3956998
cites work: Modular elements of geometric lattices
full work available at URL: https://doi.org/10.1007/bf01191496
OpenAlex ID: W2092844304
Recommended article: Q4323521
Recommended article: Q4012031
Recommended article: Q3160624
Recommended article: Q4849838
Recommended article: Characterizable classes of lattices
Recommended article: The restricted partition lattices
Recommended article: Convex partitions of a finite lattice
Recommended article: The lattice of finite subspace partitions
Recommended article: Lattices on simplicial partitions
Recommended article: Q3801065
description: scientific article; zbMATH DE number 3882497