PreprintCC BY 4.0arXiv
Word Trace Formulas over Compact Groups and Connected Cumulants
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
- Wehrl-type entropy problem for compact connected semisimple Lie groups
- Geometric lifting and Freiman's 3k−4 theorem in compact connected abelian groups
- On the Equivalence of Stochastic Control and Path Space Formulations for Schrödinger Bridges over Compact Connected Lie Groups
- The Mathieu Property for Compact Connected Lie Groups
- Trace formulas for TBG
BibTeX
@misc{paunescu2026word,
title = {{Word Trace Formulas over Compact Groups and Connected Cumulants}},
author = {Liviu Paunescu and Florin Radulescu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.34213},
eprint = {2610.34213},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.34213},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Word Trace Formulas over Compact Groups and Connected Cumulants
AU - Liviu Paunescu
AU - Florin Radulescu
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2610.34213
UR - https://arxiv.org/abs/2610.34213
AB - 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.
ER -