Related papers: The $2\times2$ Matrix Mortality Problem and Invert…
In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…
In this paper, we address two minimal controllability problems, where the goal is to determine a minimal subset of state variables in a linear time-invariant system to be actuated to ensure controllability under additional constraints.…
The bad science matrix problem consists in finding, among all matrices $A \in \mathbb{R}^{n \times n}$ with rows having unit $\ell^2$ norm, one that maximizes $\beta(A) = \frac{1}{2^n} \sum_{x \in \{-1, 1\}^n} \|Ax\|_\infty$. Our main…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
This paper aims to continue the studies initiated by Botha in [Linear Algebra Appl. 273 (1998), 65-82; Linear Algebra Appl. 286 (1999), 37-44; Linear Algebra Appl. 315 (2000), 1-23] by extending them to matrices over noncommutative division…
We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.
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…
We prove that for all integers $k \geq 1$, there exists a constant $C_k$ depending only on $k$, such that for all $q > C_k$, and for $n = 1, 2$ every matrix in $M_n(\mathbb{F}_q)$ is a sum of two $k$th powers and for all $n \geq 3$ every…
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…
We give a formula for the inverse matrix to an infinite matrix with possibly noncommutative entries, generalizing the Newton interpolation formula and the Taylor formula.
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…
Let $k = \mathbb{Q}(\sqrt{\alpha})$ be a real quadratic number field, where $\alpha$ is a positive square-free integer. Let $\mathcal{O}_k$ be the ring of integers of $k$. In this paper, we prove that a certain set of $2 \times 2$ singular…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
We will present solutions to the constant Yang-Baxter equation, in any dimension $n$. More precisely, for any $n$, we will create an infinite family of $n^2$ by $n^2$ matrices which are solutions to the constant Yang-Baxter equation. The…
The problem of determining whether a diagonally dominant matrix is singular or nonsingular is a classical topic in matrix theory. This paper develops necessary and sufficient conditions for the singularity or nonsingularity of diagonally…
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…
The probability that a tuple of matrices together with all scalars generates a finite incidence ring is calculated. It is proved that all real and complex finite-dimensional incidence algebras are generated by two randomly chosen matrices.
The eigenproblem of low-rank updated matrices are of crucial importance in many applications. Recently, an upper bound on the number of distinct eigenvalues of a perturbed matrix was established. The result can be applied to estimate the…