Related papers: An Algorithm to compute Rotation Numbers in the ci…
We show that the coding of rotation by $\alpha$ on $m$ intervals with rationally independent lengths can be recoded over $m$ Sturmian words of angle $\alpha.$ More precisely, for a given $m$ an universal automaton is constructed such that…
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…
We give a new formula for the rotation number (or Whitney index) of a smooth closed plane curve. This formula is obtained from the winding numbers associated with the regions and the crossing points of the curve. One difference with the…
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…
In this paper, a method to construct topological template in terms of symbolic dynamics for the diamagnetic Kepler problem is proposed. To confirm the topological template, rotation numbers of invariant manifolds around unstable periodic…
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees,…
We describe a new algorithm for calculating the topological degree deg (f, B, 0) where B \subseteq Rn is a product of closed real intervals and f : B \rightarrow Rn is a real-valued continuous function given in the form of arithmetical…
We prove that return time statistics of a dynamical system do not change if one passes to an induced (i.e. first return) map. We apply this to show exponential return time statistics in i) smooth interval maps with nowhere-dense critical…
We consider methods based on the topological degree theory to compute periodic orbits of area preserving maps. Numerical approximations of the Kronecker integral and the application of Stenger's method allows us to compute the value of the…
We introduce and study the notion of a directional complexity and entropy for maps of degree 1 on the circle. For piecewise affine Markov maps we use symbolic dynamics to relate this complexity to the symbolic complexity. We apply a…
In this paper we describe a new method of calculation of master integrals based on the solution of systems of difference equations in one variable. An explicit example is given, and the generalization to arbitrary diagrams is described. As…
The reciprocal function, 1/x, is important for many real-time algorithms. It is used in a large variety of algorithms from areas ranging from iterative estimation to machine learning. Many of these algorithms are iterative in nature and…
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 spite of being an integral part of bundle adjustment and…
We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps $f_a (x) = a - x^2$. We illustrate the…
We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…
In this work we explain the necessity for consistently labeled rotation maps for efficiently computing coined discrete time quantum walks on regular graphs.
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…
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
We describe all possible bimodal over-twist patterns. In particular, we give an algorithm allowing one to determine what the left endpoint of the over-rotation interval of a given bimodal map is. We then define a new class of polymodal…
Sequence rotation consists of a circular shift of the sequence's elements by a given number of positions. We present the four classic algorithms to rotate a sequence; the loop invariants underlying their correctness; detailed correctness…