English
Related papers

Related papers: The corank of a rectangular random integer matrix

200 papers

We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an…

Number Theory · Mathematics 2022-12-06 Rodrigo Angelo , Max Wenqiang Xu

For suitable classes of random Verblunsky coefficients, including independent, identically distributed, rotationally invariant ones, we prove that if \[ \mathbb{E} \biggl(\int\frac{d\theta}{2\pi} \biggl|\biggl(\frac{\mathcal{C} +…

Spectral Theory · Mathematics 2007-05-23 Barry Simon

We address the detection of a low rank $n\times n$deterministic matrix $\mathbf{X}_{0}$ from the noisy observation ${\bf X}_{0}+{\bf Z}$ when $n\to\infty$, where ${\bf Z}$ is a complex Gaussian random matrix with independent identically…

Signal Processing · Electrical Eng. & Systems 2018-08-30 Antoine Chevreuil , Philippe Loubaton

The number of ``carries'' when $n$ random integers are added forms a Markov chain [23]. We show that this Markov chain has the same transition matrix as the descent process when a deck of $n$ cards is repeatedly riffle shuffled. This gives…

Combinatorics · Mathematics 2008-06-24 Persi Diaconis , Jason Fulman

Let $\mathbf{A}$ be an $n\times n$-matrix over $\mathbb{F}_2$ whose every entry equals $1$ with probability $d/n$ independently for a fixed $d>0$. Draw a vector $\mathbf{y}$ randomly from the column space of $\mathbf{A}$. It is a simple…

Combinatorics · Mathematics 2023-09-08 Amin Coja-Oghlan , Oliver Cooley , Mihyun Kang , Joon Lee , Jean Bernoulli Ravelomanana

The Strong Exponential Time Hypothesis and the OV-conjecture are two popular hardness assumptions used to prove a plethora of lower bounds, especially in the realm of polynomial-time algorithms. The OV-conjecture in moderate dimension…

Computational Complexity · Computer Science 2018-05-23 Amir Abboud , Karl Bringmann , Holger Dell , Jesper Nederlof

We study a natural random walk on the $n \times n$ upper triangular matrices, with entries in $\mathbb{Z}/m \mathbb{Z}$, generated by steps which add or subtract a uniformly random row to the row above. We show that the mixing time of this…

Probability · Mathematics 2025-02-03 Evita Nestoridi , Allan Sly

We establish the following two main results on order types of points in general position in the plane (realizable simple planar order types, realizable uniform acyclic oriented matroids of rank $3$): (a) The number of extreme points in an…

Computational Geometry · Computer Science 2022-06-09 Xavier Goaoc , Emo Welzl

We prove the conjecture about the probability that Pn of Bernulli +- 1 square matrix to be singular and asymptotic expansion of Pn.

Probability · Mathematics 2025-10-28 Vladimir Blinovsky

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

Probability · Mathematics 2012-03-27 Charles Bordenave , Pietro Caputo , Djalil Chafai

We consider an urn model with multiple drawing and random time-dependent addition matrix. The model is very general with respect to previous literature: the number of sampled balls at each time-step is random, the addition matrix has…

Probability · Mathematics 2021-07-06 Irene Crimaldi , Pierre-Yves Louis , Ida Germana Minelli

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…

Combinatorics · Mathematics 2012-09-11 Jim Conant , Tim Michaels

We give a short proof that the largest component of the random graph $G(n, 1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.

Probability · Mathematics 2011-11-10 Asaf Nachmias , Yuval Peres

Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with…

We study the limiting behavior of $\Tr U^{k(n)}$, where $U$ is a $n\times n$ random unitary matrix and $k(n)$ is a natural number that may vary with $n$ in an arbitrary way. Our analysis is based on the connection with Toeplitz…

Mathematical Physics · Physics 2007-05-23 Maurice Duits , Kurt Johansson

We consider random polynomials $p_n(x)=\xi_0+\xi_1+\dots+\xi_n x^n$ whose coefficients are independent and identically distributed with zero mean, unit variance, and bounded $(2+\epsilon)^{th}$ moment (for some $\epsilon>0$), also known as…

Probability · Mathematics 2024-03-27 Yen Q. Do

Let $A \in \mathbb{R}^{N \times n}$ ($N \geq n$) be a random matrix with with independent entries that have mean 0 variance 1 and bounded $2+\beta$ moment. We show that the smallest singular value $\sigma_n(A)$ satisfies \[ \Pr…

Probability · Mathematics 2025-07-28 Max Dabagia , Manuel Fernandez

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

Probability · Mathematics 2022-09-29 Johannes Alt , Laszlo Erdos , Torben Krüger