Reachability problems for PAMs
From MaRDI portal
Abstract: 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 intervals. As the main contribution of this paper we introduce new techniques for solving reachability problems based on p-adic norms and weights as well as showing decidability for two classes of maps. Then we show the connections between topological properties for PAM's orbits, reachability problems and representation of numbers in a rational base system. Finally we show a particular instance where the uniform distribution of the original orbit may not remain uniform or even dense after making regular shifts and taking a fractional part in that sequence.
Recommendations
- Reachability problems for one-dimensional piecewise affine maps
- On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
- Computation in One-Dimensional Piecewise Maps
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Reachability problems in nondeterministic polynomial maps on the integers
Cited in
(6)- Reachability problems in low-dimensional nondeterministic polynomial maps over integers
- The invariance problem for matrix semigroups
- Reachability problems for one-dimensional piecewise affine maps
- Computation in One-Dimensional Piecewise Maps
- On reachability problem in 1-dimensional 2-interval piecewise-affine mappings
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Reachability problems for PAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794376)