Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.
Low order maximally single-trace graphs as the first counterexam- ples to large N factorization in random tensors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
extension 1
citation-polarity summary
fields
math-ph 1years
2026 1verdicts
UNVERDICTED 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
Large $N$ factorization of families of tensor trace-invariants
Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.