The Identity Problem in the special affine group of
arXiv:2301.09502 · doi:10.46298/lmcs-21(2:21)2025
Abstract
We consider semigroup algorithmic problems in the Special Affine group , which is the group of affine transformations of the lattice that preserve orientation. Our paper focuses on two decision problems introduced by Choffrut and Karhumäki (2005): the Identity Problem (does a semigroup contain a neutral element?) and the Group Problem (is a semigroup a group?) for finitely generated sub-semigroups of . We show that both problems are decidable and NP-complete. Since , our result extends that of Bell, Hirvensalo and Potapov (2017) on the NP-completeness of both problems in , and contributes a first step towards the open problems in .