Related papers: Integrability of matrices
Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…
The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…
Two important notions of integrability for discrete mappings are algebraic integrability and singularity confinement, have been used for discrete mappings. Algebraic integrability is related to the existence of sufficiently many conserved…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
We present an integrability criterion for rational mappings based on two requirements. First, that a given point should have a unique preimage under the mapping and, second, that the spontaneously appearing singularities be confined to a…
Given an integral domain A we consider the set of all integral elements over A that can occur as an eigenvalue of a symmetric matrix over A. We give a sufficient criterion for being such an element. In the case where A is the ring of…
We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in a previous work when the polynomial…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
We consider the problem of defining quantum integrability in systems with finite number of energy levels starting from commuting matrices and construct new general classes of such matrix models with a given number of commuting partners. We…
We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, raise in the quantum computation, bin-packing and matrix analysis. We find the…
There is a widespread perception that dynamical evolution of integrable systems should be simpler in a quantifiable sense than the evolution of generic systems, though demonstrating this relation between integrability and reduced complexity…
We investigate the well-posedness of the radiative transfer equation with polarization and varying refractive index. The well-posedness analysis includes non-homogeneous boundary value problems on bounded spatial domains, which requires the…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We…
A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…
Let $V\in\mathbb{Q}(i)(\a_1,\dots,\a_n)(\q_1,\q_2)$ be a rationally parametrized planar homogeneous potential of homogeneity degree $k\neq -2, 0, 2$. We design an algorithm that computes polynomial \emph{necessary} conditions on the…
We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete