English
Related papers

Related papers: Maximum of the characteristic polynomial for a ran…

200 papers

We present a rapid method for the exact calculation of the cumulative distribution function of the maximum of multinomially distributed random variables. The method runs in time $O(mn)$, where $m$ is the desired maximum and $n$ is the…

Statistics Theory · Mathematics 2009-11-11 Warren J. Ewens , Herbert S. Wilf

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Probability · Mathematics 2012-03-14 Charles Bordenave , Djalil Chafai

An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…

Numerical Analysis · Computer Science 2016-05-03 Bahman Kalantari

In this note, we explicitly compute the probability that a given cell in a random standard Young tableau of the shifted staircase shape $(2n-1, 2n-3, \ldots, 3,1)$ contains the maximal label. We also show that the asymptotic distribution of…

Combinatorics · Mathematics 2025-11-17 Chihiro Kubota , Taizo Sadahiro , Yoshika Ueda

In this paper we consider the density of maximal order elements in $\mathrm{GL}_n(q)$. Fixing any of the rank $n$ of the group, the characteristic $p$ or the degree $r$ of the extension of the underlying field $\mathbb{F}_q$ of size…

Number Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Efthymios Sofos

Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristic polynomial. Conditionally on the extended…

Number Theory · Mathematics 2022-03-16 Sean Eberhard

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

Probability · Mathematics 2008-03-13 Remco van der Hofstad , Wouter Kager

We determine to leading order the maximum of the characteristic polynomial for Wigner matrices and $\beta$-ensembles. In the special case of Gaussian-divisible Wigner matrices, our method provides universality of the maximum up to…

Probability · Mathematics 2024-08-13 Paul Bourgade , Patrick Lopatto , Ofer Zeitouni

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

Combinatorics · Mathematics 2007-05-23 Jinho Baik , Percy Deift , Kurt Johansson

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

A natural problem in the context of the coupon collector's problem is the behavior of the maximum of independent geometrically distributed random variables (with distinct parameters). This question has been addressed by Brennan et al.…

Probability · Mathematics 2020-05-08 Dina Barak-Pelleg , Daniel Berend , Grigori Kolesnik

The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied…

Probability · Mathematics 2024-10-16 Theodoros Assiotis , Mustafa Alper Gunes , Jonathan P. Keating , Fei Wei

We derive a tight upper bound on the probability over $\mathbf{x}=(x_1,\dots,x_\mu) \in \mathbb{Z}^\mu$ uniformly distributed in $ [0,m)^\mu$ that $f(\mathbf{x}) = 0 \bmod N$ for any $\mu$-linear polynomial $f \in…

Discrete Mathematics · Computer Science 2022-05-06 Benedikt Bünz , Ben Fisch

In this paper, we are interested in the asymptotic properties for the largest eigenvalue of the Hermitian random matrix ensemble, called the Generalized Cauchy ensemble $GCy$, whose eigenvalues PDF is given by…

Probability · Mathematics 2015-05-13 Joseph Najnudel , Ashkan Nikeghbali , Felix Rubin

We study the characteristic polynomial $p_{n}(x)=\prod_{j=1}^{n}(|z_{j}|-x)$ where the $z_{j}$ are drawn from the Mittag-Leffler ensemble, i.e. a two-dimensional determinantal point process which generalizes the Ginibre point process. We…

Mathematical Physics · Physics 2022-05-24 Sung-Soo Byun , Christophe Charlier

Denote by $u(n)$ the largest principal specialization of the Schubert polynomial: $ u(n) := \max_{w \in S_n} \mathfrak{S}_w(1,\ldots,1) $ Stanley conjectured in [arXiv:1704.00851] that there is a limit $\lim_{n\to \infty} \, \frac{1}{n^2}…

Combinatorics · Mathematics 2018-05-14 Alejandro H. Morales , Igor Pak , Greta Panova

We prove a version of Nagaev's theorem for the branching random walk with heavy-tailed associated random walk. For a branching random walk on $\mathbb{R}$ we consider the random measure $Z_n = \sum_{|u|=n} e^{-V_u} \delta_{V_u}$ where…

Probability · Mathematics 2026-03-18 Jakob Stonner

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

Let $\nu$ be a probability distribution over the semi-group of square matrices of size $d \ge 2$ over a locally compact field $\mathbb{K}$, \textit{e.g.} $\mathbb{R}$. We consider the random walk $\overline{\gamma}_n :=…

Probability · Mathematics 2026-05-19 Axel Péneau

Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…

Combinatorics · Mathematics 2026-01-06 Nathan Tung