Related papers: A matrix version of the Steinitz lemma

We substantially apply the Li criterion for the Riemann hypothesis to hold. Based upon a series representation for the sequence \{\lambda_k\}, which are certain logarithmic derivatives of the Riemann xi function evaluated at unity, we…

This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candes and Recht, Candes and Tao, and Keshavan, Montanari, and…

A matrix $A\in \mathbb{R}^{m \times n}$ is strictly sign regular/SSR (or sign regular/SR) if for each $1 \leq k \leq \min\{m,n\}$, all (non-zero) $k\times k$ minors of $A$ have the same sign. This class of matrices contains the totally…

The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…

We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a…

Given a random matrix A with eigenvalues between -1 and 1, we analyze the number of iterations needed to solve the linear equation (I-A)x=b with the Neumann series iteration. We give sufficient conditions for convergence of an upper bound…

Suppose $\left \{ X_{i,k}; 1\le i \le p, 1\le k \le n \right \} $ is an array of i.i.d.~real random variables. Let $\left \{ p=p_{n}; n \ge1 \right \} $ be positive integers. Consider the maximum interpoint distance $M_{n}=\max_{1\le i<…

Consider random symmetric Toeplitz matrices $T_{n}=(a_{i-j})_{i,j=1}^{n}$ with matrix entries $a_{j}, j=0,1,2,...,$ being independent real random variables such that \be \mathbb{E}[a_{j}]=0, \ \ \mathbb{E}[|a_{j}|^{2}]=1 \ \ \textrm{for}\,\…

The solutions of an indeterminate Hamburger moment problem can be parameterised using the Nevanlinna matrix of the problem. The entries of this matrix are entire functions of minimal exponential type, and any growth less than that can…

Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…

We show that if the non Gaussian part of the cumulants of a random matrix model obey some scaling bounds in the size of the matrix, then Wigner's semicircle law holds. This result is derived using the replica technique and an analogue of…

In this paper we prove two results regarding reconstruction from magnitudes of frame coefficients (the so called "phase retrieval problem"). First we show that phase retrievability as an algebraic property implies that nonlinear maps are…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

The Collatz conjecture asserts that repeatedly iterating $f(x) = (3x + 1)/2^{a(x)}$, where $a(x)$ is the highest exponent for which $2^{a(x)}$ exactly divides $3x+1$, always lead to $1$ for any odd positive integer $x$. Here, we present an…

Let $a_1, \dots, a_n \in \mathbb{R}$ satisfy $\sum_i a_i^2 = 1$, and let $\varepsilon_1, \ldots, \varepsilon_n$ be uniformly random $\pm 1$ signs and $X = \sum_{i=1}^{n} a_i \varepsilon_i$. It is conjectured that $X = \sum_{i=1}^{n} a_i…

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[…

For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…

Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…

The moderate deviation principle is achieved for a stochastic Schrodinger type equation by applying the classical Azencott method. The Friedlin-Wentzell inequality derived by this method is then used to prove the Strassen's compact law of…