“…Let n P N be given andS ≔ Ppnq, the set of all partitions of n. Thus if n " 4,S " t4, 31, 22, 211, 1111u. An absorbing Markov chain onS, modeled on a rock breaking Markov chain studied by Kolmogorov, is developed in Diaconis, Pang and Ram [9]. Briefly, if λ " pλ 1 , λ 2 , ..., λ l q, with λ 1 ě λ 2 쨨¨ě λ l ą 0, λ 1`¨¨¨`λl " n, the chain proceeds from λ by independently choosing, for i P 1, l , binomial variables λ p1q i of parameters pλ i , 1{2q, so that we can write λ i ≕ λ p1q i`λ p2q i .…”