Related papers: A Simple Trigonometric Classification of Quintic R…
The simplest cubic fields $\mathbb{Q}(\rho)$ are generated by a root $\rho$ of the polynomial $x^3-ax^2-(a+3)x-1$ where $a\geq -1$. In this paper, we will show that the Pythagoras number of the order $\mathbb{Z}[\rho]$ is equal to $6$ for…
Let $f(x)=p(x)-q(x)$ be a polynomial with real coefficients whose roots have nonnegative real part, where $p$ and $q$ are polynomials with nonnegative coefficients. In this paper, we prove the following: Given an initial point $x_0 > 0$,…
We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
Planar quadratic differential systems occur in many areas of applied mathematics. Although more than one thousand papers have been written on these systems, a complete understanding of this family is still missing. Classical problems, and…
A problem concerning the shift of roots of a system of homogeneous algebraic equations is investigated. Its conservation and decomposition of a multiple root into simple roots are discussed.
We have proved in this paper that numbers can be expressed in algebraic form using one variable and two real rational quantities and thus sum of three cubes can also be expressed in algebraic form as a cubic polynomial. Using skeletal or…
Consider real or complex polynomial Riccati differential equations $a(x) \dot y=b_0(x)+b_1(x)y+b_2(x)y^2$ with all the involved functions being polynomials of degree at most $\eta$. We prove that the maximum number of polynomial solutions…
This work presents and extends a known spigot-algorithm for computing square-roots, digit-by-digit, that is suitable for calculation by hand or an abacus, using only addition and subtraction. We offer an elementary proof of correctness for…
In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…
We provide a short proof of an algebraic identity. For integers $n\ge 2$ and variables $x,y,z$, it represents $(x^n+y^n-z^n)$ as a value of the quadratic form $\mathcal A^2+\mathcal B^2-\mathcal C^2$ after multiplication by an explicit…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…
The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.
Quantifier elimination of positive semidefinite cyclic ternary quartic forms is studied in this paper. We solve the problem by the theory of complete discrimination systems, function \RealTriangularize in Maple15 and the so-called…
We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…
Bhargava parametrized quintic rings over $\mathbb{Z}$ by quadruples of $5\times 5$ alternating matrices. We extend the construction to work similarly over any Dedekind domain $R$. No assumptions are needed on the characteristic of $R$. The…
Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as equations. A finite rule set is most informative when it…
The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…