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.
Regular colored graphs of positive degree
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of regular colored graphs of fixed positive degree and perform their exact and asymptotic enumeration. In particular we show that the generating function of the family of graphs of fixed degree is an algebraic series with a positive radius of convergence, independant of the degree. We describe the singular behavior of this series near its dominant singularity, and use the results to establish the double scaling limit of colored tensor models.
fields
hep-th 2verdicts
UNVERDICTED 2representative citing papers
Lecture notes introducing the 1/N expansion and melonic limit of tensor models, which yield new conformal field theories.
citing papers explorer
-
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.
-
Notes on Tensor Models and Tensor Field Theories
Lecture notes introducing the 1/N expansion and melonic limit of tensor models, which yield new conformal field theories.