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.
Maximizing the number of edges in three-dimensional colored triangulations whose building blocks are balls
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math-ph 1years
2026 1verdicts
UNVERDICTED 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.