scholarly journals A combinatorial classification of postcritically fixed Newton maps

2018 ◽  
Vol 39 (11) ◽  
pp. 2983-3014
Author(s):  
KOSTIANTYN DRACH ◽  
YAUHEN MIKULICH ◽  
JOHANNES RÜCKERT ◽  
DIERK SCHLEICHER
Keyword(s):  
Fixed Point ◽  
Dynamical Systems ◽  
Finite Chain ◽  
Connected Component ◽  
Postcritically Finite ◽  
Combinatorial Classification ◽  
Attracting Fixed Point

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 ingredient is the proof that for every Newton map (postcritically finite or not) every connected component of the basin of an attracting fixed point can be connected to$\infty$through a finite chain of such components.

scholarly journals SPECIAL CURVES AND POSTCRITICALLY FINITE POLYNOMIALS

2013 ◽  
Vol 1 ◽  
Author(s):  
MATTHEW BAKER ◽  
LAURA DE MARCO
Keyword(s):  
Fixed Point ◽  
Dynamical Systems ◽  
Moduli Space ◽  
Dense Subset ◽  
Rational Curves ◽  
Rational Maps ◽  
Complex Polynomial ◽  
Polynomial Dynamical Systems ◽  
Postcritically Finite ◽  
Cubic Polynomials

AbstractWe study the postcritically finite maps within the moduli space of complex polynomial dynamical systems. We characterize rational curves in the moduli space containing an infinite number of postcritically finite maps, in terms of critical orbit relations, in two settings: (1) rational curves that are polynomially parameterized; and (2) cubic polynomials defined by a given fixed point multiplier. We offer a conjecture on the general form of algebraic subvarieties in the moduli space of rational maps on ${ \mathbb{P} }^{1} $ containing a Zariski-dense subset of postcritically finite maps.

scholarly journals Repelling invariant curves in planar discrete dynamical systems

1994 ◽  
Vol 49 (3) ◽  
pp. 469-481 ◽  
Author(s):  
Francisco Esquembre
Keyword(s):  
Dynamical System ◽  
Fixed Point ◽  
Dynamical Systems ◽  
Numerical Algorithm ◽  
Continuous Dependence ◽  
Discrete Dynamical System ◽  
Discrete Dynamical Systems ◽  
Invariant Curves ◽  
Dynamical Properties ◽  
Attracting Fixed Point

Constructive, simple proofs for the existence, regularity, continuous dependence and dynamical properties of a repelling invariant curve for a discrete dynamical system of the plane with an attracting fixed point with real eigenvalues are given. These proofs can be used to generate a numerical algorithm to find these curves and to compute explicitly the dependence of the curve with respect to the system.

Attracting invariant curves in planar discrete dynamical systems

1995 ◽  
Vol 51 (2) ◽  
pp. 273-286
Author(s):  
Francisco Esquembre
Keyword(s):  
Dynamical System ◽  
Fixed Point ◽  
Dynamical Systems ◽  
Dynamic Behaviour ◽  
Discrete Dynamical System ◽  
Discrete Dynamical Systems ◽  
Invariant Curves ◽  
Attracting Fixed Point

We study the properties of an invariant attracting curve passing through an attracting fixed point of a planar discrete dynamical system. We compare these properties to the corresponding properties of the invariant repelling curve studied in [3] in order to determine the dynamic behaviour of the system near the fixed point.

scholarly journals Isomorphy classes of k-involutions of G2

2014 ◽  
Vol 13 (07) ◽  
pp. 1450039 ◽  
Author(s):  
John Hutchens
Keyword(s):  
Fixed Point ◽  
Symmetric Spaces ◽  
Point Group ◽  
Algebraic Groups ◽  
Type A ◽  
Rational Points ◽  
Combinatorial Classification ◽  
Generalized Symmetric Spaces ◽  
Appl Math

Isomorphy classes of k-involutions have been studied for their correspondence with symmetric k-varieties, also called generalized symmetric spaces. A symmetric k-variety of a k-group G is defined as Gk/Hk where θ : G → G is an automorphism of order 2 that is defined over k and Gk and Hk are the k-rational points of G and H = Gθ, the fixed point group of θ, respectively. This is a continuation of papers written by A. G. Helminck and collaborators [Involutions of SL (2, k), (n > 2), Acta Appl. Math.90(1–2) (2006) 91–119, Classification of involutions of SO (n; k; b), to appear, On the classification of k-involutions, Adv. Math.153(1) (1988) 1–117, Classification of involutions of SL (2, k), Comm. Algebra30(1) (2002) 193–203] expanding on his combinatorial classification over certain fields. Results have been achieved for groups of type A, B and D. Here we begin a series of papers doing the same for algebraic groups of exceptional type.

Three Types of Chaotic Attractors in 3 D Maps

1993 ◽  
Vol 48 (5-6) ◽  
pp. 666-668 ◽  
Author(s):  
Michael Klein ◽  
Achim Kittel ◽  
Gerold Baier
Keyword(s):  
Fixed Point ◽  
Dynamical Systems ◽  
Three Dimensions ◽  
Chaotic Attractors ◽  
Stable Fixed Point ◽  
Fractal Structures ◽  
One Dimensional ◽  
Different Types

Abstract Coupling a one-dimensional chaotic forcing to a stable fixed point in the plane may generate different fractal attractors embedded in three dimensions. The system with real eigenvalues of the fixed point gives rise to simple chaotic attractors with three different types of fractal structures. We show that the competition of local exponents provides a generic criterion for the classification of the fractal structures in dynamical systems.

scholarly journals Multiplicity-Free Schubert Calculus

2010 ◽  
Vol 53 (1) ◽  
pp. 171-186 ◽  
Author(s):  
Hugh Thomas ◽  
Alexander Yong
Keyword(s):  
Algebraic Geometry ◽  
Schubert Calculus ◽  
Chow Ring ◽  
Free Products ◽  
Linear Basis ◽  
Combinatorial Classification ◽  
Schubert Classes ◽  
Multiplicity Free

AbstractMultiplicity-free algebraic geometry is the study of subvarieties Y ⊆ X with the “smallest invariants” as witnessed by a multiplicity-free Chow ring decomposition of [Y] ∈ A*(X) into a predetermined linear basis.This paper concerns the case of Richardson subvarieties of the Grassmannian in terms of the Schubert basis. We give a nonrecursive combinatorial classification of multiplicity-free Richardson varieties, i.e., we classify multiplicity-free products of Schubert classes. This answers a question of W. Fulton.

scholarly journals Parabolic limits of renormalization

2000 ◽  
Vol 20 (1) ◽  
pp. 173-229 ◽  
Author(s):  
BENJAMIN HINKLE
Keyword(s):  
Fixed Point ◽  
Period Doubling ◽  
Unit Interval ◽  
Local Analysis ◽  
Unimodal Maps ◽  
Unimodal Map ◽  
Combinatorial Description ◽  
Combinatorial Rigidity

A unimodal map $f:[0,1] \to [0,1]$ is renormalizable if there is a sub-interval $I \subset [0,1]$ and an $n > 1$ such that $f^n|_I$ is unimodal. The renormalization of $f$ is $f^n|_I$ rescaled to the unit interval.We extend the well-known classification of limits of renormalization of unimodal maps with bounded combinatorics to a classification of the limits of renormalization of unimodal maps with essentially bounded combinatorics. Together with results of Lyubich on the limits of renormalization with essentially unbounded combinatorics, this completes the combinatorial description of limits of renormalization. The techniques are based on the towers of McMullen and on the local analysis around perturbed parabolic points. We define a parabolic tower to be a sequence of unimodal maps related by renormalization or parabolic renormalization. We state and prove the combinatorial rigidity of bi-infinite parabolic towers with complex bounds and essentially bounded combinatorics, which implies the main theorem.As an example we construct a natural unbounded analogue of the period-doubling fixed point of renormalization, called the essentially period-tripling fixed point.

Sign in / Sign up

Export Citation Format

Share Document