Permutation-like matrix groups
From MaRDI portal
Let \(\mathcal{G}\subset \mathbb{C}^{n\times n}\) be a finite group of matrices. If every \(X\in\mathcal{G}\) is similar to a permutation matrix, then \(\mathcal{G}\) is called a permutation-like group. The author investigates if a permutation-like group is equivalent to a group of permutation matrices. He finds counterexamples, but he has an affirmative answer under certain conditions, in particular for \(n=3\) and \(5\).
Recommendations
- Permutation-like matrix groups with a maximal cycle of prime square length
- Permutation-like matrix groups with a maximal cycle of 8 dimensions
- Permutation-like matrix groups with a maximal cycle of power of odd prime length
- Permutation-like matrix groups with a maximal cycle of length power of two
- From local to global similarity of matrix groups
Cites work
Cited in
(10)- Constructing permutation representations for matrix groups
- Permutation-like matrix groups with a maximal cycle of length power of two
- Permutation-like matrix groups with a maximal cycle of power of odd prime length
- Permutation-like matrix groups with a maximal cycle of prime square length
- scientific article; zbMATH DE number 3884358 (Why is no real title available?)
- scientific article; zbMATH DE number 38066 (Why is no real title available?)
- scientific article; zbMATH DE number 125616 (Why is no real title available?)
- Permutation-like matrix groups with a maximal cycle of 8 dimensions
- Realising a finite group as a subgroup of a product of two groups of permutation matrices
- From local to global similarity of matrix groups
This page was built for publication: Permutation-like matrix groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875002)
