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
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.