Related papers: On random matrices with large corank

We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Answering affirmatively a 2007 problem of Chen, the first author proved that there is a unique representation basis $A$ of $\mathbb{Z}$ and a constant $c>0$ such that $$ A(-x,x)\ge c\sqrt{x} $$ for infinitely many positive integers $x$,…

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-\Omega(\epsilon n))$ in the choice of $A$,…

The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Minc's conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some…

We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set consisting of $N$ points chosen uniformly at random in the $s$-dimensional unit cube $[0,1]^s$ with probability at least $1-\exp(-\Theta(s))$…

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..

We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf…

Given an operator system $\mathcal{S}$, we define the parameters $r_k(\mathcal{S})$ (resp. $d_k(\mathcal{S})$) defined as the maximal value of the completely bounded norm of a unital $k$-positive map from an arbitrary operator system into…

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…

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…

Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this…

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

For random integer matrices $M_1,\ldots,M_k \in \operatorname{Mat}_n(\mathbb{Z})$ with independent entries, we study the distribution of the cokernel $\operatorname{cok}(M_1 \cdots M_k)$ of their product. We show that this distribution…

In this paper, we study the distribution of the cokernels of random $p$-adic matrices with fixed zero entries. Let $X_n$ be a random $n \times n$ matrix over $\mathbb{Z}_p$ in which some entries are fixed to be zero and the other entries…

It is well known that if $A\in\mathbb{C}^{N\times N}$ and $B\in\mathbb{C}^{N\times M}$ form a controllable pair (in the sense that the Kalman matrix $[B\ |\ AB\ | \ \dots\ |\ A^{N-1}B]$ has full rank) then, there exists…

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…

Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to…