

Computational Complexity in Column Sums of Symmetric Group Character Tables and Counting of Surfaces
De Joseph Ben Geloun


One Bit (per Ring) to Rule Them All - Imperfect Randomness Harms Lattice Signatures (work in progress)
De Alexander May
Apparaît dans la collection : Mikefest : A conference in honor of Michael Douglas’ 60th birthday
I will speak about my recent work with Zechuan Zheng where we study the SU(Nc) lattice Yang-Mills theory in the ’t Hooft limit Nc → infinity, at dimensions D=2,3,4, via the numerical bootstrap method. It combines the Makeenko-Migdal loop equations, with the cut-off L on maximal length of Wilson loops, and the positivity conditions on certain correlation matrices. We thus obtain rigorous upper and lower bounds on the plaquette average at various couplings. The results are quickly improving with the increase of the cutoff L. In particular, for D=4 and L=16, the upper bound data in the most interesting weak-coupling phase are not far from the Monte-Carlo results and they reproduce well the 3-loop perturbation theory. We also attempt to extract the information about the gluon condensate from this data. Our results suggest that bootstrap can provide a tangible alternative to, so far uncontested, the Monte Carlo approach. I will also mention our bootstrap results for an "unsolvable" two-matrix model in the large N limit, where this method appears to be superior in efficiency over Monte Carlo.