3
$\begingroup$

Let $M \in H \leq GL(n, \mathbb{Z})$. Is there an algorithm that computes either matrix generators or even a group presentation for $C_H(M)$ given generators or a presentation of $H$? Also is $C_H(M)$ necessarily finitely generated if $H$ is?

I realize that you can view $C_H(M)$ as the set of integer solutions of the equations $MAM^{-1} = A$ where $A \in H$, but I wasn't sure how one can find generators.

Edit: We can assume that $H$ has decidable membership problem. In the context that I am working in, $H$ will be the centralizer of a previous matrix so membership is solvable by the above logic. I also have no idea if anything even exists in the case $H = GL(n, \mathbb{Z})$.

$\endgroup$
2
  • 2
    $\begingroup$ This looks hopeless without some restrictions on $H$. For example, the membership problem in $H$ could be undecidable. $\endgroup$
    – Derek Holt
    Oct 10, 2013 at 17:26
  • $\begingroup$ Derek - I just edited the post in regards to your comment. $\endgroup$
    – user41149
    Oct 10, 2013 at 17:31

1 Answer 1

2
$\begingroup$

In the case of $GL(n, \mathbb{Z})$ itself this is addressed in the answer to this question. As for arbitrary subgroups, in some cases they are finitely generated. For reflection group, there is the paper of Daniel Alcock (Reflection centralizers in Coxeter groups), I doubt anything intelligent can be said in general.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.