Related papers: Random characters under the $L$-measure, I : Diric…

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…

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

We establish a central limit theorem for the central values of Dirichlet $L$-functions with respect to a weighted measure on the set of primitive characters modulo $q$ as $q \rightarrow \infty$. Under the Generalized Riemann Hypothesis…

We show that the symplectic and orthogonal character analogues of Okounkov's Schur measure (on integer partitions) are determinantal, with explicit correlation kernels. We apply this to prove certain Borodin-Okounkov-Gessel-type results…

We apply the general theory of Cauchy biorthogonal polynomials developed previously by the authors, to the case associated with Laguerre measures. In particular, we obtain explicit formulae in terms of Meijer-G functions for all key objects…

We study a two-dimensional family of probability measures on infinite Gelfand-Tsetlin schemes induced by a distinguished family of extreme characters of the infinite-dimensional unitary group. These measures are unitary group analogs of the…

Suppose $E$ is an elliptic curve over $\mathbb{Q}$ and $\chi$ is a Dirichlet character. We use statistical properties of modular symbols to estimate heuristically the probability that $L(E,\chi,1) = 0$. Via the Birch and Swinnerton-Dyer…

We calculate murmuration densities for two families of Dirichlet characters. The first family contains complex Dirichlet characters normalized by their Gauss sums. Integrating the first density over a geometric interval yields a murmuration…

We investigate averages of long Dirichlet polynomials twisted by Kronecker symbols and we compare our result with the recipe of [CFKRS]. We are able to compute these averages in the case that the length of the polynomial is a power less…

The Mahler measure of a polynomial $P$ in $n$ variables is defined as the mean of $\log|P|$ over the $n$-dimensional torus. For certain polynomials with integer coefficients in two variables the Mahler measure is known to be related to…

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…

Some general connections between martingales and character ratios of finite groups are developed. As an application we sharpen the convergence rate in a central limit theorem for the character ratio of a random representation of the…

The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…

Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…

In this paper, we consider a deformation of Plancherel measure linked to Jack polynomials. Our main result is the description of the first and second-order asymptotics of the bulk of a random Young diagram under this distribution, which…

We show that Kerov's central limit theorem related to the fluctuations of Young diagrams under the Plancherel measure extends to the case of Schur-Weyl measures, which are the probability measures on partitions associated to the…

We explicitly evaluate a special type of multiple Dirichlet $L$-values at positive integers in two different ways: One approach involves using symmetric functions, while the other involves using a generating function of the values. Equating…

We consider a random variable $Y$ and approximations $Y\_n$, defined on the same probability space with values in the same measurable space as $Y$. We are interested in situations where the approximations $Y\_n$ allow to define a Dirichlet…

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…

We provide a new characterization of the Dirichlet distribution. This characterization implies that under assumptions made by several previous authors for learning belief networks, a Dirichlet prior on the parameters is inevitable.