Random partitions with non negative rth differences
Rod Canfield, Sylvie Corteel, Pawel Hitczenko
Abstract
Let Pr(n) be the set of partitions of n with non negative rth differences. Let λ be a partition chosen uniformly at random among the set Pr(n). Let d(λ) be a positive rth difference chosen uniformly at random in λ. The aim of this work is to show that for every m 1, the probability that d(λ) m approaches m-1/r as n∞. To prove this result we use bijective, asymptotic/analytic, and probabilistic combinatorics.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan