Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
Volker Diekert, Igor Potapov, and Pavel Semukhin

TL;DR
This paper investigates the decidability of membership problems for flat rational subsets of the semigroup of 2x2 matrices over rationals, providing new results for specific subsemigroups and matrix types, including a doubly exponential time algorithm for singular matrices.
Contribution
It establishes decidability results for flat rational subset membership in certain matrix semigroups, including Boolean algebra structures and specific matrix classes, advancing understanding of these problems.
Findings
Decidability of membership in Boolean combinations of flat rational subsets of GL(2,Q)
Decidability of membership for flat rational subsets of singular matrices in doubly exponential time
Characterization of groups G between GL(2,Z) and GL(2,Q) related to membership problems
Abstract
We consider membership problems for rational subsets of the semigroup of matrices over . For a semigroup , the rational subsets are defined as the sets accepted by NFAs whose transitions are labeled by elements of . In general, it is undecidable on inputs and whether belongs to . Therefore, we restrict our attention to the family of flat rational subsets of over , where is a subsemigroup of . It consists of finite unions of the form , where and . Assuming that the membership for is decidable, we prove various results when the membership for is decidable. If is a subgroup of a group , then we provide a rather general condition when is an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Geometric and Algebraic Topology · Finite Group Theory Research
