Algorithms for computing with nilpotent matrix groups over infinite domains.
The authors develop a technique for computing with matrix groups defined over infinite domains, based on changing the ground domain via congruence homomorphisms. These methods can be applied to the design of algorithms for nilpotent groups. In particular, they are applied to nilpotency testing algorithms for matrix groups over an infinite field. Let \(\mathbb{F}\) be a field and suppose that \(G\) is a finitely generated subgroup of the general linear group \(\text{GL}(n,\mathbb{F})\). The authors obtain algorithms for carrying out the following tasks: (i) Testing nilpotency of \(G\); and if \(G\) is nilpotent: (ii) constructing a polycyclic presentation of \(G\); (iii) testing whether \(G\) is completely reducible, and finding a completely reducible series of \(G\)-modules; (iv) deciding finiteness of \(G\), and calculating \(|G|\) if \(G\) is finite; (v) finding the \(p\)-primary decomposition of \(G\), and finding all Sylow \(p\)-subgroups if \(G\) is finite. The main algorithms have been implemented in GAP, for groups over the rational number field.
- A practical algorithm for finding matrix representations for polycyclic groups
- Algorithms for matrix groups and the Tits alternative
- CLASSIFICATION OF NILPOTENT PRIMITIVE LINEAR GROUPS OVER FINITE FIELDS
- Computational group theory.
- Computing in Nilpotent Matrix Groups
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Finding intersections and normalizers in finitely generated nilpotent groups
- scientific article; zbMATH DE number 3427609 (Why is no real title available?)
- scientific article; zbMATH DE number 3815938 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- scientific article; zbMATH DE number 475366 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 194711 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- Locally nilpotent linear groups
- Maximal Abelian Subgroups of the Symmetric Groups
- Nilpotent subgroups of \(\text{GL}(n,\mathbb Q)\)
- Practical algorithms for polycyclic matrix groups
- Testing polycyclicity of finitely generated rational matrix groups
- The Nilpotency Class Of The p-Sylow Subgroups of GL(n, q) Where (p, q) = 1
- The Orbit-Stabilizer Problem for Linear Groups
- On deciding finiteness of matrix groups.
- On finite nilpotent matrix groups over integral domains.
- Nilmat
- Deciding finiteness of matrix groups in positive characteristic.
- Linear groups and computation
- Computing in unipotent and reductive algebraic groups.
- Primitivity testing of finite nilpotent linear groups.
- Computing with matrix groups over infinite fields.
- Computing in Nilpotent Matrix Groups
- Algorithmic use of the Mal'cev correspondence.
- Low-dimensional representations of matrix groups and group actions on \(\mathrm{CAT}(0)\) spaces and manifolds.
- Irreducibility testing of finite nilpotent linear groups.
- Algorithms for the Tits alternative and related problems.
- Algorithmic problems for class-2 nilpotents MR-groups
This page was built for publication: Algorithms for computing with nilpotent matrix groups over infinite domains.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481472)
