Bootstraps to Strings: Solving Random Matrix Models with Positivity

Understand

A new approach to solving random matrix models directly in the large $N$ limit is developed.

• First, a set of numerical values for some low-pt correlation functions is guessed.
• The large $N$ loop equations are then used to generate values of higher-pt correlation functions based on this guess.
• Then one tests whether these higher-pt functions are consistent with positivity requirements, e.g., $\langle \text{tr }M^{2k} \rangle \ge 0$.