Related papers: Sharp character bounds and cutoff for symmetric gr…
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…
A data sketch algorithm scans a big data set, collecting a small amount of data -- the sketch, which can be used to statistically infer properties of the big data set. Some data sketch algorithms take a fixed-size random sample of a big…
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…
We continue the study of character sheaves on a not necessarily connected reductive group. We prove orthogonality formulas for certain characteristic functions.
Given a generalized $e$-block $B$ of a symmetric group and an $e$-regular conjugacy class $C$, we study the number of irreducible characters in $B$ which do not vanish on $C$ and find lower bounds for it.
An extended Kleinian group whose orientation-preserving half is a Schottky group is called an extended Schottky group. These groups correspond to the real points in the Schottky space. Their geometric structures is well known and it permits…
We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…
We give a definition of character sheaves on the group compactification which is equivalent to Lusztig's definition in \cite{L3}. We also prove some properties of the character sheaves on the group compactification.
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
We develop general formulae for the numbers of conjugacy classes and irreducible complex characters of finite p-groups of nilpotency class less than p. This allows us to unify and generalize a number of existing enumerative results, and to…
We give a partial negative answer to a question left open in a previous work by Brasco and the first and third-named authors concerning the sharp constant in the fractional Hardy inequality on convex sets. Our approach has a geometrical…
Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…
Let $\ell$ be an odd prime, and let $K$ be a field of characteristic not $2,3,$ or $\ell$ containing a primitive $\ell$-th root of unity. For an elliptic curve $E$ over $K$, we consider the standard Galois representation $$\rho_{E,\ell}:…
We establish a new family of Carleman inequalities for wave operators on cylindrical spacetime domains containing a potential that is critically singular, diverging as an inverse square on all the boundary of the domain. These estimates are…
Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the…
The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…
We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…
We generalize the classical sharp bounds for the largest eigenvalue of the normalized Laplace operator, $\frac{N}{N-1}\leq \lambda_N\leq 2$, to the case of chemical hypergraphs.
I calculate characters of certain representations of loop groups based on non simply connected Lie groups. This gives a generalization of the Kac-Weyl character formula.
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…