Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors

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. The existence of such graphs has recently been proven on general grounds, but without providing explicit examples. Moreover, it was expected that such examples require graphs with a very large number of vertices. We show that the smallest such graphs have 16 vertices. The non-factorization for Gaussian random tensors is in stark contrast to the well-known large $N$ factorization for random matrices.

11 pages, 6 figures