Related papers: Rotation set for maps of degree 1 on the graph sig…

For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…

For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…

We study the set of periods of degree 1 continuous maps from sigma into itself, where sigma denotes the space shaped like the letter sigma (i.e., a segment attached to a circle by one of its endpoints). Since the maps under consideration…

Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the…

Symplectic mappings are discrete-time analogs of Hamiltonian systems. They appear in many areas of physics, including, for example, accelerators, plasma, and fluids. Integrable mappings, a subclass of symplectic mappings, are equivalent to…

A rotational set is a finite subset $A$ of the unit circle $\mathbb{T}=\mathbb{R}/ \mathbb{Z}$ such that the angle-multiplying map $\sigma_{d}:t\mapsto dt$ maps $A$ onto itself by a cyclic permutation of its elements. Each rotational set…

An annular continuum is a compact connected set $K$ which separates a closed annulus $A$ into exactly two connected components, one containing each boundary component. The topology of such continua can be very intricate (for instance,…

In the space of orientation-preserving circle maps that are not necessarily surjective nor injective, the rotation number does not vary continuously. Each map where one of these discontinuities occurs is itself discontinuous and we can…

We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the…

We study discrete-time random dynamical systems where each fibre map is an orientation-preserving homeomorphism of the circle. We prove that the existence of a random periodic cycle with period at least two implies that the random rotation…

Every simple drawing of a graph in the plane naturally induces a rotation system, but it is easy to exhibit a rotation system that does not arise from a simple drawing in the plane. We extend this to all surfaces: for every fixed surface…

Let $(X,T)$ be a topological dynamical system. Given a continuous vector-valued function $F \in C(X, \mathbb{R}^{d})$ called a potential we define its rotation set $R(F)$ as the set of integrals of $F$ with respect to all $T$-invariant…

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…

For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the…

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…

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

Let $R$ be a noncommutative ring with identity. The commuting graph of $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R \setminus Z(R)$, and two vertices $a$, $b$ are adjacent if $a\neq b$ and $ab=ba$. Let $T=Tr(R)$ be the ring of…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…

A rotation in a Euclidean space V is an orthogonal map on V which acts locally as a plane rotation with some fixed angle. We give a classification of all pairs of rotations in finite-dimensional Euclidean space, up to simultaneous…