Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors
Mathematical Physics
2026-03-10 v1 High Energy Physics - Theory
Combinatorics
math.MP
Abstract
We give the first and lowest order examples of 3-regular 3-edge-colored graphs that demonstrate the non-factorization of tensor model invariants in the large N limit of Gaussian random tensors, as proven on general grounds in [Gurau R., Joos F. and Sudakov B., Lett. Math. Phys., 115 (2025), arXiv:2506.15362 [math-ph]]. This non-factorization is in stark contrast to the well-known large N factorization for random matrices.
Cite
@article{arxiv.2603.08638,
title = {Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors},
author = {Jonathan Berthold and Hannes Keppler},
journal= {arXiv preprint arXiv:2603.08638},
year = {2026}
}
Comments
10 pages, 4 figures