Related papers: Complex Roots of Quaternion Polynomials

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…

For a tree $T$, the subtree polynomial of $T$ is the generating polynomial for the number of subtrees of $T$. We show that the complex roots of the subtree polynomial are contained in the disk $\left\{z\in\mathbb{C}\colon\ |z|\leq…

This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

This short article presents explicit expressions for roots of a quartic equation that has all four real roots. Although a general expression for quartic roots is available on Wikipedia, an optimized and slightly shorter expression for only…

Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.