Related papers: Combined matrices of almost strictly sign regular …
The new class of integrable mappings and chains is introduced. Corresponding (1+2) integrable systems invariant with respect to such discrete transformations are represented in explicit form. Soliton like solutions of them are represented…
Given a known matrix that is the sum of a low rank matrix and a masked sparse matrix, we wish to recover both the low rank component and the sparse component. The sparse matrix is masked in the sense that a linear transformation has been…
Recently, many structured tensors are defined and their properties are discussed in the literature. In this paper, we introduce a new class of structured tensors, called exceptionally regular tensor, which is relevant to the tensor…
Within the type II see-saw mechanism the light neutrino mass matrix is given by a sum of a direct (or triplet) mass term and the conventional (type I) see-saw term. Both versions of the see-saw mechanism explain naturally small neutrino…
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensure well--posedness of the problem, we impose a joint low rank…
Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…
A sign pattern matrix is a matrix whose entries are from the set $\{+,-,0\}$. If $A$ is an $m\times n$ sign pattern matrix, the qualitative class of $A$, denoted $Q(A)$, is the set of all real $m\times n$ matrices $B=[b_{i,j}]$ with…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
A recent work of the authors on the analysis of pairwise comparison matrices that can be made consistent by the modification of a few elements is continued and extended. Inconsistency indices are defined for indicating the overall quality…
We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…
It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
The affine space of traceless complex matrices in which the sum of all elements in every row and every column is equal to one is presented as an example of an affine space with a Lie bracket or a Lie affgebra.
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…
In this work, we characterize matrices of linear forms and constant rank, demonstrating that, under some natural assumptions, they are always associated with a syzygy bundle that fits into a (partially linear) resolution. Furthermore, this…
A (positive definite and non-classic integral) quadratic form is called strongly $s$-regular if it satisfies a strong regularity property on the number of representations of squares of integers. In this article, we prove that for any…
A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…
We consider the totally asymmetric simple exclusion process (TASEP) on a finite lattice with open boundaries. We show, using the recursive structure of the Markov matrix that encodes the dynamics, that there exist two transfer matrices…