Related papers: Characterizing matrices with $X$-simple image eige…
A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…
This note addresses identification of the $A$-matrix in continuous time linear dynamical systems on state-space form. If this matrix is partially known or known to have a sparse structure, such knowledge can be used to simplify the…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
Semidefinite programming is based on optimization of linear functionals over convex sets defined by linear matrix inequalities, namely, inequalities of the form $$L_A(X)=I-A_1X_1-\dots-A_g X_g\succeq0.$$ Here the $X_j$ are real numbers and…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
In this note we construct a solution of a matrix interval linear equation of the form X=AX+B (the discrete stationary Bellman equation) over partially ordered semirings, including the semiring of nonnegative real numbers and all idempotent…
We present necessary and sufficient criteria for a max-algebraic supereigenvector, i.e., a solution of the system $A\otimes\textbf{x}\geq\textbf{x}$ with $A\in\overline{\mathbb{R}}^{n\times n}$ in max-plus algebra, to be an extremal. We…
Let X be a normal connected complex algebraic variety equipped with a semisimple complex representation of its fundamental group. Then, under a maximality assumption, we prove that the covering space of X associated to the kernel of the…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
We consider the problem of computing homogeneous coordinates of points in a zero-dimensional subscheme of a compact, complex toric variety $X$. Our starting point is a homogeneous ideal $I$ in the Cox ring of $X$, which in practice might…
This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in \{3,\ldots,n-3\}$. Characterize the Hermitian matrices $A$ such…
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
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 describe properties of a Hermitian square matrix M in M_n(C) equivalent to that of having minimal quotient norm in the following sense: ||M|| <= ||M+D|| for all real diagonal matrices D in M_n(C) and || || the operator norm. These…
In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region \Omega, within the complex plane. More precisely, we consider three types of regions and their intersections:…
In order to guarantee the downloading quality requirements of users and improve the stability of data transmission in a BitTorrent-like peer-to-peer file sharing system, this article deals with eigenproblems of addition-min algebras. First,…
In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…
Image segmentation is an inherently ill-posed problem and thus requires regularization in order to limit the search space to reasonable solutions. A majority of segmentation methods integrates these regularization terms in one way or the…
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…
Let $\mathcal{V} \subset M$ denote any of the varieties of singular $m \times m$ complex matrices which may be general, symmetric, or skew-symmetric ($m$ even), or $m \times p$ matrices, in the corresponding space $M$ of such matrices. A…