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

We study algebras satisfying a two-term multilinear identity, namely one of the form $x_1 \cdots x_n= q x_{\sigma(1)} \cdots x_{\sigma(n)}$, where $q$ is a parameter from the base field. We show that such algebras with $q=1$ and $\sigma$…

Given two $\left( n+1\right) \times\left( n+1\right)$-matrices $A$ and $B$ over a commutative ring, and some $k\in\left\{ 0,1,\ldots,n\right\}$, we consider the $\dbinom{n}{k}\times\dbinom{n}{k}$-matrix $W$ whose entries are $\left(…

The explicit solution of the initial-values problem is exhibited of a subclass of the autonomous system of 2 coupled first-order ODE s with second-degree polynomial right-hand sides, hence featuring 12 a prior arbitrary (time-independent)…

In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

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…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A}…

Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

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…

For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…

The quaternion equation X^n=A is solved for any integer number n > 1. A is a given quaternion with komplex numbers as its elements. We use the isomorphism between quaternions and (4,4)-matrices to solve this equation.

We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…

In this paper we report a few examples of algebraically solvable dynamical systems characterized by 2 coupled Ordinary Differential Equations which read as follows: x_n = P(n) (x1, x2) , n = 1, 2 , with P(n) (x1, x2) specific polynomials of…