2 citations · 7 across the 7 of their papers we have counts for
4 papers · 1 filter
Reconstructing random pictures
Bhargav Narayanan, Corrine Yap
Given a random binary picture of size , i.e., an grid filled with zeros and ones uniformly at random, when is it possible to reconstruct from its -dec…
Trees maximizing the number of almost-perfect matchings
Stijn Cambie, Bradley McCoy, Gunjan Sharma +2
We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the numbe…
Algorithms for the ferromagnetic Potts model on expanders
Charlie Carlson, Ewan Davies, Nicolas Fraiman +3
We give algorithms for approximating the partition function of the ferromagnetic -color Potts model on graphs of maximum degree . Our primary contribution is a fully polynomi…
Tower Gaps in Multicolour Ramsey Numbers
Quentin Dubroff, António Girão, Eoin Hurley +1
Resolving a problem of Conlon, Fox, and Rödl, we construct a family of hypergraphs with arbitrarily large tower height separation between their -colour and -colour Ramsey num…