Related papers: Sharp character bounds and cutoff for symmetric gr…

NAC-colourings of graphs correspond to flexible quasi-injective realisations in $\mathbb {R} ^2$. A special class of NAC-colourings are those that arise from stable cuts. We give sharp thresholds for the random graph to have no stable cut…

The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a…

In this paper I present a new and unified method of proving character formulas for discrete series representations of connected Lie groups by applying a Chern character-type construction to the matrix factorizations of [FT] and [FHT3]. In…

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 consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

If all of the entries of a large $S_n$ character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic…

We construct a natural bijection between odd-degree irreducible characters of S_n and linear characters of its Sylow 2-subgroup P_n. When n is a power of 2, we show that such a bijection is nicely induced by the restriction functor. We…

We show that a simple Markov chain, the Glauber dynamics, can efficiently sample independent sets almost uniformly at random in polynomial time for graphs in a certain class. The class is determined by boundedness of a new graph parameter…

We prove a monotonicity identity for compact surfaces with free boundaries inside the boundary of unit ball in $\mathbb R^n$ that have square integrable mean curvature. As one consequence we obtain a Li-Yau type inequality in this setting,…

We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a regular (aperiodic and irreducible) finite Markov chain. Specially, consider a random walk on a regular Markov chain and a Hermitian matrix-valued…

We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.

We compute the log canonical thresholds of non-negatively curved singular hermitian metrics on ample linearized line bundles on bi-equivariant group compactifications of complex reductive groups. To this end, we associate to any such metric…

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

Estimating numerically the spectral radius of a random walk on a nonamenable graph is complicated, since the cardinality of balls grows exponentially fast with the radius. We propose an algorithm to get a bound from below for this spectral…

We present a basic pointwise bound for the irreducible characters of $\mathrm{SU}(3)$ and, as an application, derive new $L^p$ bounds for these characters. Our approach is based on the descent of characters to singular sets and the…

The Gelfand-Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand-Tsetlin graph has at least three incarnations --- as a discrete potential theory…

We give closed product formulas for the irreducible characters of the symmetric groups related to rectangular `almost square' Young diagrams $p \times(p+\delta)$ for a fixed value of an integer $\delta$ and an arbitrary integer $p$.

We use geometric methods to obtain a sharp exponential integrability result for boundary traces of monotone Sobolev functions defined on the unit ball.

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…