Stable Invariants of Words from Random Matrices II: Formulas and Extensions

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Puder, Doron, Shomroni, Yotam
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909859980509184
author Puder, Doron
Shomroni, Yotam
author_facet Puder, Doron
Shomroni, Yotam
contents Let $w$ be a word in a free group. As was revealed by Magee and Puder in [arXiv:1802.04862], the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain stable Fourier coefficients of $w$-random unitary matrices. In the first part of the current work [arXiv:2311.17733], we demonstrated how this phenomenon is much broader: we proved more instances of such results and conjectured others. These new results and conjectures involved other topological invariants (relatives of scl) and different families of groups. In the current paper we further extend and support this theory. We provide another instance of the theory and prove that the stable primitivity rank, too, can be expressed in terms of stable Fourier coefficients of $w$-random elements of groups. We introduce concrete formulas for stable Fourier coefficients of $w$-random elements in the symmetric group $S_N$ and its generalizations in the form of the wreath products $G\wr S_N$ where $G$ is an arbitrary compact group. We also define new stable invariants related to these groups, and prove they give bounds to many of the stable Fourier coefficients. As an aside, we generalize to tuples of words a result of Puder and Parzanchevski [arXiv:1202.3269] about the expected number of fixed points of $w$-random permutations.
format Preprint
id arxiv_https___arxiv_org_abs_2509_17271
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Stable Invariants of Words from Random Matrices II: Formulas and Extensions
Puder, Doron
Shomroni, Yotam
Group Theory
Combinatorics
Representation Theory
60B15, 60B20, 20c15 (Primary) 05E10, 20b30, 20c30, 20P05, 22c05, 20e05, 20e22, 28c10, 57m07, 20f65
Let $w$ be a word in a free group. As was revealed by Magee and Puder in [arXiv:1802.04862], the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain stable Fourier coefficients of $w$-random unitary matrices. In the first part of the current work [arXiv:2311.17733], we demonstrated how this phenomenon is much broader: we proved more instances of such results and conjectured others. These new results and conjectures involved other topological invariants (relatives of scl) and different families of groups. In the current paper we further extend and support this theory. We provide another instance of the theory and prove that the stable primitivity rank, too, can be expressed in terms of stable Fourier coefficients of $w$-random elements of groups. We introduce concrete formulas for stable Fourier coefficients of $w$-random elements in the symmetric group $S_N$ and its generalizations in the form of the wreath products $G\wr S_N$ where $G$ is an arbitrary compact group. We also define new stable invariants related to these groups, and prove they give bounds to many of the stable Fourier coefficients. As an aside, we generalize to tuples of words a result of Puder and Parzanchevski [arXiv:1202.3269] about the expected number of fixed points of $w$-random permutations.
title Stable Invariants of Words from Random Matrices II: Formulas and Extensions
topic Group Theory
Combinatorics
Representation Theory
60B15, 60B20, 20c15 (Primary) 05E10, 20b30, 20c30, 20P05, 22c05, 20e05, 20e22, 28c10, 57m07, 20f65
url https://arxiv.org/abs/2509.17271