Related papers: Reachability in Injective Piecewise Affine Maps
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
For a definable continuous mapping $f$ from a definable connected open subset $\Omega$ of $\mathbb R^n$ into $\mathbb R^n,$ we show that the following statements are equivalent: (i) The mapping $f$ is open. (ii) The fibers of $f$ are finite…
We construct hierarchies of integrable systems invariant under the two-dimensional Darboux-Toda mapping for noncommuting objects, thus generalizing to the noncommutative case the integrable mapping approach to nonlinear dynamical systems.…
Piecewise smooth maps are known to exhibit a wide range of dynamical features including numerous types of periodic orbits. Predicting regions in parameter space where such periodic orbits might occur and determining their stability is…
In this paper we introduce a new network reachability problem where the goal is to find the most reliable path between two nodes in a network, represented as a directed acyclic graph. Individual edges within this network may fail according…
The problem of deciding, given a complex variety X, a point x in X, and a subvariety Z of X, whether there is an automorphism of X mapping x into Z is proved undecidable. Along the way, we prove the undecidability of a version of Hilbert's…
We consider the dynamics of `nonlinear tent maps': piecewise smooth unimodal maps with nowhere vanishing derivative. We show that if a nonlinear tent map $f$ is not infinitely renormalizable, then all its periodic orbits of sufficiently…
In this paper we consider a one dimensional liner piecewise-smooth discontinuous map. It is well known that stable periodic orbits exist in this type of map for a specific parameter region. It is also known that the corresponding…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming…
Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…
We study a class of chainable continua which contains, among others, all inverse limit spaces generated by a single interval bonding map which is piecewise monotone and locally eventually onto. Such spaces are realized as attractors of…
This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…
Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…
We discuss various questions of the following kind: for a continuous map $X \to Y$ from a compact metric space to a simplicial complex, can one guarantee the existence of a fiber large in the sense of Urysohn width? The $d$-width measures…
We consider the attractor $\Lambda$ of a piecewise contracting map $f$ defined on a compact interval. If $f$ is injective, we show that it is possible to estimate the topological entropy of $f$ (according to Bowen's formula) and the…
Here we consider piecewise fractional linear maps with three branches. The paper presents a study of invariant measures with densities which can be written as infinite series. These series either have infinitely many poles or they sum up to…
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…
In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…
We propose a method to outer bound forward reachable sets on finite horizons for uncertain nonlinear systems with polynomial dynamics. This method makes use of time-dependent polynomial storage functions that satisfy appropriate dissipation…