Related papers: Combinatorial models of expanding dynamical system…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
Many natural systems are organized as networks, in which the nodes interact in a time-dependent fashion. The object of our study is to relate connectivity to the temporal behavior of a network in which the nodes are (real or complex)…
We employ projective Fra\"iss\'e theory to define the "generic combinatorial $n$-simplex" as the pro-finite, simplicial complex that is canonically associated with a family of simply defined selection maps between finite triangulations of…
We show that under the definition of computability which is natural from the point of view of applications, there exist non-computable quadratic Julia sets.
In this work we discuss the natural appearance of the Generalized Brackets in systems with non-involutive (equivalent to second class) constraints in the Hamilton-Jacobi formalism. We show how a consistent geometric interpretation of the…
We provide an explicit method to construct dynamical systems which admit an a-priori prescribed attracting set. As application, we provide a method to construct perturbations of conservative dynamical systems, which admit an a-priori…
In holomorphic semigroup dynamics, Julia set is in general backward invariant and so some fundamental results of classical complex dynamics can not be generalized to semigroup dynamics. In this paper, we define completely invariant Julia…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
Inspired by the work of Pujals and Sambarino on dominated splitting, we present billiards with a modified reflection law which constitute simple examples of dynamical systems with limit sets with dominated splitting and where the dynamics…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
Julia and Mandelbrot sets, which characterize bounded orbits in dynamical systems over the complex numbers, are classic examples of fractal sets. We investigate the analogs of these sets for dynamical systems over the hyperbolic numbers.…
If M is a Drinfeld module over a local function field L, we may view M as a dynamical system, and consider its filled Julia set J. If J^0 is the connected component of the identity, relative to the Berkovich topology, we give a…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
In this article, we generalize the theory of discrete Lagrangian mechanics and variational integrators in two principal directions. First, we show that Lagrangian submanifolds of symplectic groupoids give rise to discrete dynamical systems,…
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…
We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…
We give an example of two rational functions with non-equal Julia sets that generate a rational semigroup whose completely invariant Julia set is a closed line segment. We also give an example of polynomials with unequal Julia sets that…
The global approach to control systems which we have been pursuing in other work favours the study of dynamics achievable through control. It employs certain globally defined geometric objects and attempts to describe them in the general…