Antichain cutsets of strongly connected posets

DOI10.1007/S11083-012-9248-2MaRDI QIDQ2376903zbMATH OpenOpenAlexFDO

Authors Stephan Foldes, Russ Woodroofe

Publication date 26 June 2013

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.5705

zbMATH Keywords

Coxeter groupsupersolvable latticessemimodular latticesCohen-Macaulay posetBruhat ordersantichain cutsetexact transversallocally shellable latticesstrongly connected \(d\)-uniform hypergraphsstrongly connected poset

Mathematics Subject Classification ID

Hypergraphs (05C65) Algebraic aspects of posets (06A11) Semimodular lattices, geometric lattices (06C10)

Abstract: Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we get such a characterization for semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected hypergraphs having finite edges.

Recommendations

• Antichain cutsets
• scientific article; zbMATH DE number 4023345
• Finite antichain cutsets in posets
• The lattice of antichain cutsets of a partially ordered set
• scientific article; zbMATH DE number 1153451

Cites work

• scientific article; zbMATH DE number 3957179 (Why is no real title available?)
• scientific article; zbMATH DE number 4023345 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1313604 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 863503 (Why is no real title available?)
• Antichain cutsets
• Antichains and Finite Sets that Meet all Maximal Chains
• Chessboard Complexes and Matching Complexes
• Combinatorics and commutative algebra.
• Combinatorics of Coxeter Groups
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Finite antichain cutsets in posets
• Finite lattices and Jordan-Hölder sets
• Poset edge-labellings and left modularity
• Poset topology: tools and applications
• Shellability of semigroup rings
• Shellable Nonpure Complexes and Posets. I
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
• Supersolvable lattices
• The fundamental group of balanced simplicial complexes and posets
• The lattice of antichain cutsets of a partially ordered set

Cited in

(6)

• scientific article; zbMATH DE number 4023345 (Why is no real title available?)
• Cutsets and anti-chains in linear lattices
• On blockers in bounded posets
• Chain blockers and convoluted Catalan numbers
• Posets in which every cutset meets every fibre
• scientific article; zbMATH DE number 733226 (Why is no real title available?)

This page was built for publication: Antichain cutsets of strongly connected posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376903)