Related papers: On 0--1 matrices whose inverses have entries of th…

In this paper we continue studying of matrix $n\times n$ linear differential intertwining operators. The problems of minimization and of reducibility of matrix intertwining operators are considered and criterions of weak minimizability and…

A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k =…

Let $\pi(A)$, $\xi(A)$ and $\nu(A)$, respectively, denote the number of positive, zero and negative eigenvalues of the matrix $A$. Then the triplet $(\pi(A), \xi(A), \nu(A))$ is called the \emph{inertia} of $A$ and is denoted by…

A matrix is called totally negative (totally non-positive) of order $k$, if all its minors of size at most $k$ are negative (non-positive). The objective of this article is to provide several novel characterizations of total negativity via…

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

We show that almost every entry in the character table of $S_n$ is even as $n\to\infty$. This resolves a conjecture of Miller. We similarly prove that almost every entry in the character table of $S_n$ is zero modulo $3,5,7,11,$ and $13$ as…

The paper studies algebraic strong shift equivalence of matrices over $n$-variable polynomial rings over a principal ideal domain $D$($n\leq 2$). It is proved that in the case $n=1$, every non-zero matrix over $D[x]$ has a full rank…

It was shown recently by the authors that, for any n, there is equality between the distributions of certain triplets of statistics on nxn alternating sign matrices (ASMs) and descending plane partitions (DPPs) with each part at most n. The…

For the class of $d\times d$ matrices $B=[b_{i,j}]$ with complex nonzero entries satisfying $\sum_{i=1}^{d}|b_{i,j}|=1$, we provide the conditions for the convergence of power matrices $B^n$ to a nonzero limit matrix. In particular, for…

An MDS matrix is a matrix whose minors all have full rank. A question arising in coding theory is what zero patterns can MDS matrices have. There is a natural combinatorial characterization (called the MDS condition) which is necessary over…

Let k be an algebraically closed field of characteristic p different from 2, and let F be a nodal surface of degree d in the projective 3-space P over k (i.e. the singularities of F are only ordinary quadratic, nodes for short). Let N be a…

The main result of the paper is a classification of singularities of complex skew-symmetric matrix families of even size which are simple under a natural equivalence relation. The classification is obtained by appropriate suspensions of…

The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II…

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…

An $(n-1)$-tuple $a = (a(1), \dots, a(n-1))$ consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers $N$ such that the convex hull, $K(a(n))$, in $n$-dimensional Euclidean space…

Given a real symmetric $n\times n$ matrix, the sepr-sequence $t_1\cdots t_n$ records information about the existence of principal minors of each order that are positive, negative, or zero. This paper extends the notion of the sepr-sequence…

Let $n,k$ be fixed natural numbers with $1\le k\le n$ and let $A_{n+1,k,2k,\dots,sk}$ denote an $(n+1)\times (n+1)$ complex multidiagonal matrix having $s=[n/k]$ sub- and superdiagonals at distances $k,2k,\dots,sk$ from the main diagonal.…