Skip to content
Preprint

An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix

Aug 2026 · 0 citations · 15 references
Mathematics

Abstract

Let $M_n$ be an $n\times n$ matrix with independent uniform sign entries. We prove that there exist absolute constants $C,c>0$ such that, for all sufficiently large $n$, \[ \mathbb{P}\!\left( \left|\operatorname{Per}(M_n)\right| \ge e^{-Cn}\sqrt{n!} \right) \ge 1-n^{-c}. \] This establishes the exponential scale lower bound suggested by Tao and Vu. The proof bounds the cumulative logarithmic loss of the sum of squared permanents of minors under row exposure.

View source

Similar papers

Jul 2026

Improved RIP Bounds for Gaussian Partial Circulant Matrices

We prove an improved restricted isometry bound for Gaussian partial circulant matrices with arbitrary prescribed sampling sets. There is a universal constant $C>0$ such that the following holds. Let $1\leq K\leq m\leq N$ be positive integers, let $\Omega\subset\mathbb Z_N$ be any fixed set with $|\Omega|=m$, and let $g...

Z. Song · 0 citations
Preprint Jul 2026

On the smallest singular value of the product of random and deterministic matrices

Let $A=(a_{ij})$ be an $n\times n$ real-valued random matrix with independent, mean-zero, variance-one entries whose fourth moments are uniformly at most $K$. Suppose that there exists $\kappa \in (0, 1)$ such that the entries of $A$ satisfy $$ \max_{i,j}\sup_{u \in \mathbb{R}} \mathbb{P}(\lvert a_{ij} - u\rvert<1) \le...

B. Letwin, Achintya Raya Polavarapu · 0 citations
Preprint Jul 2026

Asymptotic Uniformity of Permanents of Random Matrices over Finite Fields of Odd Characteristic

Let $q$ be an odd prime power, and let $A_n=(a_{ij})\in\mathbb F_q^{n\times n}$ be a random matrix whose entries are independent and uniformly distributed on $\mathbb F_q$. The permanent of $A_n$ is defined by $\operatorname{per}(A_n)=\sum_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(i)}$, where $S_n$ denotes the symmetric...

Shuang Sun, Yuyao Yang, Ji Zeng · 0 citations
Preprint Aug 2026

Sharp Tail Bounds Beyond Twice the Mean

Consider $n$ independent, non-negative, mean at most one random variables, $X_1,X_2,\ldots$. We show the following bound on the probability of their sum exceeding a threshold $t$: \[ \mathbb{P}\left[\sum_{i=1}^n X_i\ge t\right] \leq 1-\left(1-\frac{1}{t}\right)^n \text{ for all } t\ge 2n+1 \,. \] To prove this, we cons...

P. Strack, Jannik M. Westermann · 1 citation
Preprint Aug 2026

A Near-Optimal Lower Bound for Prefix-Matrix Factorizations

For the $n\times n$ lower-triangular all-ones matrix $Q$, we prove a near-optimal lower bound \[ \gamma_{2,1}(Q) := \inf_{Q=AB} \|A\|_{2\to\infty}\|B\|_{1\to1} = \Omega\!\left( \frac{\log^{3/2}n}{(\log\log n)^{3/2}} \right), \] where the infimum ranges over real factorizations of arbitrary finite inner dimension. This...

Hong-Hao Lin, V. Mirrokni, David P. Woodruff · 2 citations
Preprint Aug 2026

The Average Singular Value of a Real Square Gaussian Random Matrix Strictly Increases with Dimension

We settle the real half of a conjecture of Bandeira, Kennedy and Singer on the dimension dependence of the Gaussian constant governing the little Grothendieck problem over the orthogonal group. For an $N\times N$ standard real Gaussian matrix $G_N$, the average singular value $\alpha_{\mathbb R}(N)=N^{-3/2}\,\mathbb E\...

O. Hutník · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.