Related papers: Splitting Circle Overview

We clarify the question whether for a smooth curve of polynomials one can choose the roots smoothly and related questions. Applications to perturbation theory of operators are given.

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

We prove some new results about the spacing between neighboring zeros of paraorthogonal polynomials on the unit circle. Our methods also provide new proofs of some existing results. The main tool we will use is a formula for the phase of…

This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a triangular system of polynomials within a given polybox in $\mathbb{C}^n$, for any given $\epsilon>0$. Our algorithm is based on a…

This paper describes a geometrical method for finding the roots $r_1$, $r_2$ of a quadratic equation in one complex variable of the form $x^2+c_1 x+c_2=0$, by means of a Line $L$ and a Circumference $C$ in the complex plane, constructed…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

We present new, explicit, volume-preserving vector fields for polynomial divergence-free vector fields of arbitrary degree (both positive and negative). The main idea is to decompose the divergence polynomial by means of an appropriate…

Considering discrete models, the univariate framework has been studied in depth compared to the multivariate one. This paper first proposes two criteria to define a sensu stricto multivariate discrete distribution. It then introduces the…

In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

Let $F(z)$ be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural $\varepsilon$-clusters of roots of $F(z)$ in some box region $B_0$ in the complex plane. This may be viewed as an…

Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…

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…

We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…