Related papers: Nonnegative definite hermitian matrices with incre…
Hermitian mass matrices for the up and down quarks with texture zeroes but with the minimum number of parameters, ten, are investigated. We show how these {\em minimum parameter} forms can be obtained from a general set of hermitian…
We study finite but growing principal square submatrices $A_n$ of the one- or two-sided infinite Fibonacci Hamiltonian $A$. Our results show that such a sequence $(A_n)$, no matter how the points of truncation are chosen, is always stable…
We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
Given a symmetric nonnegative matrix $A$, symmetric nonnegative matrix factorization (symNMF) is the problem of finding a nonnegative matrix $H$, usually with much fewer columns than $A$, such that $A \approx HH^T$. SymNMF can be used for…
Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
A matrix is called totally nonnegative (TN) if all its minors are nonnegative, and totally positive (TP) if all its minors are positive. Multiplying a vector by a TN matrix does not increase the number of sign variations in the vector. In a…
We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.
Let $A$ be an element of the copositive cone ${\cal C}_n$. A zero $u$ of $A$ is a nonzero nonnegative vector such that $u^TAu = 0$. The support of $u$ is the index set $\mbox{supp}u \subset \{1,\dots,n\}$ corresponding to the positive…
Subspace iterations are used to minimise a generalised Ritz functional of a large, sparse Hermitean matrix. In this way, the lowest $m$ eigenvalues are determined. Tests with $1 \leq m \leq 32$ demonstrate that the computational cost (no.…
Roots of matrices are well-studied. The conditions for their existence are understood: The block sizes of nilpotent Jordan blocks, arranged in pairs, have to satisfy some simple algebraic property. More interesting are structured roots of…
Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that $2\times 2$ minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial…
We say that a square real matrix $M$ is \emph{off-diagonal nonnegative} if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix $M$, there…
For positive integers $n,n'$, we give a combinatorial characterization for the set of quadratic inequalities on minors that are valid for all $n\times n'$ totally nonnegative matrices. This is obtained as a consequence from our earlier…
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…
Let $R$ be a commutative ring with non-zero identity and $M$ be a unitary $R$-module. The goal of this paper is to extend the concept of 1-absorbing primary ideals to 1-absorbing primary submodules. A proper submodule $N$ of $M$ is said to…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
We give conditions for determining the extremal behavior for the (graded) Betti numbers of squarefree monomial ideals. For the case of non-unique minima, we give several conditions which we use to produce infinite families, exponentially…