2000/06/19 by Karen L. Collins, Collins, Karen L.
Computer Science · Mathematics · #05A #06A #Advanced Algebra and Logic #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Rings, Modules, and Algebras #math.CO #msc:05A #msc:06A
paper · pdf · doi:10.48550/arxiv.math/0006131
5 pages
arxiv created 2000/06/19 · openalex publication_date 2000/06/19 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be interval-connected. An example of a planar, rank-connected lattice that is not admissible is given.