Related papers: The $2\times2$ Matrix Mortality Problem and Invert…

A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…

We investigate N_c=2 case of IIB matrix model, which is exactly soluble. We calculate the partition function exactly and obtain a finite result without introducing any cut-off. We also evaluate some correlation functions consisting of…

If a noncommutative polynomial $f$ is neither an identity nor a central polynomial of $\mathcal A=M_n(\C)$, then every trace zero matrix in $\mathcal A$ can be written as a sum of two matrices from $f(\mathcal A)-f(\mathcal A)$. Moreover,…

In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

The matricial range of the $2\times2$ matrix $E_{21}$ (i.e., the $2\times 2$ unilateral shift) is described very simply: it consists of all matrices with numerical radius at most $1/2$. The known proofs of this simple statement, however,…

We study the problem of efficiently correcting an erroneous product of two $n\times n$ matrices over a ring. Among other things, we provide a randomized algorithm for correcting a matrix product with at most $k$ erroneous entries running in…

We investigate the conditions under which systems of two differential eigenvalue equations are quasi exactly solvable. These systems reveal a rich set of algebraic structures. Some of them are explicitely described. An exemple of quasi…

In this paper we develop a method to compute the solution to a countable (finite or infinite) set of equations that occurs in many different fields including Markov processes that model queueing systems, birth-and-death processes and…

We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…

We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved. We complement this work by proving decidability for the case that the…

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

The long-standing hypothesis formulated by Goreinov, Tyrtyshnikov and Zamarashkin \cite{GTZ1997} has recently been solved affirmatively in the case of real two-column matrices by Sengupta and Pautov \cite{SP2026}. In this paper, we consider…

We construct a family of matrix ensembles that fits Anshelevich's regression postulates for "Meixner laws on matrices". We show that the Laplace transform of a general n by n Meixner matrix ensemble satisfies a system of partial…

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

Consider a $m \times n$ matrix $A$, whose elements are arbitrary integers. Consider, for each square window of size $2 \times 2$, the sum of the corresponding elements of $A$. These sums form a $(m - 1) \times (n-1)$ matrix $S$. Can we…

Given positive integers $h, N$ satisfying $1 \leqslant h \leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any…

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…