English
Related papers

Related papers: An upper bound for permanents of nonnegative matri…

200 papers

For any dimension $n \geq 2$, we consider the maximal directional Hilbert transform $\mathscr{H}_U$ on $\mathbb R^n$ associated with a direction set $U \subseteq \mathbb S^{n-1}$: \[ \mathscr{H}_Uf(x) := \frac{1}{\pi} \sup_{v \in U} \Bigl|…

Classical Analysis and ODEs · Mathematics 2018-09-11 Izabella Laba , Alessandro Marinelli , Malabika Pramanik

We formulate a quantitative finite-dimensional conjecture about frame multipliers and prove that it is equivalent to Conjecture 1 in [SB2]. We then present solutions to the conjecture for certain classes of frame multipliers. In particular,…

Functional Analysis · Mathematics 2022-12-05 Peter Balazs , Daniel Freeman , Roxana Popescu , Michael Speckbacher

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

The extremal function $ex(n, P)$ is the maximum possible number of ones in any 0-1 matrix with $n$ rows and $n$ columns that avoids $P$. A 0-1 matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for…

Combinatorics · Mathematics 2020-11-04 Jesse Geneson , Shen-Fu Tsai

Drew, Johnson and Loewy conjectured that for $n \geq 4$, the CP-rank of every $n \times n$ completely positive real matrix is at most $\left[n^{2}/4\right]$. While this conjecture is false for completely positive real matrices, we show that…

Rings and Algebras · Mathematics 2017-09-01 Preeti Mohindru , Rajesh Pereira

It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a $N\times N$ random unitary matrix sampled from the Haar measure grows like $CN/(\log N)^{3/4}$ for some…

Probability · Mathematics 2016-09-21 Louis-Pierre Arguin , David Belius , Paul Bourgade

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

For a given reciprocal matrix A, we give a union of matrix intervals in which any consistent matrix obtained from an efficient vector for A lies, and, conversely, any consistent matrix in this union comes from an efficient vector for A. The…

Combinatorics · Mathematics 2025-10-15 Susana Furtado , Charles Johnson

Our first result is a noncommutative form of Jessen/Marcinkiewicz/Zygmund theorem for the maximal limit of multiparametric martingales or ergodic means. It implies bilateral almost uniform convergence with initial data in the expected…

Functional Analysis · Mathematics 2019-10-24 José M. Conde-Alonso , Adrián M. González-Pérez , Javier Parcet

We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor for the permanent. We also give a combinatorial application of the lower…

Combinatorics · Mathematics 2014-08-06 Leonid Gurvits , Alex Samorodnitsky

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

Combinatorics · Mathematics 2018-10-19 Cole Franks , Michael Saks

We prove optimal constant over root $n$ upper bounds for the maximal probabilities of $n$th convolution powers of discrete uniform distributions.

Probability · Mathematics 2007-06-07 Lutz Mattner , Bero Roos

We study the complexity of approximating the permanent of a positive semidefinite matrix $A\in \mathbb{C}^{n\times n}$. 1. We design a new approximation algorithm for $\mathrm{per}(A)$ with approximation ratio $e^{(0.9999 + \gamma)n}$,…

Data Structures and Algorithms · Computer Science 2024-04-18 Farzam Ebrahimnejad , Ansh Nagda , Shayan Oveis Gharan

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Number Theory · Mathematics 2009-11-10 Pietro Corvaja , Zeev Rudnick , Umberto Zannier

We consider nonnegative integer matrices with specified row and column sums and upper bounds on the entries. We show that the logarithm of the number of such matrices is approximated by a concave function of the row and column sums. We give…

Combinatorics · Mathematics 2011-02-15 Austin Shapiro

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…

Combinatorics · Mathematics 2016-06-27 Ross Berkowitz , Pat Devlin

In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim…

Probability · Mathematics 2016-08-03 Feng Wei

We give some necessary conditions for maximality of $0/1$-determinant. Let ${\bf M}$ be a nondegenerate $0/1$-matrix of order $n$. Denote by $\bf A$ the matrix of order $n+1$ which appears from ${\bf M}$ after adding the $(n+1)$th row…

Metric Geometry · Mathematics 2019-07-16 Mikhail Nevskii , Alexey Ukhalov

This paper provides counterexamples to a previously conjectured upper bound on the first index $n_0$ at which a zero appears in constant term sequences of the form $A_p(n) = ct(P^n) \mod p$, where $P(t) \in \mathbb{Z}[t, t^{-1}]$. The…

Number Theory · Mathematics 2025-04-29 Justin Offutt