相关论文: The main reasons for matrices multiplying to zero
The aim of this manuscript is to understand the dynamics of matrix products in a max algebra. A consequence of the Perron-Fr\"{o}benius theorem on periodic points of a nonnegative matrix is generalized to a max algebra setting. The same is…
Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…
Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…
An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…
We study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of…
In this paper, we describe the entire structure of the vector space $Sym_2^0$ of all symmetric matrices of size $2$ having trace zero. This is motivated by the geometrical interpretation of any arbitrary element of $Sym_2^0$. We further…
Multiparameter persistence is a natural extension of the well-known persistent homology, which has attracted a lot of interest. However, there are major theoretical obstacles preventing the full development of this promising theory. In this…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…
All matrices we consider have entries in a fixed algebraically closed field $K$. A minor of a square matrix is principal means it is defined by the same row and column indices. We study the ideal generated by size $t$ principal minors of a…
We enumerate the number of 0/1-matrices avoiding 2x2 submatrices satisfying certain conditions. We also provide corresponding exponential generating functions.
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We formulate conjectures regarding the maximum value and maximizing matrices of the permanent and of diagonal products on the set of stochastic matrices with bounded rank. We formulate equivalent conjectures on upper bounds for these…
We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…
The dimension of a bipartition matrix (BPM) is the sum of the dimensions of its indecomposable factors. The dimension of an indecomposable BPM is the sum of its row, column, and entry dimensions. To compute these dimensions, we apply four…