Combinatorial aspects of Connes's embedding conjecture and asymptotic distribution of traces of products of unitaries
Florin Radulescu

TL;DR
This paper investigates the asymptotic distribution of traces of products of unitaries, showing they tend to Gaussian variables and providing combinatorial formulas for trace moments, extending previous results in the field.
Contribution
It introduces a new combinatorial approach to analyze the asymptotic distribution of traces of words in unitaries, generalizing earlier findings by Diaconis.
Findings
Traces of products of unitaries become Gaussian in the limit
Provides a combinatorial formula for trace moment integrals
Extends Diaconis's asymptotic trace distribution results
Abstract
In this paper we study the asymptotic distribution of the moments of (non-normalized) traces , where are reduced words in unitaries in the group . We prove that as these variables are distributed as normal gaussian variables , where are the number of cyclic rotations of the words leaving them invariant. This extends a previous result by Diaconis (\cite{Diac}), where this it was proved, that are asymptotically distributed as . We establish a combinatorial formula for . In our computation we reprove some results from \cite{BC}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Random Matrices and Applications · Advanced Algebra and Geometry
