Related papers: Complexity of injective piecewise contracting inte…

We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…

The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

For a function from the unit interval to itself with constant slope and one discontinuity, the itineraries of the point of discontinuity are called the critical itineraries. These critical itineraries play a significant role in the study of…

We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…

Reachability for piecewise affine systems is known to be undecidable, starting from dimension $2$. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine…

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…

Consider the two-parameter family of real analytic maps $F_{a,b}:x \mapsto x+ a+{b\over 2\pi} \sin(2\pi x)$ which are lifts of degree one endomorphisms of the circle. The purpose of this paper is to provide a proof that for any closed…

This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…

Let $\phi_1,\ldots,\phi_n:[0,1]\to (0,1)$ be Lipschitz contractions. Let $I=[0,1)$, $x_0=0$ and $x_n=1$. We prove that for Lebesgue almost every $(x_1,...,x_{n-1})$ satisfying $0<x_1<\cdots <x_{n-1}<1$, the piecewise contraction $f:I\to I$…

We prove that affine maps are uniquely extremal quasiconformal maps on the complement of a well distribute set in the complex plane answering a conjecture from \cite{markovic}. We construct the required Reich sequence using Bergman…

We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.

We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…

Let $f : [0,1)\rightarrow [0,1)$ be a $2$-interval piecewise affine increasing map which is injective but not surjective. Such a map $f$ has a rotation number and can be parametrized by three real numbers. We make fully explicit the…

We study the complexity of S-adic sequences corresponding to a family of 216 multi-dimensional continued fractions maps, called Triangle Partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main…

We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…

Many mathematicians encounter k-to-1 maps only in the study of covering maps. But, of course, k-to-1 maps do not have to be open. This paper touches on covering maps, and simple maps, but concentrates on ordinary k-to-1 functions (both…

Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models only deal with fitting continuous functions. In this paper, we investigate the problem of fitting a…

The constrained linear quadratic regulation problem is solved by a continuous piecewise affine function on a set of state space polytopes. It is an obvious question whether this solution can be built up iteratively by increasing the…