On the Identity Problem and the Group Problem in nilpotent groups

08/03/2022
by   Ruiwen Dong, et al.
0

Let 𝒢 be a finite set of matrices in a unipotent matrix group G over ℚ, where G has nilpotency class at most ten. We exhibit a polynomial time algorithm that computes the subset of 𝒢 which generates the group of units of the semigroup ⟨𝒢⟩ generated by 𝒢. In particular, this result shows that the Identity Problem (does ⟨𝒢⟩ contain the identity matrix?) and the Group Problem (is ⟨𝒢⟩ a group?) are decidable in polynomial time for unipotent matrix group of class at most ten. This extends the earlier work by Babai, Beals, Cai, Ivanyos and Luks on commutative matrix groups to nilpotent matrix groups. An important implication of our result is the decidability of the Identity Problem and the Group Problem within finitely generated nilpotent groups of class at most ten. Our main idea is to analyze the logarithm of the matrices appearing in ⟨𝒢⟩. This allows us to employ Lie algebra methods to study this semigroup. In particular, we prove several new properties of the Baker-Campbell-Hausdorff formula, which help us characterize the convex cone spanned by the elements in log⟨𝒢⟩. Furthermore, we formulate a sufficient condition in order for our results to generalize to unipotent matrix groups of class d > 10. For every such d, we exhibit an effective procedure that verifies this sufficient condition in case it is true.

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
01/09/2023

Quantifying the structural stability of simplicial homology

The homology groups of a simplicial complex reveal fundamental propertie...
research
11/03/2020

On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups

Given a point A in the convex hull of a given adjoint orbit 𝒪(F) of a co...
research
05/10/2021

Tiling of Constellations

Motivated by applications in reliable and secure communication, we addre...
research
06/22/2023

Breaking the cubic barrier in the Solovay-Kitaev algorithm

We improve the Solovay-Kitaev theorem and algorithm for a general finite...
research
02/19/2023

iPCA and stability of star quivers

Integrated principal components analysis, or iPCA, is an unsupervised le...
research
03/07/2022

On the Conjugacy Search Problem in Extraspecial p-Groups

In the recently emerging field of group-based cryptography, the Conjugac...

Please sign up or login with your details

Forgot password? Click here to reset