On the Identity Problem for Unitriangular Matrices of Dimension Four

02/10/2022
by   Ruiwen Dong, et al.
0

We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group 𝖴𝖳(4, ℤ) of 4 × 4 unitriangular integer matrices. As a byproduct of our proof, we also show the polynomial-time decidability of several subset reachability problems in 𝖴𝖳(4, ℤ).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2023

On the Identity and Group Problems for Complex Heisenberg Matrices

We study the Identity Problem, the problem of determining if a finitely ...
research
02/25/2019

On reachability problems for low dimensional matrix semigroups

We consider the Membership and the Half-space Reachability Problems for ...
research
06/16/2020

Quantitative Group Testing and the rank of random matrices

Given a random Bernoulli matrix A∈{0,1}^m× n, an integer 0< k < n and th...
research
10/04/2017

Some facts on Permanents in Finite Characteristics

In the present article we essentially extend the result for the permanen...
research
11/24/2012

Modeling problems of identity in Little Red Riding Hood

This paper argues that the problem of identity is a critical challenge i...
research
10/01/2017

The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

In this paper, we will show that the width of simplices defined by syste...

Please sign up or login with your details

Forgot password? Click here to reset