Related papers: Singularity of sparse Bernoulli matrices
We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the…
We prove that the reverse characteristic polynomial $\det(I_n - zA_n)$ of a random $n \times n$ matrix $A_n$ with iid $\mathrm{Bernoulli}(d/n)$ entries converges in distribution towards the random infinite product $\prod_{\ell =…
We establish, under a moment matching hypothesis, the local universality of the correlation functions associated with products of $M$ independent iid random matrices, as $M$ is fixed, and the sizes of the matrices tend to infinity. This…
The Hardy--Littlewood inequalities for multilinear forms on sequence spaces state that for all positive integers $m,n\geq2$ and all $m$-linear forms $T:\ell_{p_{1}}^{n}\times\cdots\times\ell_{p_{m}}^{n}\rightarrow\mathbb{K}$…
Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…
The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset SL(n,{\bf C})$ or $c_j\subset sl(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples of…
Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…
Let $\varepsilon>0$ and, for an odd prime $p$, set $$ S_\ell(p):=\sum_{n\le \ell}\left(\frac{n}{p}\right). $$ Define the first-passage time $$ f_\varepsilon(p):=\min\{\ell\ge 1:\ S_\ell(p)<\varepsilon\ell\}. $$ We prove that there exists a…
Let $n_1 < n_2 < \cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\theta) = \sum_{j=1}^N {\cos (n_j\theta)}$ tends to $\infty$ as a…
Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…
We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 +…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
We consider the Bernoulli first-passage percolation on $\mathbb Z^d (d\ge 2)$. That is, the edge passage time is taken independently to be 1 with probability $1-p$ and 0 otherwise. Let ${\mu(p)}$ be the time constant. We prove in this paper…
We prove an algorithmic regularity lemma for $L_p$ regular matrices $(1 < p \leq \infty),$ a class of sparse $\{0,1\}$ matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who…
For a class of equations generalizing the model case \[ \Delta _p u-a(r)u^{p-1}+b(r)u^q=0 \; \; \mbox{in $B$}, \; \; u=0 \; \; \mbox{on $\partial B$}, \] where $B$ is the unit ball in $R^n$, $n \geq 1$, $r=|x|$, $p,q>1$, and $\Delta _p$…
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b,…
Given $A\subseteq\mathbb Z_n$, the constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence having consecutive terms. The value of…
Consider some matrix waiting for its coefficients to be written. For each column, sample independently a Bernoulli random variable of some parameter $p$. Seeing all this and possibly using extra randomness, Alice then chooses one spot in…
Given a closed Riemannian manifold $(N^{n+1},g)$, $n+1 \geq 3$ we prove the compactness of the space of singular, minimal hypersurfaces in $N$ whose volumes are uniformly bounded from above and the $p$-th Jacobi eigenvalue $\lambda_p$'s are…
The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…