Related papers: Periodic orbits on 2-regular circulant digraphs

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…

We study periodic orbits for area-preserving surface diffeomorphisms, particularly some global properities related to the action function and rotation numbers. We generalize recent works of Machel Hutchings [4], proving the existence of…

For Hamiltonian flows we establish the existence of periodic orbits on a sequence of level sets approaching a Bott-nondegenerate symplectic extremum of the Hamiltonian. As a consequence, we show that a charge on a compact manifold with a…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

We study the combinatorial types of periodic orbits of the standard covering endomorphisms ${\mathbf m}_k(x)=k x \ (\text{mod} \ {\mathbb Z})$ of the circle for integers $k \geq 2$ and the frequency with which they occur. For any $q$-cycle…

We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…

A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…

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…

The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the…

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

The aim of this paper is to numerically investigate the orbital dynamics of the circular planar restricted problem of five bodies. By numerically integrating several large sets of initial conditions of orbits we classify them into three…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

We characterize the sequences of fixed point indices $\{i(f^n, p)\}_{n\ge 1}$ of fixed points that are isolated as an invariant set and continuous maps in the plane. In particular, we prove that the sequence is periodic and $i(f^n, p) \le…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

A less studied numerical characteristic of periodic orbits of area preserving twist maps of the annulus is the twist or torsion number, called initially the amount of rotation. It measures the average rotation of tangent vectors under the…

We measure elastomechanical spectra for a family of thin shells. We show that these spectra can be described by a "semiclassical" trace formula comprising periodic orbits on geodesics, with the periods of these orbits consistent with those…

As the parameters of a piecewise-smooth system of ODEs are varied, a periodic orbit undergoes a bifurcation when it collides with a surface where the system is discontinuous. Under certain conditions this is a grazing-sliding bifurcation.…