Berthold, J., & Keppler, H. (2026). Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors.
Chicago Style (17th ed.) CitationBerthold, Jonathan, and Hannes Keppler. Low Order Maximally Single-trace Graphs as the First Counterexamples to Large N Factorization in Random Tensors. 2026.
MLA (9th ed.) CitationBerthold, Jonathan, and Hannes Keppler. Low Order Maximally Single-trace Graphs as the First Counterexamples to Large N Factorization in Random Tensors. 2026.
Warning: These citations may not always be 100% accurate.