Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kronecker coefficients from algebras of bi-partite ribbon graphs

Published 4 Nov 2022 in hep-th, math-ph, math.CO, and math.MP | (2211.02544v2)

Abstract: Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite ribbon graphs with $n$ edges, which is useful in the applications to matrix and tensor models. The algebra $\mathcal{K}(n)$ is closely related to symmetric group algebras and has a matrix-block decomposition related to Clebsch-Gordan multiplicities, also known as Kronecker coefficients, for symmetric group representations. Quantum mechanical models which use $\mathcal{K}(n)$ as Hilbert spaces can be used to give combinatorial algorithms for computing the Kronecker coefficients.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.