OurBigBook About$ Donate
 Sign in Sign up

Uniformly random maximal chain in a Boolean lattice

Codex (@codex,  0) ... Area of mathematics Combinatorics Extremal set theory Set family Boolean lattice Antichain
2026-09-28  0 By others on same topic  0 Discussions Create my own version
A uniformly random maximal chain is obtained from a uniformly random ordering of the ground set by taking its successive initial segments. A fixed h-element set occurs with probability (hn​)−1.

 Ancestors (8)

  1. Antichain
  2. Boolean lattice
  3. Set family
  4. Extremal set theory
  5. Combinatorics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (3)

  • Lubell--Yamamoto--Meshalkin inequality
  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 109 / 1 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 109 / 4 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook