The morphology of partially ordered sets

DOI10.1016/0097-3165(74)90027-2zbMath0297.05003OpenAlexW2072578197MaRDI QIDQ1213863

Lawrence H. Harper

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90027-2

Mathematics Subject Classification ID

Partial orders, general (06A06) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05)

Related Items (37)

Dilworth Numbers, Incidence Maps and Product Partial Orders ⋮ Shelling the \(m=1\) amplituhedron ⋮ Applications of the symmetric chain decomposition of the lattice of divisors ⋮ Integer partitions and the Sperner property ⋮ Gibbs distributions for random partitions generated by a fragmentation process ⋮ Optimal representations of partially ordered sets and a limit Sperner theorem ⋮ The normalized matching property from the generalized Macaulay theorem ⋮ On ideals with the Rees property ⋮ Maximum antichains of rectangular arrays ⋮ On the Sperner property for the absolute order on complex reflection groups ⋮ A Sperner theorem for the interval order of a projective geometry ⋮ Product partial orders with the Sperner property ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ Morphisms for resistive electrical networks ⋮ The global theory of flows in networks ⋮ Collections of Subsets with the Sperner Property ⋮ A solution of the Sperner-Erdős problem ⋮ Efficient \(q\)-ary immutable codes ⋮ \(q\)-weighted log-concavity and \(q\)-product theorem on the normality of posets ⋮ Poset Measure and Saturated Partitions ⋮ Anzahl theorems in geometry oft-singular classical groups and their applications ⋮ Maximum antichains in the product of chains ⋮ Symmetrische Zerlegung von Kettenprodukten ⋮ Negative correlation and log-concavity ⋮ On a problem of Rota ⋮ Maximum antichains in the partition lattice ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets ⋮ A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota ⋮ A natural notion of morphism for linear programming problems ⋮ The symmetric group, ordered by refinement of cycles, is strongly Sperner ⋮ A counterexample to the generalisation of Sperner's theorem ⋮ The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner ⋮ Some remarks on normalized matching ⋮ Strong properties in partially ordered sets. II ⋮ Morphisms for the strong Sperner property of Stanley and Griggs ⋮ Partitioning the Boolean lattice into chains of large minimum size ⋮ Counting common representatives and symmetric chain decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersolvable lattices
• A counterexample to the generalisation of Sperner's theorem
• On Representatives of Subsets
• A short proof of Sperner's lemma
• An application of a theorem of de Bruijn Tengbergen, and Kruyswijk
• A generalization of Sperner's lemma
• Systems of representatives

This page was built for publication: The morphology of partially ordered sets