Related papers: Bounds on minors of binary matrices
Using a result of Demailly and Pham on log canonical thresholds, we give an upper bound for polar invariants from a question of Teissier on hypersurface singularities. This provides a weaker alternative upper bound compared to the one…
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…
We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…
In this paper we give a different approach to determining the cardinality of $h$-fold sumsets $hA$ when $A\subset \mathbb{Z}^d$ has $d+2$ elements. This enables us to provide more general result with a shorter and simpler proof. We also…
Let $p(z)=z^n+a_{n-1}z^{n-1}+a_{n-2}z^{n-2}+\ldots+a_1z+a_0$ be a complex polynomial with $a_0\neq 0$ and $n\geq 3$. Several new upper bounds for the moduli of the zeros of $p$ are developed. In particular, if…
A matrix is called totally positive if every minor of it is positive. Such matrices are well studied and have numerous applications in Mathematics and Computer Science. We study how many times the value of a minor can repeat in a totally…
Recently, the higher order Tur\'{a}n inequalities for the Boros-Moll sequences $\{d_\ell(m)\}_{\ell=0}^m$ were obtained by Guo. In this paper, we show a different approach to this result. Our proof is based on a criterion derived by Hou and…
The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
We improve the Cauchy radius of both scalar and matrix polynomials, which is an upper bound on the moduli of the zeros and eigenvalues, respectively, by using appropriate polynomial multipliers.
We consider general bilinear products defined by positive semidefinite matrices. Typically non-commutative, non-associative, and non-unital, these products preserve positivity and include the classical Hadamard, Kronecker, and convolutional…
For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We prove a lower bound on the dimension of the set of maximal border subrank tensors. This is the first such bound of its type.
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…
A classical result of Paley shows that there are infinitely many quadratic characters $\chi\mod{q}$ whose character sums get as large as $\sqrt{q}\log \log q$; this implies that a conditional upper bound of Montgomery and Vaughan cannot be…