Forum Problem Lists Definitions FAQ

12.50 (1992)

Open

(Well-known problem). Find an algorithm which decides, by a given finite set of matrices in $SL_3(\mathbb{Z})$, whether the first matrix of this set is contained in the subgroup generated by the remaining matrices. An analogous problem for $SL_4(\mathbb{Z})$ is insoluble since a direct product of two free groups of rank 2 embeds into $SL_4(\mathbb{Z})$.

Contributor: G. S. Makanin

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.