Saturated chains of subsets and a random walk

DOI10.1016/0097-3165(88)90021-0zbMath0663.05001OpenAlexW2072444547MaRDI QIDQ1114686

Jerrold R. Griggs

Publication date: 1988

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(88)90021-0

zbMATH Keywords

random walksubsetschain partition

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Permutations, words, matrices (05A05)

Related Items

Problems on chain partitions, On the distribution of sums of residues, Partitioning the Boolean lattice into chains of large minimum size

Cites Work

• Strong versions of Sperner's theorem
• Shuffling Cards and Stopping Times
• Finite Continuous Time Markov Chains
• Random Walk and the Theory of Brownian Motion
• On a lemma of Littlewood and Offord
• On certain limit theorems of the theory of probability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item