Related papers: Cycles of the logistic map
A route to chaos is studied in 3-dimensional maps of logistic type. Mechanisms of period doubling for invariant closed curves (ICC) are found for specific 3-dimensional maps. These bifurcations cannot be observed for ICC in the…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
The phenomenology of a system of two coupled quadratic maps is studied both analytically and numerically. Conditions for synchronization are given and the bifurcations of periodic orbits from this regime are identified. In addition, we show…
We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…
Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…
Previous works have been devoted to the study of two-dimensional noninvertible maps, obtained using a coupling between one-dimensional logistic maps. This paper is devoted to the study of a specific one, in order to complete previous…
The paper proves two theorems concerning the set of periods of periodic orbits for maps of graphs that are homotopic to the constant map and such that the vertices form a periodic orbit. The first result is that if $v$ is not a divisor of…
A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…
If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large as parity by itself permits (all cycles if n is odd, all even…
Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…
Recently patterns were found in the least significant digits in the logistic map orbits in the chaotic regime. However, the dynamic of these digits was not explored in deep. We propose a new interpretation of the patterns found in the least…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
The parameter space $\mathcal{S}_p$ for monic centered cubic polynomial maps with a marked critical point of period $p$ is a smooth affine algebraic curve whose genus increases rapidly with $p$. Each $\mathcal{S}_p$ consists of a compact…
The existence and uniqueness of fixed points of both the cyclic self-mapping and its associate composite self-mappings on each of the subsets are investigated if the subsets in the cyclic disposal are nonempty, bounded and of nonempty…
We study bifurcations of area-preserving maps, both orientable (symplectic) and non-orientable, with quadratic homoclinic tangencies. We consider one and two parameter general unfoldings and establish results related to the appearance of…
We prove that the minimum number of Hamilton cycles in a hamiltonian threshold graph of order $n$ is $2^{\lfloor (n-3)/2\rfloor}$ and this minimum number is attained uniquely by the graph with degree sequence $n-1,n-1,n-2,\ldots,\lceil…
Let $p_n$ be the characteristic polynomial of an $n \times n$ random matrix drawn from one of the compact classical matrix groups. We show that the critical points of $p_n$ converge to the uniform distribution on the unit circle as $n$…
This paper studies a class of $1\frac12$-degree-of-freedom Hamiltonian systems with a slowly varying phase that unfolds a Hamiltonian pitchfork bifurcation. The main result of the paper is that there exists an order of…
Piecewise linear recurrent neural networks (PLRNNs) form the basis of many successful machine learning applications for time series prediction and dynamical systems identification, but rigorous mathematical analysis of their dynamics and…
Motivated by a uniform boundedness conjecture of Morton and Silverman, we study the graphs of pre-periodic points for maps in three families of dynamical systems, namely the collections of rational functions of degree two having a periodic…