Papers
Topics
Authors
Recent
Search
2000 character limit reached

Isomorphism of relative holomorphs and matrix similarity

Published 16 May 2024 in math.GR | (2405.10147v3)

Abstract: Let VV be a finite-dimensional vector space over the field with pp elements, where pp is a prime number. Given arbitrary α,β∈GL(V)\alpha,\beta\in \mathrm{GL}(V), we consider the semidirect products V⋊⟨α⟩V\rtimes\langle \alpha\rangle and V⋊⟨β⟩V\rtimes\langle \beta\rangle, and show that if V⋊⟨α⟩V\rtimes\langle \alpha\rangle and V⋊⟨β⟩V\rtimes\langle \beta\rangle are isomorphic, then α\alpha must be similar to a power of β\beta that generates the same subgroup as β\beta; that is, if HH and KK are cyclic subgroups of GL(V)\mathrm{GL}(V) such that V⋊H≅V⋊KV\rtimes H\cong V\rtimes K, then HH and KK must be conjugate subgroups of GL(V)\mathrm{GL}(V). If we remove the cyclic condition, there exist examples of non-isomorphic, let alone non-conjugate, subgroups HH and KK of GL(V)\mathrm{GL}(V) such that V⋊H≅V⋊KV\rtimes H\cong V\rtimes K. Even if we require that non-cyclic subgroups HH and KK of GL(V)\mathrm{GL}(V) be abelian, we may still have V⋊H≅V⋊KV\rtimes H\cong V\rtimes K with HH and KK non-conjugate in GL(V)\mathrm{GL}(V), but in this case, HH and KK must at least be isomorphic. If we replace VV by a free module UU over Z/p<sup>m</sup>Z{\mathbf Z}/p<sup>m{\mathbf</sup> Z} of finite rank, with $m&gt;1$, it may happen that U⋊H≅U⋊KU\rtimes H\cong U\rtimes K for non-conjugate cyclic subgroups of GL(U)\mathrm{GL}(U). If we completely abandon our requirements on VV, a sufficient criterion is given for a finite group GG to admit non-conjugate cyclic subgroups HH and KK of Aut(G)\mathrm{Aut}(G) such that G⋊H≅G⋊KG\rtimes H\cong G\rtimes K. This criterion is satisfied by many groups.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.