Related papers: Simple polynomial equations over (mxm)-matrices

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 equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

We suggest a closed solution for the roots of polynomial trinomial algebraic equation $$z^n+xz^{n-1}-1=0$$ with an appropriate $x$. This solution is a minor modification to the work of Mikhalkin (Mikhalkin E N, 2006. On solving general…

For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

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…

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

We consider generalizations of the Vieta formula (relating the coefficients of an algebraic equation to the roots) to the case of equations whose coefficients are order-$k$ matrices. Specifically, we prove that if $X_1,\dots ,X_n$ are…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…

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}…

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

Ordinary orthogonal polynomials are uniquely characterized by the three term recurrence relations up to an overall multiplicative constant. We show that the newly discovered M-indexed orthogonal polynomials satisfy 3+2M term recurrence…

Let $\Delta$ be an one-dimensional simplicial complex on $\{1,2,\ldots,s\}$ and $S$ the polynomial ring $K[x_1,\ldots,x_s]$ over a field $K$. The explicit formula for $a_0(S/I_{\Delta}^n)$ is presented when $\mathrm{girth}(\Delta)\geq 4$.…

An algorithm which either finds an nonzero integer vector ${\mathbf m}$ for given $t$ real $n$-dimensional vectors ${\mathbf x}_1,...,{\mathbf x}_t$ such that ${\mathbf x}_i^T{\mathbf m}=0$ or proves that no such integer vector with norm…

We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…

In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…

In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…

Using octonions, more specifically, using a 4 x 4 matrix representation of octonions obtained with the help of algebraic properties of quaternions, we obtain the fully symmetric Maxwell's equations (Maxwell's equations with electric and…