Related papers: Newton maps for quintic polynomials

Given a quadratic two-parameter matrix polynomial in Newton basis $Q_{N} (\lambda ,\mu)$, we construct a vector space of linear two-parameter matrix polynomials and identify a set of linearizations which lie in the vector space. We also…

Let c be a real parameter in the Mandelbrot set, and f_c(z):= z^2 + c. We prove a formula relating the topological entropy of f_c to the Hausdorff dimension of the set of rays landing on the real Julia set, and to the Hausdorff dimension of…

The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…

We study the dynamics of polynomial mappings f:C^k to C^k of degree at least 2 that extend continuously to projective space P^k. Our approach is to study the dynamics near the hyperplane at infinity and then making a descent to K --- the…

A simple geometric way is suggested to derive the Ward identities in the Chern-Simons theory, also known as quantum $A$- and $C$-polynomials for knots. In quasi-classical limit it is closely related to the well publicized augmentation…

A genus one curve C of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We prove a result characterising the covariants for these models in terms of their restrictions to the family of curves…

A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…

This note is a shortened version of my dissertation thesis, defended at Stony Brook University in December 2004. It illustrates how dynamic complexity of a system evolves under deformations. The objects I considered are quartic polynomial…

The study of the topology of polynomial maps originates from classical questions in affine geometry, such as the Jacobian Conjecture, as well as from works of Whitney, Thom, and Mather in the 1950-70s on diffeomorphism types of smooth maps.…

The purpose of this paper is to present a weighted kneading theory for unidimensional maps with holes. We consider extensions of the kneading theory of Milnor and Thurston to expanding discontinuous maps with holes and introduce weights in…

Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is well-constrained (i.e., square), Newton's method is locally quadratically convergent…

We study the Manneville map f(x)=x+x^z (mod 1), with z>1, from a computational point of view, studying the behaviour of the Algorithmic Information Content. In particular, we consider a family of piecewise linear maps that gives examples of…

The monotonicity of entropy is investigated for real quadratic rational maps on the real circle $\mathbb{R}\cup\{\infty\}$ based on the natural partition of the corresponding moduli space $\mathcal{M}_2(\mathbb{R})$ into its monotonic,…

We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…

For functions defined on C^n or (R_+)^n we construct a dequantization transform, which is closely related to the Maslov dequantization. The subdifferential at the origin of a dequantized polynomial coincides with its Newton polytope. For…

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

In this paper we give different compactifications for the domain and the codomain of an affine rational map $f$ which parametrizes a hypersurface. We show that the closure of the image of this map (with possibly some other extra…

Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…