Related papers: Over-rotation intervals of bimodal interval maps
The orientation of a rigid object can be described by a rotation that transforms it into a standard position. For a symmetrical object the rotation is known only up to multiplication by an element of the symmetry group. Such ambiguous…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…
Iterations of odd piecewise continuous maps with two discontinuities, i.e., symmetric discontinuous bimodal maps, are studied. Symbolic dynamics is introduced. The tools of kneading theory are used to study the homology of the discrete…
If a map has k transitivity classes of vertices that are subject to the action of the automorphism group, it is said to be k-uniform. The classification of 1-uniform maps on the torus is known. In this article, we classify 2-uniform maps on…
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…
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 give a unified proof of the existence of turbulence for some classes of continuous interval maps which include, among other things, maps with periodic points of odd periods > 1, some maps with dense chain recurrent points and densely…
We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…
We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of…
Irrational numbers of bounded type have several equivalent characterizations. They have bounded partial quotients in terms of arithmetic characterization and in the dynamics of the circle rotation, the rescaled recurrence time to $r$-ball…
We studied topological and metric properties of the so-called interval translation maps (ITMs). For these maps, we introduced the maximal invariant measure and study its properties. Further, we study how the invariant measures depend on the…
We study the optimization of ergodic averages for multi-valued dynamical systems, i.e. where points may have multiple different forward orbits. Under upper semi-continuity assumptions, we show that the maximum space average with respect to…
We generate all the finite kneading sequences of one of the two kinds of bimodal map on the interval, building each sequence uniquely from a pair of shorter ones. There is a single pair at generation 0, with members of length 1. Concomitant…
A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed $v \ge 1$, there is a polynomial-time algorithm for deciding whether a…
A cornerstone of geometric reconstruction, rotation averaging seeks the set of absolute rotations that optimally explains a set of measured relative orientations between them. In addition to being an integral part of bundle adjustment and…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
A novel MIMO homogeneous Super-Twisting Algorithm is proposed in this paper for nonlinear systems with relative degree one, having a time and state-varying uncertain control matrix. The uncertainty is represented by a constant but unknown…
Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in…