Reachability Problems for One-Dimensional Piecewise Affine Maps

Author:

Bournez Olivier1,Kurganskyy Oleksiy2,Potapov Igor3

Affiliation:

1. Ecole Polytechnique, Laboratoire d’Informatique, 91128 Palaiseau Cedex, France

2. Institute of Applied Mathematics and Mechanics, Donetsk, Ukraine

3. University of Liverpool, Ashton Building, Ashton Street, Liverpool, UK

Abstract

Piecewise affine maps (PAMs) are frequently used as a reference model to discuss the frontier between known and open questions about the decidability for reachability questions. In particular, the reachability problem for one-dimensional PAM is still an open problem, even if restricted to only two intervals. As the main contribution of this paper we introduce new techniques for solving reachability problems based on [Formula: see text]-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 construct an example where the distribution properties of well studied sequences can be significantly disrupted by taking fractional parts after regular shifts. The study of such sequences could help with understanding similar sequences generated in PAMs or in well known Mahler’s [Formula: see text] problem.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Reachability in Injective Piecewise Affine Maps;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Reachability problems in low-dimensional nondeterministic polynomial maps over integers;Information and Computation;2021-12

3. On the decidability of reachability in continuous time linear time-invariant systems;Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control;2021-05-19

4. Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds;Lecture Notes in Computer Science;2019

5. Reachability Problem for Polynomial Iteration Is PSPACE-complete;Lecture Notes in Computer Science;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3