English
Related papers

Related papers: Univariate real root isolation in an extension fie…

200 papers

A method is proposed with which the locations of the roots of the monic symbolic quintic polynomial $x^5 + a_4 x^4 + a_3 x^3 + a_2 x^2 + a_1 x + a_0$ can be determined using the roots of two resolvent quadratic polynomials: $q_1(x) = x^2 +…

General Mathematics · Mathematics 2022-06-15 Emil M. Prodanov

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

Data Structures and Algorithms · Computer Science 2012-10-24 Emil Jeřábek

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

For a homogeneous polynomial of $n$ variables, we present a new method to compute the roots of Bernstein-Sato polynomial supported at the origin, assuming that general hyperplane sections of the associated projective hypersurface have at…

Algebraic Geometry · Mathematics 2019-07-16 Morihiko Saito

We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…

Symbolic Computation · Computer Science 2010-01-19 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

While the separation (the minimal nonzero distance) between roots of a polynomial is a classical topic, its absolute counterpart (the minimal nonzero distance between their absolute values) does not seem to have been studied much. We…

Number Theory · Mathematics 2017-12-06 Yann Bugeaud , Andrej Dujella , Tomislav Pejkovic , Bruno Salvy

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

Numerical Analysis · Mathematics 2019-08-20 Vitaly Zaderman , Liang Zhao

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

Number Theory · Mathematics 2018-10-17 Yoshiyuki Kitaoka

We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…

Classical Analysis and ODEs · Mathematics 2015-03-19 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…

Symbolic Computation · Computer Science 2014-01-21 Yacine Bouzidi , Sylvain Lazard , Marc Pouget , Fabrice Rouillier

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

Probability · Mathematics 2013-10-22 Zakhar Kabluchko , Dmitry Zaporozhets

We consider paths of steepest descent, in the complex plane, for the norm of a non-constant one variable polynomial $f$. We show that such paths, starting from a zero of the logarithmic derivative of $f$ and ending in a root of $f$, draw a…

Complex Variables · Mathematics 2022-02-02 Damien Roy

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…

Logic · Mathematics 2015-06-17 Grant Olney Passmore

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

Discrete Mathematics · Computer Science 2022-08-31 Marilena Jianu , Leonard Daus , Vlad-Florin Dragoi , Valeriu Beiu

Xu introduced a system of partial differential equations to investigate singular vectors in the Verma modules of highest weight $\lambda$ over $\mathfrak{sl}(n,\mathbb{C})$. He proved that the solution space of this system in the space of…

Representation Theory · Mathematics 2020-06-30 Wei Xiao

In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…

Classical Analysis and ODEs · Mathematics 2020-06-17 Armengol Gasull , Hector Giacomini

Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.

Rings and Algebras · Mathematics 2025-04-02 Artem Lopatin , Alexander N. Rybalov

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…

Combinatorics · Mathematics 2024-04-01 Jean-Michel Billiot , Eric Fontenas

We present a short elementary proof of the well-known criterion for a cubic polynomial to have three real roots. The proof is based on Fermat's approach to calculus for polynomials. This approach illustrates the idea of a derivative…

History and Overview · Mathematics 2026-01-08 A. Skopenkov

We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…

Rings and Algebras · Mathematics 2008-10-18 John Michael Nahay