7 citations · 23 across the 11 of their papers we have counts for
18 papers
Will the real Hardy-Ramanujan formula please stand up?
Stephen DeSalvo
The Hardy-Ramanujan formula for the number of integer partitions of is one of the most popular results in partition theory. While the unabridged final formula has been celebrat…
Attacks and alignments: rooks, set partitions, and permutations
Richard Arratia, Stephen DeSalvo
We consider uniformly random set partitions of size with exactly blocks, and uniformly random permutations of size with exactly cycles, under the regime where $n-k…
Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer
Stephen DeSalvo
We demonstrate a novel approach for the random sampling of Latin squares of order~ via probabilistic divide-and-conquer. The algorithm divides the entries of the table modulo po…
Limit shapes via bijections
Stephen DeSalvo, Igor Pak
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach ut…
A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures
Stephen DeSalvo, Georg Menz
A useful heuristic in the understanding of large random combinatorial structures is the Arratia-Tavare principle, which describes an approximation to the joint distribution of comp…
The probability of avoiding consecutive patterns in the Mallows distribution
Harry Crane, Stephen DeSalvo, Sergi Elizalde
We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patte…