Related papers: Central polynomials of minimal degree for matrices

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case r = 6 in the space of bilinear maps C^4 x C^4 -> C^4. This…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

We study the minimal dimension of maximal commutative subalgebras of the matrix algebra $M_n(k)$ over an algebraically closed field. While examples with dimension strictly smaller than n are known for $n \geq 14$, no such examples are known…

Let $K$ be an algebraically closed field of characteristic $0$ and $G$ a finite abelian group. For a $G$-graded $K$-algebra $A$, we define the primeness property for graded central polynomials: for any graded polynomials $f$ and $g$ in…

In this paper we prove the generalized Kaplansky conjecture for the Jordan algebras of the type $J_n$ in particular for self adjoint $2\times 2$ matrices over $\R$, over $\C$, $\HH$ and $\Oct$. In fact, we prove that the image of…

In this paper, we study the derivatives of an integer-valued polynomial of a given degree. Denoting by $E_n$ the set of the integer-valued polynomials with degree $\leq n$, we show that the smallest positive integer $c_n$ satisfying the…

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…

Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in $\{ -1,1\}$ are called Littlewood polynomials. By exploiting an algorithm developed…

Let $K$ be an algebraically closed field of characteristic $0$ and let $M_n(K)$, $n \ge 3$, be the matrix ring over $K$. We will show that the image of any multilinear polynomial in four variables evaluated on $M_n(K)$ contains all matrices…