Large antichains in the partition lattice

DOI10.1002/rsa.3240060109zbMath0813.06002OpenAlexW2025255629MaRDI QIDQ4322477

Lawrence H. Harper, E. Rodney Canfield

Publication date: 9 February 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060109

zbMATH Keywords

asymptotic normalityantichainStirling numberSperner propertypartition latticerank compression

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Asymptotic enumeration (05A16)

Related Items

Integer partitions and the Sperner property ⋮ Random set partitions: Asymptotics of subset counts ⋮ Morphisms for resistive electrical networks ⋮ The restricted partition lattices ⋮ The size of the largest antichain in the partition lattice ⋮ The symmetric group, ordered by refinement of cycles, is strongly Sperner

Cites Work

• On a continuous analog of Sperner's problem
• Optimal representations of partially ordered sets and a limit Sperner theorem
• A simple counterexample to a conjecture of Rota
• On a problem of Rota
• A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
• On the widths of finite distributive lattices
• Central and local limit theorems applied to asymptotic enumeration
• A Generalisation of Stirling's Formula.
• Superantichains in the Lattice of Partitions of a Set
• Stirling Behavior is Asymptotically Normal
• Unnamed Item
• Unnamed Item
• Unnamed Item