Related papers: Over-rotation intervals of bimodal interval maps

In ergodic optimization theory, the existence of sub-actions is an important tool in the study of the so-called optimizing measures. For transformations with regularly varying property, we highlight a class of moduli of continuity which is…

The transition from rotational to discontinuous behavior of the return map of the perturbed oscillators-step system, a paradigm model for a perturbation of a pseudo-integrable Hamiltonian impact system, is studied. The form of the return…

Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…

We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex…

We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…

Manifolds occur naturally as configuration spaces of robotic systems. They provide global descriptions of local coordinate systems that are common tools in expressing positions of robots. The purpose of this survey is threefold. Firstly, we…

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…

Given a unipotent bundle of smooth manifolds we construct its secondary transfer map and show that this map determines the higher smooth torsion of the bundle. This approach to higher torsion provides a new perspective on some of its…

We study the navigation problem for a robot moving amidst static and dynamic obstacles and rely on a hierarchical approach to solve it. First, the reference trajectory is planned by the safe interval path planning algorithm that is capable…

For almost all interval exchange maps T_0, with combinatorics of genus g>=2, we construct affine interval exchange maps T which are semi-conjugate to T_0 and have a wandering interval.

We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…

A family of discontinuous symplectic maps on the cylinder is considered. This family arises naturally in the study of nonsmooth Hamiltonian dynamics and in switched Hamiltonian systems. The transformation depends on two parameters and is a…

This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…

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.…

We introduce the notion of abstract angle at a couple of points defined by two radial foliations of the closed annulus. We use this notion to give unified proofs of some classical results on area preserving positive twist maps of the…

The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…

This article is a survey on recent contributions to an effective version of Bautin's theory about the bifurcation of periodic orbits (limit cycles). The analysis of Hopf bifurcations of higher order is possible by use of the return mapping.…

Generalizable manipulation requires that robots be able to interact with novel objects and environment. This requirement makes manipulation extremely challenging as a robot has to reason about complex frictional interaction with uncertainty…

A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note…

Multi-robot transfer learning allows a robot to use data generated by a second, similar robot to improve its own behavior. The potential advantages are reducing the time of training and the unavoidable risks that exist during the training…