Related papers: Simple polynomial equations over $(2 \times 2)$-ma…

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

The Strassen $2\times2$ matrix multiplication algorithm arises from the volume form on the 3-dimensional quotient space of the $2\times 2$ matrices by the multiples of identity.

In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded by the dimension. Combining Orlin's primal-based modification…

In this article we compute the number of invertible $2\times 2$ matrices with integer entries modulo $n$ whose permanents are congruent modulo $n$ to a given integer $x$.

For the orthogonal Lie algebra O(2n+1), in addition to the conventional set of orthogonal polynomials, another set is produced with the help of the Lie superalgebra OSP(1|2n). Difficulties related with expression of Dyson's constant for the…

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

In the classical linear degeneracy testing problem, we are given $n$ real numbers and a $k$-variate linear polynomial $F$, for some constant $k$, and have to determine whether there exist $k$ numbers $a_1,\ldots,a_k$ from the set such that…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

Let $n\ge 3$ be a square-free natural number. We explicitly describe the inverses of the matrices $$ (2\sin(2\pi jk^*/n))_{j,k} \enspace \mbox{ and }\enspace (2\cos(2\pi jk^*/n))_{j,k}, $$ where $k^*$ denotes a multiplicative inverse of $k$…

The characteristic polynomial of an $r$-tuple $(A_1,..., A_r)$ of $n \times n$ matrices is the determinant $\det(x_0 I + x_1 A_1 + ... + x_r A_r)$. We show that if $r$ is at least 3 and $A = (A_1,..., A_r)$ is an $r$-tuple of matrices in…

This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…

An polynomial identity is derived from the representation V_m(x)\otimes V_n(y) of U_q(\hat {sl_2}) and a new basis of V_m(x)\otimes V_n(y) is established under some condition.

This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…

It is well-known that to every binary relation on a non-void set I there can be assigned its incidence matrix, also in the case when I is infinite. We show that a certain kind of "multiplication" of such incidence matrices corresponds to…

Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…

The aim of the paper is to find representation for solutions of $2\times 2$ system of ordinary differential equations $$ \mathbf{y^\prime} - B(x)\mathbf{y} = \lambda A(x)\mathbf{y}, \quad \ x \in [0, 1], $$ where $A(x) = diag\{a_1(x),…

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…