相关论文: Bounds for Characters of the Symmetric Group: A Hy…

We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

We bound the number of standard tableaux of skew shapes via thick hook decompositions in the Naruse hook length formula. Combining this with elementary counting arguments in the Murnaghan--Nakayama rule, we establish a uniform bound on…

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

In theories with supersymmetry, we can calculate a special partition function, known as the superconformal index. In particular, for a gauge group of $\mathrm{U}(N)$ and particles belonging to the adjoint representation, there is a fast…

The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. So far, variants of this inequality have been proved mainly…

We study covering numbers of subsets of the symmetric group $S_n$ that exhibit closure under conjugation, known as \emph{normal} sets. We show that for any $\epsilon>0$, there exists $n_0$ such that if $n>n_0$ and $A$ is a normal subset of…

Free cumulants are nice and useful functionals of the shape of a Young diagram, in particular they give the asymptotics of normalized characters of symmetric groups S(n) in the limit n\to\infty. We give an explicit combinatorial formula for…

We establish upper and lower bounds on the dimension of the space spanned by the symmetric powers of the natural character of generalised symmetric groups. We adapt the methods of Savitt and Stanley from their paper `A note on the symmetric…

Formulas for the expansion of arbitrary invariant group functions in terms of the characters for the Sp(2N), SO(2N+1), and SO(2N) groups are derived using a combinatorial method. The method is similar to one used by Balantekin to expand…

In this paper, we study relationships between the normalized characters of symmetric groups and the Boolean cumulants of Young diagrams. Specifically, we show that each normalized character is a polynomial of twisted Boolean cumulants with…

We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…

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…

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

We prove sharp bounds on the virtual degrees introduced by Larsen and Shalev. This leads to improved bounds on characters of symmetric groups. We then sharpen bounds of Liebeck and Shalev concerning the Witten zeta function. Our main…

The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

In this paper we study the complex representations of reductive groups over local non-Archimedean fields. We use the building of the reductive group to give upper-bounds for the absolute value of the character of an admissible…

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…