Random partitions with non negative rth differences
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.