92 citations · 395 across the 40 of their papers we have counts for
6 papers · 1 filter
Maximum entropy and integer partitions
Gweneth McKinley, Marcus Michelen, Will Perkins
We derive asymptotic formulas for the number of integer partitions with given sums of th powers of the parts for belonging to a finite, non-empty set .…
Analyticity for classical gasses via recursion
Marcus Michelen, Will Perkins
We give a new criterion for a classical gas with a repulsive pair potential to exhibit uniqueness of the infinite volume Gibbs measure and analyticity of the pressure. Our improvem…
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Tyler Helmuth, Matthew Jenssen, Will Perkins
For and large as a function of , we give a detailed picture of the phase transition of the random cluster model on random -regular graphs. In particular, we dete…
A proof of the Upper Matching Conjecture for large graphs
Ewan Davies, Matthew Jenssen, Will Perkins
We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markström and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enoug…
Correlation decay for hard spheres via Markov chains
Tyler Helmuth, Will Perkins, Samantha Petti
We improve upon all known lower bounds on the critical fugacity and critical density of the hard sphere model in dimensions two and higher. As the dimension tends to infinity our i…
On the Number of Independent Sets in Uniform, Regular, Linear Hypergraphs
Emma Cohen, Will Perkins, Michail Sarantis +1
We study the problems of bounding the number weak and strong independent sets in -uniform, -regular, -vertex linear hypergraphs with no cross-edges. In the case of weak in…