On the Identity Problem for Unitriangular Matrices of Dimension Four
arXiv:2202.05225
Abstract
We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group of unitriangular integer matrices. As a byproduct of our proof, we also show the polynomial-time decidability of several subset reachability problems in .
arXiv comment28 pages, 2 figures