English
Related papers

Related papers: Van der Waerden Conjecture for Mixed Discriminants

200 papers

Here we answer a conjecture by Ron Graham about getting finer upper bounds for van der Waerden numbers in the affirmative, but without the application of double induction or combinatorics as applied to sets of integers that contain some van…

Number Theory · Mathematics 2012-08-24 Robert J. Betts

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…

Functional Analysis · Mathematics 2017-10-17 Arnab Patra , P. D. Srivstava

A well-known representation-theoretic model for the transformed Macdonald polynomial $\widetilde{H}_\mu(Z;t,q)$, where $\mu$ is an integer partition, is given by the Garsia-Haiman module $\mathcal{H}_\mu$. We study the $\frac{n!}{k}$…

Combinatorics · Mathematics 2022-10-24 Sam Armon

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

Combinatorics · Mathematics 2013-05-07 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

In hybrid normed ideal perturbations of $n$-tuples of operators, the normed ideal is allowed to vary with the component operators. We begin extending to this setting the machinery we developed for normed ideal perturbations based on the…

Operator Algebras · Mathematics 2018-04-04 Dan-Virgil Voiculescu

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $\pi,\sigma$ in $S$, there is an element $i\in \{1,\dots,n\}$ such that $\pi(i)=\sigma(i)$. We prove that if $S$ is intersecting, then…

Combinatorics · Mathematics 2013-03-01 Bahman Ahmadi , Karen Meagher

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 prove a Khintchine result for convergence of a multiplicative Diophantine set with restricted denominators on an arbitrary non-degenerate line. Specifically, given sequences of real numbers $\{a_n\}_{n\in\mathbb{N}},\,…

Number Theory · Mathematics 2026-02-27 Lucas Tapia

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

Disordered Systems and Neural Networks · Physics 2026-05-15 Pierre Bousseyroux , Marc Potters

For positive integers $1 \leq k \leq n$ let $M_n$ be the algebra of all $n \times n$ complex matrices and $M_n^{\le k}$ its subset consisting of all matrices of rank at most $k$. We first show that whenever $k>\frac{n}{2}$, any continuous…

Spectral Theory · Mathematics 2025-07-10 Alexandru Chirvasitu , Ilja Gogić , Mateo Tomašević

Let $A$ be a matrix whose columns $X_1,\dots, X_N$ are independent random vectors in $\mathbb{R}^n$. Assume that the tails of the 1-dimensional marginals decay as $\mathbb{P}(|\langle X_i, a\rangle|\geq t)\leq t^{-p}$ uniformly in $a\in…

Probability · Mathematics 2015-09-09 Olivier Guédon , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

In 1990, Tiet\"av\"ainen showed that if the only information we know about a linear code is its dual distance $d$, then its covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$. While Tiet\"av\"ainen's bound was later…

Information Theory · Computer Science 2017-07-04 Louay Bazzi

We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…

Functional Analysis · Mathematics 2020-05-20 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from above by $ 2 \*\sigma + o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Probability · Mathematics 2007-05-23 Sandrine Peche , Alexander Soshnikov

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Probability · Mathematics 2026-04-15 Dongbin Li , Alexander E. Litvak , Tingzhou Yu

We show that $k$-th iterated accumulation points of pseudo-effective thresholds of $n$-dimensional varieties are bounded by $n-k+1$.

Algebraic Geometry · Mathematics 2019-08-08 Zhan Li

We prove an upper bound on sums of squares of minors of {+1, -1} matrices. The bound is sharp for Hadamard matrices, a result due to de Launey and Levin (2009), but our proof is simpler. We give several corollaries relevant to minors of…

Combinatorics · Mathematics 2013-09-10 Richard P. Brent , Judy-anne H. Osborn

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…

Probability · Mathematics 2019-09-10 Asaf Ferber , Vishesh Jain