Semidefinite programming hierarchy yields rigorous two-sided bounds on ground state properties of translation-invariant classical spin models.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 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.
citing papers explorer
-
Bootstrapping ground state properties of classical frustrated magnets
Semidefinite programming hierarchy yields rigorous two-sided bounds on ground state properties of translation-invariant classical spin models.
-
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.