Large antichains in the partition lattice
From MaRDI portal
Publication:4322477
DOI10.1002/rsa.3240060109zbMath0813.06002MaRDI QIDQ4322477
E. Rodney Canfield, Lawrence H. Harper
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
asymptotic normality; antichain; Stirling number; Sperner property; partition lattice; rank compression
05A18: Partitions of sets
06A07: Combinatorics of partially ordered sets
05A16: Asymptotic enumeration
Related Items
The size of the largest antichain in the partition lattice, Random set partitions: Asymptotics of subset counts, Integer partitions and the Sperner property
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