Fractional operator powers generate non-positivity constraints that determine the SYK bilinear spectrum and converge to exact eigenvalues under truncation.
Lin,Bootstraps to strings: solving random matrix models with positivity,JHEP06 (2020) 090 [2002.08387]
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 3
citation-polarity summary
fields
hep-th 5verdicts
UNVERDICTED 5roles
background 3polarities
background 3representative citing papers
Finite-N bootstrap yields N-independent bounds for matrix models but N-dependent novel bounds on the two-point function versus quartic coupling for tensor models.
A semidefinite programming bootstrap is formulated for Euclidean two-point correlators in quantum mechanics, yielding rigorous bounds and low-lying spectrum extraction in the ungauged one-matrix model.
A finite-dimensional regularization of the master field enables direct numerical computation of large-N matrix models in both Euclidean and Minkowski signatures while reproducing known solutions in simple test cases.
Proposes complex matrix models for BPS correlators in N=4 SYM, relating eigenvalue distributions to LLM droplet shapes and enabling computations of one-point functions and three-point correlators via reductions to known models.
citing papers explorer
-
Quantum mechanical bootstrap without inequalities: SYK bilinear spectrum
Fractional operator powers generate non-positivity constraints that determine the SYK bilinear spectrum and converge to exact eigenvalues under truncation.
-
Finite-$N$ Bootstrap Constraints in Matrix and Tensor Models
Finite-N bootstrap yields N-independent bounds for matrix models but N-dependent novel bounds on the two-point function versus quartic coupling for tensor models.
-
Bootstrapping Euclidean Two-point Correlators
A semidefinite programming bootstrap is formulated for Euclidean two-point correlators in quantum mechanics, yielding rigorous bounds and low-lying spectrum extraction in the ungauged one-matrix model.
-
Regularized Master-Field Approximation for Large-$N$ Reduced Matrix Models
A finite-dimensional regularization of the master field enables direct numerical computation of large-N matrix models in both Euclidean and Minkowski signatures while reproducing known solutions in simple test cases.
-
(Un)solvable Matrix Models for BPS Correlators
Proposes complex matrix models for BPS correlators in N=4 SYM, relating eigenvalue distributions to LLM droplet shapes and enabling computations of one-point functions and three-point correlators via reductions to known models.