Related papers: Over-rotation intervals of bimodal interval maps
The class of stochastic maps, that is, linear, trace-preserving, positive maps between the self-adjoint trace class operators of complex separable Hilbert spaces plays an important role in the representation of reversible dynamics and…
We prove that multimodal maps with an absolutely continuous invariant measure have exponential return time statistics around a.e. point. We also show a `polynomial Gibbs property' for these systems, and that the convergence to the entropy…
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…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We show that the use of the main characteristics of the circle map leads naturally to establish a few statements on primes and pseudoprimes. In this way a Fermat's theorem on primes and some interesting properties of pseudoprimes are…
Area-preserving nontwist maps are used to describe a broad range of physical systems. In those systems, the violation of the twist condition leads to nontwist characteristic phenomena, such as reconnection-collision sequences and shearless…
This paper proposes a Lyapunov approach to the design of a multivariable generalized Super-Twisting algorithm (MGSTA), which is able to control a system with perturbations and uncertain control matrix, both depending on time and the system…
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
The goal of inversion is to estimate the model which generates the data of observations with a specific modeling equation. One general approach to inversion is to use optimization methods which are algebraic in nature to define an objective…
The behavior of certain weighted Hardy-type operators on rearrangement-invariant function spaces is thoroughly studied with emphasis being put on the optimality of the obtained results. First, the optimal rearrangement-invariant function…
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been extensively studied, due to both its interesting structure…
Centipede-like robots offer an effective and robust solution to navigation over complex terrain with minimal sensing. However, when climbing over obstacles, such multi-legged robots often elevate their center-of-mass into unstable…
We show the equivalence of two possible definitions of a rotational interval exchange transformation: by the first one, it is a first return map for a circle rotation onto a union of finite number of circle arcs, and by the second one, it…
We present an algorithm for finding all time-reversible systems within a given family of 2-dim systems of ODE's whose right-hand sides are polynomials. We also study an interconnection of time-reversibility and invariants of a subgroup of…
Robots often have to deal with the challenges of operating in dynamic and sometimes unpredictable environments. Although an occupancy map of the environment is sufficient for navigation of a mobile robot or manipulation tasks with a robotic…
Urban mobility increasingly relies on multimodality, combining the use of bicycle paths, streets, and rail networks. These different modes of transportation are well described by multiplex networks. Here we propose the overlap census method…
We provide a way to infer about existence of topological circularity in high-dimensional data sets in $\mathbb{R}^d$ from its projection in $\mathbb{R}^2$ obtained through a fast manifold learning map as a function of the high-dimensional…