On reachability problems for low dimensional matrix semigroups

02/25/2019
by   Thomas Colcombet, et al.
0

We consider the Membership and the Half-space Reachability Problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for fintely generated sub-semigroups of the Heisenberg group over integer numbers. Furthermore, we prove two decidability results for the Half-space reachability problem. Namely, we show that this problem is decidable for sub-semigroups of GL(2,Z) and of the Heisenberg group over rational numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2022

On the Identity Problem for Unitriangular Matrices of Dimension Four

We show that the Identity Problem is decidable in polynomial time for fi...
research
01/30/2019

The Semialgebraic Orbit Problem

The Semialgebraic Orbit Problem is a fundamental reachability question t...
research
02/15/2022

The Membership Problem for Hypergeometric Sequences with Rational Parameters

We investigate the Membership Problem for hypergeometric sequences: give...
research
03/09/2018

Stable and Consistent Membership at Scale with Rapid

We present the design and evaluation of Rapid, a distributed membership ...
research
07/14/2020

The Collatz process embeds a base conversion algorithm

The Collatz process is defined on natural numbers by iterating the map T...
research
02/12/2023

The Identity Problem in ℤ≀ℤ is decidable

We consider semigroup algorithmic problems in the wreath product ℤ≀ℤ. Ou...
research
09/04/2019

On the k-synchronizability of systems

In this paper, we work on the notion of k-synchronizability: a system is...

Please sign up or login with your details

Forgot password? Click here to reset