Related papers: Chio Condensation and Random Sign Matrices

Given a complex polynomial $P$ with zeroes $z_1,\dotsc,z_d$, we show that the asymptotic zero-counting measure of the iterated derivatives $Q^{(n)}, \ n=1,2,\dotsc$, where $Q=R/P$ is any irreducible rational function, converges to an…

We extend Hochman's work on exponentially separated self-similar measures on $\mathbb{R}$ to the real analytic setting. More precisely, let $\Phi=\left\{ \varphi_{i}\right\} _{i\in\Lambda}$ be an iterated function system on $I:=[0,1]$…

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

We study the probability that the origin is connected to the boundary of the box of size $n$ (the one-arm probability) in several percolation models related to the Ising model. We prove that different universality classes emerge at…

We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph $G(n,p)$ on $n$ vertices in which each edge appears independently with probability $p=p(n)$. For dense random graphs ($np \to \infty$ as $n…

Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common bases of two matrices. Generalizing these two examples,…

Let $\Gamma$ be a Zariski dense discrete subgroup of a connected simple real algebraic group $G_1$. We discuss a rigidity problem for discrete faithful representations $\rho:\Gamma\to G_2$ and a surprising role played by higher rank…

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…

We consider two independent and stationary measures over $\chi^\mathbb{N}$, where $\chi$ finite or countable alphabet. For each pair of $n$-strings in the product space we define $T_n^{(2)}$ as the length of the shortest path connecting one…

For a fixed graph property $\Phi$ and integer $k \geq 1$, consider the problem of counting the induced $k$-vertex subgraphs satisfying $\Phi$ in an input graph $G$. This problem can be solved by brute-force in time $O(n^{k})$. Under ETH, we…

Precedence constraints are inequalities used to model time dependencies. In 1958, Gallai proved that a finite system of precedence constraints admits solutions if and only if the corresponding precedence graph does not contain…

For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

Let M be a noncompact metric space in which every closed ball is compact, and let G be a semigroup of Lipschitz mappings of M. Denote by (Y_n)_{n\geq1} a sequence of independent G-valued, identically distributed random variables (r.v.'s),…

A main theme of the paper is a conjecture of Bloch-Kato on the image of $p$-adic regulator maps for a proper smooth variety $X$ over an algebraic number field $k$. The conjecture for a regulator map of particular degree and weight is…

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

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…

In 2013, Gau and Wu introduced a unitary invariant, denoted by $k(A)$, of an $n\times n$ matrix $A$, which counts the maximal number of orthonormal vectors $\textbf x_j$ such that the scalar products $\langle A\textbf x_j,\textbf…