Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34213

Word Trace Formulas over Compact Groups and Connected Cumulants

Liviu Paunescu·Florin Radulescu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We compute the expected value of the product of traces for a finite set of words within any compact subgroup of $\mathcal(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.

Explore related subjects

math.GRmath.OA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liviu Paunescu, Florin Radulescu. 2026-10-25. Word Trace Formulas over Compact Groups and Connected Cumulants. https://arxiv.org/abs/2610.34213

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Ramanujan-Petersson and Selberg conjectures for Maass forms

We prove the Ramanujan-Petersson conjecture for Maass forms of the group $SL(2,Z)$, with the help of automorphic distribution theory and pseudodifferential analysis. The first notion is an alternative to classical automorphic function theory, in which the plane takes the place usually ascribed to the hyperbolic half-plane. The Selberg conjecture for Hecke's group $Γ_0(M)$ follows as well.

math.GR↗
arXiv2026

A characterization of the reversibility of linear cellular automata

Let $G$ be a group, let $\mathbb{K}$ be a field, and let $V$ be a $\mathbb{K}$-vector space. We prove that there exists a bijective linear cellular automaton $V^G\to V^G$ whose inverse is not a cellular automaton if and only if $G$ is not locally finite and $\dim_{\mathbb{K}}V \geq |\mathbb{K}|^{\aleph_0}$. In particular, $|\mathbb{K}|^{\aleph_0}$ is the exact dimension threshold for non-reversibility. This answers an open problem proposed by T. Ceccherini-Silberstein and M. Coornaert.

math.GR↗