Related papers: Choosing roots of polynomials smoothly
We prove that the roots of a definable $C^\infty$ curve of monic hyperbolic polynomials admit a definable $C^\infty$ parameterization, where `definable' refers to any fixed o-minimal structure on $(\mathbb R,+,\cdot)$. Moreover, we provide…
The Witt group of a smooth curve over a real closed field is explicitely calculated. The method uses a comparison theorem between the graded Witt group and the etale cohomology groups. In the second part of the paper, the torsion Picard…
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
We give a survey of the analytic theory of matrix orthogonal polynomials.
A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
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.
In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
Using log geometry, we study smoothability of genus zero twisted stable maps to stacky curves relative to a collection of marked points. One application is to smoothing semi-log canonical fibered surfaces with marked singular fibers.
Splints of root system of simple lie algebras appears naturally on studies of embedding of reductive subalgebras. A splint can be used to construct a branching rules as implementation of this idea simplifies calculation of branching…
The aim of this paper is to investigate the sufficient condition for the invariance of a normal curve on a smooth immersed surface under isometry. We also find the the deviations of the tangential and normal components of the curve with…
Some properties and relations satisfied by the polynomial solutions of the bispectral problem are studied. Given a differential operator, under certain restrictions its polynomial eigenfunctions are explicitly obtained, as well as the…