English
Related papers

Related papers: Reachability in Injective Piecewise Affine Maps

200 papers

Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two…

Numerical Analysis · Computer Science 2015-10-15 Oleksiy Kurganskyy , Igor Potapov

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…

Computational Complexity · Computer Science 2017-01-18 Hugo Bazille , Olivier Bournez , Walid Gomaa , Amaury Pouly

We study the complexity of the itineraries of injective piecewise contracting maps on the interval. We prove that for any such map the complexity function of any itinerary is eventually affine. We also prove that the growth rate of the…

Dynamical Systems · Mathematics 2017-02-14 Eleneora Catsigeras , Pierre Guiraud , Arnaud Meyroneinc

We study the following reachability problem for piecewise affine maps: Given two vectors $\mathbf{s}, \mathbf{t} \in \mathbb{Q}^d$ and a piecewise affine map $f \colon \mathbb{Q}^d\rightarrow \mathbb{Q}^d$, does there exist $n\in…

Discrete Mathematics · Computer Science 2026-01-27 Anton Varonka , Kazuki Watanabe

We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…

Optimization and Control · Mathematics 2021-03-16 Mohan Dantam , Amaury Pouly

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

Formal Languages and Automata Theory · Computer Science 2013-04-10 Daniel Fremont

We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…

Optimization and Control · Mathematics 2020-11-19 Nathanaël Fijalkow , Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…

Dynamical Systems · Mathematics 2026-04-07 Kleyber Cunha , Marcio Gouveia , Paulo Santana

In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…

Algebraic Topology · Mathematics 2014-01-17 Lukáš Vokřínek

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…

Logic in Computer Science · Computer Science 2011-06-08 Olga Tveretina , Daniel Funke

We study piecewise injective, but not necessarily globally injective, contracting maps on a compact subset of \(\bR^d\). We prove that generically the attractor and the set of discontinuities of such a map are disjoint, and hence the…

Dynamical Systems · Mathematics 2025-04-09 Sakshi Jain , Carlangelo Liverani

We consider reachability decision problems for linear dynamical systems: Given a linear map on $\mathbb{R}^d$ , together with source and target sets, determine whether there is a point in the source set whose orbit, obtained by repeatedly…

Logic in Computer Science · Computer Science 2025-08-15 Toghrul Karimov , Edon Kelmendi , Joël Ouaknine , James Worrell

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

Logic · Mathematics 2026-05-19 Gwangyong Gwon

We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…

Dynamical Systems · Mathematics 2016-09-06 Marco Martens , Charles Tresser

We analyze affine reachability problems in dimensions 1 and 2. We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et…

Computational Complexity · Computer Science 2020-07-03 Stefan Jaax , Stefan Kiefer

By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…

Dynamical Systems · Mathematics 2011-02-10 Bhooshan Rajpathak , Harish K. Pillai , Santanu Bandopadhyay

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

Computational Geometry · Computer Science 2013-02-12 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner

The main result given in Theorem~1.1 is a condition for a map $X$, defined on the complement of a disk $D$ in R^2 with values in R^2, to be extended to a topological embedding of R^2, not necessarily surjective. The map $X$ is supposed to…

Dynamical Systems · Mathematics 2007-05-23 Carlos Gutierrez , Roland Rabanal

In this work, the issue of estimation of reachable sets in continuous bimodal piecewise affine systems is studied. A new method is proposed, in the framework of ellipsoidal bounding, using piecewise quadratic Lyapunov functions. Although…

Systems and Control · Electrical Eng. & Systems 2021-06-15 Thuan Le Quang , Nam Phan Thanh , Simone Baldi

We consider the problem of designing piecewise affine policies for two-stage adjustable robust linear optimization problems under right-hand side uncertainty. It is well known that a piecewise affine policy is optimal although the number of…

Optimization and Control · Mathematics 2018-01-23 Aharon Ben-Tal , Omar El Housni , Vineet Goyal
‹ Prev 1 2 3 10 Next ›