相关论文: Newton maps for quintic polynomials

We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…

A method is proposed with which the locations of the roots of the monic symbolic quintic polynomial $x^5 + a_4 x^4 + a_3 x^3 + a_2 x^2 + a_1 x + a_0$ can be determined using the roots of two resolvent quadratic polynomials: $q_1(x) = x^2 +…

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.

We use multiplication maps to give a characteristic-free approach to vanishing theorems on toric varieties. Our approach is very elementary but is enough powerful to prove vanishing theorems.

Many machine learning models involve solving optimization problems. Thus, it is important to deal with a large-scale optimization problem in big data applications. Recently, subsampled Newton methods have emerged to attract much attention…

We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

We study diffeomorphisms that have one-parameter families of continuous symmetries. For general maps, in contrast to the symplectic case, existence of a symmetry no longer implies existence of an invariant. Conversely, a map with an…

Newton flows are dynamical systems generated by a continuous, desingularized Newton method for mappings from a Euclidean space to itself. We focus on the special case of meromorphic functions on the complex plane. Inspired by the analogy…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…

We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…

We provide an algorithm to classify the asymptotic sets of the dominant polynomial mappings $F: \C^3 \to \C^3$ of degree 2, using the definition of the so-called "{\it fa\c{c}ons}" in \cite{Thuy}. We obtain a classification theorem for the…

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

Ends and end cohomology are powerful invariants for the study of noncompact spaces. We present a self-contained exposition of the topological theory of ends and prove novel extensions including the existence of an exhaustion of a proper…

Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…

Following [6,12], we study coupled map networks over arbitrary finite graphs. An estimate from below for a topological entropy of a perturbed coupled map network via a topological entropy of an unperturbed network by making use of the…

The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for $C^1$ maps is explored here. Some results known in the polynomial case…

We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…