English
Related papers

Related papers: Exponential anticoncentration of the permanent

200 papers

We study the non-autonomous version of an infinite-dimensional port-Hamiltonian system on an interval $[a, b]$. Employing abstract results on evolution families, we show $C^1$-well-posedness of the corresponding Cauchy problem, and thereby…

Functional Analysis · Mathematics 2019-07-18 Björn Augner , Hafida Laasri

Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…

Combinatorics · Mathematics 2009-05-05 Jean Bourgain , Van Vu , Philip Matchett Wood

We establish a superpolynomial lower bound on the range of the permanent function on the set of $n\times n$ matrices with $\pm1$ entries.

Combinatorics · Mathematics 2025-07-15 DeVon Ingram , Alexander Razborov

The distribution of eigenvalues of N times N random matrices in the limit N to infinity is the solution to a variational principle that determines the ground state energy of a confined fluid of classical unit charges. This fact is a…

Mathematical Physics · Physics 2009-10-31 Michael K. -H. Kiessling , Herbert Spohn

Let f be a sum of exponentials of the form exp(2 pi i N x), where the N are distinct integers. We call f an idempotent trigonometric polynomial (because the convolution of f with itself is f) or, simply, an idempotent. We show that for…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruce Anderson , J. Marshall Ash , Roger Jones , Daniel G. Rider , Bahman Saffari

We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…

Classical Analysis and ODEs · Mathematics 2020-05-12 Bero Roos

Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…

Probability · Mathematics 2015-12-07 N. J. Simm

Let $E = \cup_{j = 1}^l [a_{2j-1},a_{2j}],$ $a_1 < a_2 < ... < a_{2l},$ $l \geq 2$ and set ${\boldmath$\omega$}(\infty) =(\omega_1(\infty),...,\omega_{l-1}(\infty))$, where $\omega_j(\infty)$ is the harmonic measure of $[a_{2 j - 1}, a_{2…

Classical Analysis and ODEs · Mathematics 2010-01-05 Franz Peherstorfer

For any family of $N\times N$ random matrices $(\mathbf{A}_k)_{k\in K}$ which is invariant, in law, under unitary conjugation, we give general sufficient conditions for central limit theorems for random variables of the type…

Probability · Mathematics 2017-03-01 Florent Benaych-Georges , Guillaume Cébron , Jean Rochet

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

Number Theory · Mathematics 2015-02-06 Katherine E. Stange

We provide a polynomial lower bound on the minimum singular value of an $m\times m$ random matrix $M$ with jointly Gaussian entries, under a polynomial bound on the matrix norm and a global small-ball probability bound $$\inf_{x,y\in…

Probability · Mathematics 2021-12-03 Zipei Nie

Initial-boundary value problems for the linear Zakharov-Kuznetsov equation posed on bounded rectangles are considered. Spectral properties of a stationary operator are studied in order to show that the evolution problem posed on a bounded…

Analysis of PDEs · Mathematics 2013-05-28 Gleb G. Doronin , Nikolai A. Larkin

The theory of random matrices contains many central limit theorems. We have central limit theorems for eigenvalues statistics, for the log-determinant and log-permanent, for limiting distribution of individual eigenvalues in the bulk, and…

Probability · Mathematics 2016-05-25 Asaf Ferber , Daniel Montealegre , Van Vu

Random matrices like GUE, GOE and GSE have been studied for decades and have been shown that they possess a lot of nice properties. In 2005, a new property of independent GUE random matrices is discovered by Haagerup and Thorbj{\o}rnsen in…

Operator Algebras · Mathematics 2017-02-24 Sheng Yin

Let $A$ be an $n \times n$ matrix, $X$ be an $n \times p$ matrix and $Y = AX$. A challenging and important problem in data analysis, motivated by dictionary learning and other practical problems, is to recover both $A$ and $X$, given $Y$.…

Probability · Mathematics 2015-04-02 Kyle Luh , Van Vu

We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $\varepsilon$-free independence, a mixture of classical and free independence studied by M{\l}otkowski and by Speicher and…

Operator Algebras · Mathematics 2021-03-24 Ian Charlesworth , Benoît Collins

We show that a perturbation of any fixed square matrix D by a random unitary matrix is well invertible with high probability. A similar result holds for perturbations by random orthogonal matrices; the only notable exception is when D is…

Probability · Mathematics 2014-03-05 Mark Rudelson , Roman Vershynin

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

Geometric Topology · Mathematics 2025-04-30 Michael Magee , Doron Puder , Ramon van Handel

Voiculescu's notion of asymptotic free independence applies to a wide range of random matrices, including those that are independent and unitarily invariant. In this work, we generalize this notion by considering random matrices with a…

Operator Algebras · Mathematics 2025-04-03 Ion Nechita , Sang-Jun Park

The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…

Computational Complexity · Computer Science 2018-09-18 Peter Bürgisser , Christian Ikenmeyer , Greta Panova
‹ Prev 1 8 9 10 Next ›