Related papers: Generalizing the rotation interval to vertex maps …

This paper states a definition of homotopic rotation set for higher genus surface homeomorphisms, as well as a collection of results that justify this definition. We first prove elementary results: we prove that this rotation set is…

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…

For a non-arithmetic Veech surface, it is known that the set points having finite orbit under the Veech group, called the set of periodic points, is finite. However, few examples of these periodic point sets have been computed. In what…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…

We study a free quantum motion on periodically structured manifolds composed of elementary two-dimensional "cells" connected either by linear segments or through points where the two cells touch. The general theory is illustrated with…

A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…

This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

Identity-homotopic self-homeomorphisms of a space of non-periodic 1-dimensional tiling are generalizations of orientation-preserving self-homeomorphisms of circles. We define the analogue of rotation numbers for such maps. In constrast to…

We give a method to determine relative periodic orbits in point vortex systems: it consists mainly into perform a symplectic reduction on a fixed point submanifold in order to obtain a two-dimensional reduced phase space. The method is…

We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

The notion of a cyclic map g: A -> X is a natural generalization of a Gottlieb element in pi_n(X). We investigate cyclic maps from a rational homotopy theory point of view. We show a number of results for rationalized cyclic maps which…

In [arXiv:1904.12333], we introduced the concept of escaping set in general setting for a topological space and extended the notion of limit set and escaping set for the general semigroup generated by continuous self maps. In this paper we…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…