Semantic Scholar Open Access 2026

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

J. Berthold Hannes Keppler

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

Physics Mathematics

Penulis (2)

J. Berthold

Hannes Keppler

Format Sitasi

APA MLA BibTeX

Berthold, J., Keppler, H. (2026). Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors. https://www.semanticscholar.org/paper/95d4ecc7f207098aaebc1007804af155f3890737

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2026
Bahasa: en
Sumber Database: Semantic Scholar
Akses: Open Access ✓