相关论文: On the n-matings of polynomials

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

Douady and Hubbard introduced the operation of mating of polynomials. This identifies two filled Julia sets and the dynamics on them via external rays. In many cases one obtains a rational map. Here the opposite question is tackled. Namely…

A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…

The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…

This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…

Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…

In this article, we show that all admissible rational maps with fixed or period two cluster cycles can be constructed by the mating of polynomials. We also investigate the polynomials which make up the matings that construct these rational…

Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…

We introduce the concept of 2-cyclicity for families of one-dimensional maps with a non-hyperbolic fixed point by analogy to the cyclicity for families of planar vector fields with a weak focus. This new concept is useful in order to study…

We present a natural extension of the notion of nondegenerate rational maps (quadrirational maps) to arbitrary dimensions. We refer to these maps as $2^n-$rational maps. In this note we construct a rich family of $2^n-$rational maps. These…

This work deals with the notion of Newton complementary duality as raised originally in the work of the second author and B. Costa. A conceptual revision of the main steps of the notion is accomplished which then leads to a vast…

We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…

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…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…