Related papers: Over-rotation intervals of bimodal interval maps

We establish geometric criteria to decide whether a contact manifold is overtwisted. Starting with the original definition, we first relate the different overtwisted disks in each dimension and show that a manifold is overtwisted if the…

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…

Multi-robot Motion Planning (MRMP) is an active research field which has gained attention over the years. MRMP has significant roles to improve the efficiency and reliability of multi-robot system in a wide range of applications from…

In the space of orientation-preserving circle maps that are not necessarily surjective nor injective, the rotation number does not vary continuously. Each map where one of these discontinuities occurs is itself discontinuous and we can…

We present a construction of new invariant sets for fibred polynomial dynamics with base an irrational rotation over the unit circle, called multi-curves. Furthermore, the local dynamical theory for attracting invariant curves is extended…

We study dynamics and bifurcations of two-dimensional reversible maps having non-transversal heteroclinic cycles containing symmetric saddle periodic points. We consider one-parameter families of reversible maps unfolding generally the…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

A topological approach and understanding to the detection of unstable periodic orbits based on a recently proposed method (PRL 78, 4733 (1997)) is developed. This approach provides a classification of the set of transformations necessary…

We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

We give some basic properties of strongly topologically transitive, supermixing, and hypermixing maps on general topological spaces. Then we present some other results for which our mappings need to be continuous.

We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…

In this paper we show some remarkable consequences of the method which proves that every bisymmetric, symmetric, reflexive, strictly monotonic binary map on a proper interval is continuous, in particular it is a quasi-arithmetic mean. Now…

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

We develop a method to solve, theoretically and numerically, general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…