Related papers: Choosing roots of polynomials smoothly

As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…

Following the classical approach of P\'olya-Schur theory we initiate in this paper the study of linear operators acting on $\mathbb{R}[x]$ and preserving either the set of positive univariate polynomials or similar sets of non-negative and…

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…

In \cite{TY18}, higher genus Gromov--Witten invariants of the stack of $r$-th roots of a smooth projective variety $X$ along a smooth divisor $D$ are shown to be polynomials in $r$. In this paper we study the degrees and coefficients of…

Let $X$ be a normal complex space such that the tangent sheaf $T_X$ is locally free and locally admits a basis consisting of pairwise commuting vector fields. Then $X$ is smooth.

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

In this paper we build the relationship between smoothness of the functions and convergence rate along curves for a class of generalized Schr\"{o}dinger operators with polynomial growth. We show that the convergence rate depends only on the…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

We study polynomial iterative roots of polynomials and describe the locus of complex polynomials of degree 4 admitting a polynomial iterative square root.

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

Let $k$ be a perfect field and let $C_0:f=0$ be a smooth curve in the torus $\mathbb{G}_{m,k}^2$. Let $\mathbb{T}_\Delta$ be the toric variety associated to the Newton polygon of $f$. Extending the toric resolution of $C_0$ on…

Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…

We show that, under reasonable assumptions, two negative roots can be eliminated from the characteristic equation of a polynomial-like iterative equation. This result gives a new case where we may lower the order of such an equation.

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

We introduce an asymmetric operator of generalised translation, define the generalised modulus of smoothness by its means, and obtain the direct and inverse theorems in approximation theory for it.

In this paper we deal with polarizations on a nodal curve $C$ with smooth components. Our aim is to study and characterize a class of polarizations, which we call "good", for which depth one sheaves on $C$ reflect some properties that hold…