Related papers: Characterization of the matrix whose norm is deter…

Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative.…

Let $A={bmatrix} A_{11} &A_{12} A_{21} & A_{22} {bmatrix}$ be an $n\times n$ accretive-dissipative matrix, $k$ and l be the orders of $A_{11}$ and $A_{22}$, respectively, and let $m=\min\{k,l\}$. Then $$|\det A|\le a|\det A_{11}|\cdot|\det…

This manuscript studies statistical properties of linear classifiers obtained through minimization of an unregularized convex risk over a finite sample. Although the results are explicitly finite-dimensional, inputs may be passed through…

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…

The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial. In this paper, we provide some improved upper and lower bounds…

This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted isometry property (RIP), convex relaxations using the nuclear…

For a complex reductive group G acting linearly on a complex affine space V with respect to a character, we show two stratifications of V associated to this action (and a choice of invariant inner product on the Lie algebra of the maximal…

We determine the rank of a random matrix over an arbitrary field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula…

A lonesum matrix is a $(0,1)$-matrix that is uniquely determined by its row and column sum vectors. In this paper, we introduce lonesum decomposable matrices and study their properties. We provide a necessary and sufficient condition for a…

For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…

We give conditions on sequences of positive algebraic numbers $\{a_{n,j}\}_{n=1}^\infty$, $j=1,\dots ,M$ and number field $\mathbb K$ to ensure that the numbers defined by the continued fractions $[0;a_{1,j},a_{2,j},\dots ]$, $j=1,\dots ,M$…

We derive sharp non - asymptotical Lebesgue - Riesz as well as Grand Lebesgue Space norm estimations for different norms of matrix martingales through these norms for the correspondent martingale differences and through the entropic…

Low rank inference on matrices is widely conducted by optimizing a cost function augmented with a penalty proportional to the nuclear norm $\Vert \cdot \Vert_*$. However, despite the assortment of computational methods for such problems,…

An unknown $m$ by $n$ matrix $X_0$ is to be estimated from noisy measurements $Y=X_0+Z$, where the noise matrix $Z$ has i.i.d. Gaussian entries. A popular matrix denoising scheme solves the nuclear norm penalization problem $\operatorname…

Over the past few years, trace regression models have received considerable attention in the context of matrix completion, quantum state tomography, and compressed sensing. Estimation of the underlying matrix from regularization-based…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We give a complete characterization of nonnegative integers $j$ and $k$ and a positive integer $n$ for which there is an $n$-by-$n$ matrix with its power partial isometry index equal to $j$ and its ascent equal to $k$. Recall that the power…

We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

A \emph{sign pattern (matrix)} is a matrix whose entries are from the set $\{+, -, 0\}$. The \emph{minimum rank} (respectively, \emph{rational minimum rank}) of a sign pattern matrix $\cal A$ is the minimum of the ranks of the real…