相关论文: Asymptotics of characters of symmetric groups rela…

The covering number of a non-linear character $\chi$ of a finite group $G$ is the least positive integer $k$ such that every irreducible character of $G$ occurs in $\chi^k$. We determine the covering numbers of irreducible characters of the…

We study the restriction to Sylow subgroups of irreducible characters of symmetric groups. In particular, we focus our attention on constituents of degree greater than 1. Our main result is a wide generalization of Theorem 3.1 of Giannelli…

In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…

We introduce an infinite family of lower triangular matrices $\Gamma^{(s)}$, where $\gamma_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of…

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

The following short note provides an alternative proof of a result of Coornaert: namely, that given a non-elementary word-hyperbolic group $G$ with a finite generating set $X$, there exist constants $\lambda,D > 1$ such that \[…

Let $\mathcal{C}(S_{g,p})$ denote the curve complex of the closed orientable surface of genus $g$ with $p$ punctures. Masur-Minksy and subsequently Bowditch showed that $\mathcal{C}(S_{g,p})$ is $\delta$-hyperbolic for some…

Let B be a block of a finite group G with defect group D. We prove that the exponent of the center of D is determined by the character table of G. In particular, we show that D is cyclic if and only if B contains a "large" family of…

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

A major problem in the study of combinatorial aspects of permutation groups is to determine the distances in the symmetric group $\Sym_n$ with respect to a generator set. One well-known such a case is when the generator set $S_n$ consists…

We give a complete list of indecomposable characters of the infinite symmetric semigroup. In comparison with the analogous list for the infinite symmetric group, one should introduce only one new parameter, which has a clear combinatorial…

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…

We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…

We consider symmetric hypothesis testing in quantum statistics, where the hypotheses are density operators on a finite-dimensional complex Hilbert space, representing states of a finite quantum system. We prove a lower bound on the…

Given a random word of size $n$ whose letters are drawn independently from an ordered alphabet of size $m$, the fluctuations of the shape of the random RSK Young tableaux are investigated, when $n$ and $m$ converge together to infinity. If…

In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…

Young's convolution inequality provides an upper bound for the convolution of functions in terms of $L^p$ norms. It is known that for certain groups, including Heisenberg groups, the optimal constant in this inequality is equal to that for…

Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithmetic progressions. The sequences constructed from this…

We prove an asymptotic formula for the mean-square average of $L$- functions associated to subgroups of characters of sufficiently large size. Our proof relies on the study of certain character sums ${\cal A}(p,d)$ recently introduced by E.…