Related papers: Orbit Portraits in non-Autonomous Iteration
We prove a special case of a dynamical analogue of the classical Mordell-Lang conjecture. In particular, let $\phi$ be a rational function with no superattracting periodic points other than exceptional points. If the coefficients of $\phi$…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
Bifurcation analysis collects techniques for characterizing the dependence of certain classes of solutions of a dynamical system on variations in problem parameters. Common solution classes of interest include equilibria and periodic…
We establish a deterministic technique to investigate transport moments of arbitrary order. The theory is applied to the analysis of different kinds of intermittent one-dimensional maps and the Lorentz gas with infinite horizon: the typical…
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
Recently, concepts from the emerging field of tropical geometry have been used to identify different scaling regimes in chemical reaction networks where dimension reduction may take place. In this paper, we try to formalize these ideas…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We present a combinatorial approach to rigorously show the existence of fixed points, periodic orbits, and symbolic dynamics in discrete-time dynamical systems, as well as to find numerical approximations of such objects. Our approach…
We investigate global continuation of periodic orbits of a differential equation depending on a parameter, assuming that a closed 1-form satisfying certain properties exists. We begin by extending the global continuation theory of…
The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…
We treat the problem of characterizing in a systematic way the qualitative features of two-dimensional dynamical systems. To that end, we construct a representation of the topological features of phase portraits by means of diagrams that…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We correspond to any factor algebra of the unitriangular Lie algebra with respect to a regular ideal some permutation. In terms of this permutation one can construct a diagram, that allows to calculate index and maximal dimension of…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…