English
Related papers

Related papers: Word Measures on Unitary Groups: Improved Bounds f…

200 papers

Let $G$ be a countable group and $\mu$ a probability measure on $G$. We build a new framework to compute asymptotic quantities associated with the $\mu$-random walk on $G$, using methods from harmonic analysis on groups and Banach space…

Dynamical Systems · Mathematics 2026-03-24 Benjamin Anderson-Sackaney , Tim de Laat , Ebrahim Samei , Matthew Wiersma

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Group Theory · Mathematics 2007-05-23 Alireza Abdollahi

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

Probability · Mathematics 2012-02-28 Boris L. Granovsky

Let $G$ be a compact Lie group. Let ${\mathsf{F}}_n$ be the free group of rank $n$. We describe the orbits of ${\mathsf{Aut}}(\mathsf{F}_n)$ on ${\mathsf{Hom}}(\mathsf{F}_n;G)$ when $n$ is sufficiently large. The dynamics stabilizes: orbit…

Dynamical Systems · Mathematics 2026-03-11 Serge Cantat , Christophe Dupont , Florestan Martin-Baillon

We prove two theorems in the ergodic theory of infinite permutation groups. First, generalizing a theorem of Nessonov for the infinite symmetric group, we show that every non-singular action of a non-archimedean, Roelcke precompact, Polish…

Dynamical Systems · Mathematics 2025-11-07 Todor Tsankov

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

Group Theory · Mathematics 2019-03-25 Martin W. Liebeck , Aner Shalev

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

Consider a $n \times n$ matrix from the Gaussian Unitary Ensemble (GUE). Given a finite collection of bounded disjoint real Borel sets $(\Delta_{i,n},\ 1\leq i\leq p)$, properly rescaled, and eventually included in any neighbourhood of the…

Probability · Mathematics 2008-11-07 P. Bianchi , M. Debbah , J. Najim

Inspired by an extension of Wiener's lemma on the relation of measures $\mu$ on the unit circle and their Fourier coefficients $\widehat{\mu}(k_n)$ along subsequences $(k_n)$ of the natural numbers by Cuny, Eisner and Farkas [CEF19,…

Functional Analysis · Mathematics 2020-05-12 Eike Schulte

Bj\"orner and Ekedahl [Ann. of Math. (2), 170.2(2009), pp. 799--817] pioneered the study of length-counting sequences associated with parabolic lower Bruhat intervals in crystallographic Coxeter groups. In this paper, we study the…

Combinatorics · Mathematics 2025-08-05 Gaston Burrull , Tao Gui , Hongsheng Hu

In 1954 B. H. Neumann discovered that if G is a group in which all conjugacy classes are finite with bounded size, then the derived group G' is finite. Later (in 1957) Wiegold found an explicit bound for the order of G'. We study groups in…

Group Theory · Mathematics 2018-02-16 Glaucia Dierings , Pavel Shumyatsky

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…

Group Theory · Mathematics 2015-03-26 P. Shumyatsky , A. Tortora , M. Tota

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

Combinatorics · Mathematics 2022-09-22 Colin McDiarmid

We establish an operator-theoretic uncertainty principle over arbitrary compact groups, generalizing several previous results. As a consequence, we show that if f is in L^2(G), then the product of the measures of the supports of f and its…

Representation Theory · Mathematics 2016-10-18 Gorjan Alagic , Alexander Russell

Let N be a normal subgroup of a finite group G. We prove that under certain (unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y] (with prescribed values of y from a given set Y) of length bounded by a function of…

Group Theory · Mathematics 2021-03-31 Nikolay Nikolov , Dan Segal

On unitary compact groups the decomposition of a generic element into product of reflections induces a decomposition of the characteristic polynomial into a product of factors. When the group is equipped with the Haar probability measure,…

Probability · Mathematics 2010-03-25 Paul Bourgade , Ashkan Nikeghbali , Alain Rouault

Let $H$ be the space of all Hermitian matrices of infinite order and $U(\infty)$ be the inductive limit of the chain $U(1)\subset U(2)\subset...$ of compact unitary groups. The group $U(\infty)$ operates on the space $H$ by conjugations,…

Representation Theory · Mathematics 2016-09-06 Grigori Olshanski , Anatoli Vershik

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Group Theory · Mathematics 2012-12-05 Cristina Acciarri , Pavel Shumyatsky

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…

Group Theory · Mathematics 2024-02-26 Pavel Shumyatsky

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

Probability · Mathematics 2014-10-30 Camille Male , Sandrine Péché