Related papers: The Multiplicative Inverse Eigenvalue Problem over…
A polynomial P in n complex variables is said to have the "half-plane property" (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right half-plane. Such polynomials arise in combinatorics, reliability…
In this paper, we prove that every iterative differential embedding problem over an algebraic function field in positive characteristic with an algebraically closed field of constants has a proper solution.
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
If a tuple of matrices has a common invariant subspace, its projective joint spectrum has an algebraic component. In general, the converse is not true, and there might be algebraic components in the projective joint spectrum without…
Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…
The nonnegative inverse eigenvalue problem (NIEP) is to characterize the spectra of entrywise nonnegative matrices. A finite multiset of complex numbers is called realizable if it is the spectrum of an entrywise nonnegative matrix. Monov…
Let $K$ be a field and $\sigma$ an automorphism of $K$ of order $n$.Employing a nonassociative algebra, we study the eigenspace of a bounded skew polynomial $f\in K[t;\sigma]$. We mainly treat the case that $K/F$ is a cyclic field extension…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
We evidence a family $\mathcal{X}$ of square matrices over a field $\mathbb{K}$, whose elements will be called X-matrices. We show that this family is shape invariant under multiplication as well as transposition. We show that $\mathcal{X}$…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
The author introduces a conjecture about Makar-Limanov invariants of affine unique factorization domains over a field of characteristic zero. Then the author finds that the conjecture does not always hold when $\mathbbm{k}$ is not…
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
It is known that a $2\times 2$ quaternionic matrix has one, two or an infinite number of left eigenvalues, but the available algebraic proofs are difficult to generalize to higher orders. In this paper a different point of view is adopted…
The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…