Related papers: Cycles of the logistic map

We study bifurcations of cubic homoclinic tangencies in two-dimensional symplectic maps. We distinguish two types of cubic homoclinic tangencies, and each type gives different first return maps derived to diverse conservative cubic H\'enon…

Numerical computations of bifurcation maps for one dimensional maps show patterns (regular jumps in point density) in the zones of chaotic behaviour. In this work, empiric formulas are given for these patterns for an entire class of maps.

Periodic orbit action correlations are studied for the piecewise linear, area-preserving Baker map. Semiclassical periodic orbit formulae together with universal spectral statistics in the corresponding quantum Baker map suggest the…

In the class of nonlinear one-parameter real maps we study those with bifurcation that exhibits period doubling cascade. The fixed points of such a map form a finite discrete real set with dimension (2^n)m, where m is the (odd) number of…

The simplest patterns of qualitative changes on the configurations of lines of principal curvature} around umbilic points on surfaces whose immersions into $\mathbb R^3$ depend smoothly on a real parameter (codimension one umbilic…

We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…

We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…

A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such…

In this paper, we introduce the concept of central periodic points of a linear system as points which lies on orbits starting and ending at the central subgroup of the system. We show that this set is bounded if and only if the central…

Given a natural number $n\geq3$ and two points $a$ and $b$ in the unit disk $\mathbb D$ in the complex plane, it is known that there exists a unique elliptical disk having $a$ and $b$ as foci that can also be realized as the intersection of…

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…

The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…

We introduce three area preserving maps with phase space structures which resemble circle packings. Each mapping is derived from a kicked Hamiltonian system with one of three different phase space geometries (planar, hyperbolic or…

The purpose of this paper is to study weak solutions of a nonlinear Neumann problem considered on a ball. Assuming that the potential is invariant, we consider an orbit of critical points, i.e. we do not assume that critical points are…

This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

In this paper, we study the bifurcation of limit cycles in Lienard systems of the form dot(x)=y-F(x), dot(y)=-x, where F(x) is an odd polynomial that contains, in general, several free parameters. By using a method introduced in a previous…

We apply renormalized entropy as a complexity measure to the logistic and sine-circle maps. In the case of logistic map, renormalized entropy decreases (increases) until the accumulation point (after the accumulation point up to the most…

We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by…

A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path) in an input graph are well known to be NP-complete, and…