Algorithms for computing with nilpotent matrix groups over infinite domains.
From MaRDI portal
Abstract: We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of matrix groups over an infinite field. We also provide algorithms that answer a number of structural questions for a given nilpotent matrix group. The algorithms have been implemented in GAP and MAGMA.
Recommendations
Cites work
- 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?)
- 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
- 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
Cited in
(14)- Algorithmic problems for class-2 nilpotents MR-groups
- Low-dimensional representations of matrix groups and group actions on \(\mathrm{CAT}(0)\) spaces and manifolds.
- On deciding finiteness of matrix groups.
- Computing in Nilpotent Matrix Groups
- Algorithms for the Tits alternative and related problems.
- On finite nilpotent matrix groups over integral domains.
- Nilmat
- Algorithmic use of the Mal'cev correspondence.
- Irreducibility testing of finite nilpotent linear groups.
- Linear groups and computation
- Primitivity testing of finite nilpotent linear groups.
- Computing with matrix groups over infinite fields.
- Computing in unipotent and reductive algebraic groups.
- Deciding finiteness of matrix groups in positive characteristic.
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)
