English
Related papers

Related papers: The Newton Procedure for several variables

200 papers

Little is known about the global structure of the basins of attraction of Newton's method in two or more complex variables. We make the first steps by focusing on the specific Newton mapping to solve for the common roots of $P(x,y) =…

Dynamical Systems · Mathematics 2007-05-23 Roland K. W. Roeder

Three polynomials are defined for given sets $S$ of $n$ points in general position in the plane: The Voronoi polynomial with coefficients the numbers of vertices of the order-$k$ Voronoi diagrams of $S$, the circle polynomial with…

The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…

Combinatorics · Mathematics 2020-01-07 Frédéric Chapoton , Guo-Niu Han

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

Number Theory · Mathematics 2007-05-23 Jean-Claude Evard

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

Classical Analysis and ODEs · Mathematics 2007-05-23 Geert-Jan Uytdewilligen

In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…

Symbolic Computation · Computer Science 2024-09-11 Weidong Wang , Jing Yang

We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…

General Mathematics · Mathematics 2007-05-23 Gerry Martens

The celebrated and famous Weierstrass approximation theorem characterizes the set of continuous functions on a compact interval via uniform approximation by algebraic polynomials. This theorem is the first significant result in…

Classical Analysis and ODEs · Mathematics 2008-05-07 Dilcia Perez , Yamilet Quintana

We introduce and study the approximation properties of $g$-polynomials, defined as linear combinations of iterated Stieltjes integrals of a constant function. Focusing on the case where the derivator $g$ has finitely many discontinuities,…

Classical Analysis and ODEs · Mathematics 2025-07-08 Víctor Cora , F. Adrián F. Tojo

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

Classical Analysis and ODEs · Mathematics 2025-07-02 José M. González Barrios , Alberto Contreras-Cristán , Patricia I. Romero-Mares

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

Classical Analysis and ODEs · Mathematics 2022-04-12 Reuben Wheeler

We develop an iterative method to calculate the roots of arbitrary polynomials over the field of Puiseux series including non-separable ones. The method works by transforming the polynomial and its roots into a special form and then…

Number Theory · Mathematics 2023-11-14 Ragon Ebker

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…

Algebraic Geometry · Mathematics 2021-01-01 Marco Besier , Dino Festi

We study rings over which an analogue of the Weierstrass preparation theorem holds for power series. We show that a commutative ring $R$ admits a factorization of every power series in $R[[x]]$ as the product of a polynomial and a unit if…

Commutative Algebra · Mathematics 2026-02-10 Jason Bell , Peter Malcolmson , Frank Okoh , Yatin Patel

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

History and Overview · Mathematics 2007-12-17 Pierre-Vincent Koseleff , Daniel Pecker

We investigate the structure of the generalized Weierstrass semigroups at several points on a curve defined over a finite field. We present a description of these semigroups that enables us to deduce properties concerned with the…

Algebraic Geometry · Mathematics 2025-01-17 Julio José Moyano-Fernández , Wanderson Tenório , Fernando Torres

In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…

Complex Variables · Mathematics 2024-03-20 Olga Katkova , Boris Shapiro , Anna Vishnyakova

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

Numerical Analysis · Mathematics 2023-09-18 Anita Buckley , Bor Plestenjak