Permutation-like Matrix Groups with a Maximal Cycle of Length Power of Two
Abstract: If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the maximal cycle generates a normal subgroup and the length of the maximal cycle equals to a prime, or a square of a prime, or a power of an odd prime, then the permutation-like matrix group is similar to a permutation matrix group. In this paper, we prove that if a permutation-like matrix group contains a maximal cycle such that the maximal cycle generates a normal subgroup and the length of the maximal cycle equals to any power of 2, then it is similar to a permutation matrix group.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.