arXiv · 2608.26707
An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix
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 confirms, up to the exponential scale, the lower bound suggested by Tao and Vu.
Explore related subjects
Keep this discovery
Yiming Chen. 2026-08-27. An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix. https://arxiv.org/abs/2608.26707
Cite the original work for its findings. Save a collection to share your selection of sources.