Related papers: Another approach to decide on real root existence …

Let $c(x)$ be a monic integer polynomial with coefficients $0$ or $1$. Write $c(x) = a(x) b(x)$ where $a(x)$ and $b(x)$ are monic polynomials with non-negative real (not necessarily integer) coefficients. The unfair 0--1 polynomial…

The theorem of three circles in real algebraic geometry guarantees the termination and correctness of an algorithm of isolating real roots of a univariate polynomial. The main idea of its proof is to consider polynomials whose roots belong…

We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

In this article we apply a formula for the $n$-th power of a $3\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer…

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

A construction of convex flag triangulations of five and higher dimensional spheres, whose h-polynomials fail to have only real roots, is given. We show that there is no such example in dimensions lower than five. A condition weaker than…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

We prove that all arrangements (consistent with the Rolle theorem and some other natural restrictions) of the real roots of a real polynomial and of its $s$-th derivative are realizable by real polynomials.

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…

This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…

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…

For a real polynomial $p = \sum_{i=0}^{n} c_ix^i$ with no negative coefficients and $n\geq 6$, let $\beta (p) = \inf_{i=1}^{n-1} c_i^2/c_{i+1}c_{i-1}$ (so $\beta (p) \geq 1$ entails that $p$ is log concave). If $\beta(p) > 1.45...$, then…

A linear operator on a finite dimensional nonzero real vector space may not have an eigenvalue. We define a related notion of a true-pair of a linear operator, and then show that each linear operator on a finite dimensional nonzero real…

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…

Recently, B. Yang and J. Yang derived a family of rational solutions to the Sasa-Satsuma equation, and showed that any of its members constitutes a partial-rogue wave provided that an associated generalised Okamoto polynomial has no real…

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…