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

For a family of graphs $\mathcal{F}$, a graph $G$ is $\mathcal{F}$-universal if $G$ contains every graph in $\mathcal{F}$ as a (not necessarily induced) subgraph. For the family of all graphs on $n$ vertices and of maximum degree at most…

For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some…

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…

We show that the absolute value of the determinant of a matrix with random independent (but not necessarily iid) entries is strongly concentrated around its mean. As an application, we show that the Godsil-Gutman and Barvinok estimators for…

The following theorem is proved: Suppose $M = (a_{i,j})$ be a $k \times k$ matrix with positive entries and $a_{i,j}a_{i+1,j+1} > 4\cos ^2 \frac{\pi}{k+1} a_{i,j+1}a_{i+1,j} \quad (1 \leq i \leq k-1, 1 \leq j \leq k-1).$ Then $\det M > 0 .$…

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…

Let $X_1$, $X_2$, $\ldots$, $X_n$ be a sequence of coherent random variables, i.e., satisfying the equalities $$ X_j=\mathbb{P}(A|\mathcal{G}_j),\qquad j=1,\,2,\,\ldots,\,n,$$ almost surely for some event $A$. The paper contains the proof…

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent…

Computing the permanent of a $(0,1)$-matrix is a well-known $\#P$-complete problem. In this paper, we present an expression for the permanent of a bipartite graph in terms of the determinant of the graph and its subgraphs, obtained by…

A matrix is called Bohemian if its entries are sampled from a finite set of integers. We determine the maximum absolute determinant of upper Hessenberg Bohemian Matrices for which the subdiagonal entries are fixed to be $1$ and upper…

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

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…

We consider operator-valued polynomials in Gaussian Unitary Ensemble random matrices and we show that its $L^p$-norm can be upper bounded, up to an asymptotically small error, by the operator norm of the same polynomial evaluated in free…

We report new world records for the maximal determinant of an n-by-n matrix with entries +/-1. Using various techniques, we beat existing records for n=22, 23, 27, 29, 31, 33, 34, 35, 39, 45, 47, 53, 63, 69, 73, 77, 79, 93, and 95, and we…

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

In this technical communique we study the maximal robust positively invariant set for state-constrained continuous-time nonlinear systems subjected to a bounded disturbance. Extending results from the theory of barriers, we show that this…