Word Trace Formulas over Compact Groups and Connected Cumulants
math.GR, math.OA
Submitted: 2026-10-25
Updated: 2026-10-25
License: http://creativecommons.org/licenses/by/4.0/
The gist: We compute the expected value of the product of traces for a finite set of words within any compact subgroup of (N).
Terminology
Abstract
We compute the expected value of the product of traces for a finite set of words within any compact subgroup of (N). Furthermore, we establish a sufficient condition under which these values determine that the product of the conjugacy classes of the words contains the identity.
Related papers
- Idempotence criteria for lazy cellular automata
- From algebraic orthogonality to RAAG embedding obstructions in hierarchically hyperbolic groups
- A finitely generated Linear group without property (T) that is neither inner amenable nor properly proximal
- On the Order of Products of Coprime Elements in Finite Groups
- From almost tight p-group enumeration to 2-group domination among finite groups
- Character Nonvanishing under Coprime Actions