Computing polycyclic presentations for polycyclic rational matrix groups.
algorithmsfinitely generated groupsgeneral linear groupspolycyclic groupsfinitely generated subgroupsmatrix groupspolycyclic presentationsmembership testssolvable-by-finite subgroups
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Linear algebraic groups over the reals, the complexes, the quaternions (20G20) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Software, source code, etc. for problems pertaining to group theory (20-04)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 4136063 (Why is no real title available?)
- scientific article; zbMATH DE number 3815938 (Why is no real title available?)
- scientific article; zbMATH DE number 3678068 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 1004942 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- Algebraic number theory and Fermat's last theorem.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Computing the order of a solvable permutation group
- Improved algorithms for the Tits alternative
- KANT V4
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- Practical algorithms for polycyclic matrix groups
- The Orbit-Stabilizer Problem for Linear Groups
- Algorithms for linear groups of finite rank.
- Computing conjugacy classes of elements in matrix groups.
- Special polycyclic generating sequences for finite soluble groups.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- The automorphism group of a finitely generated virtually abelian group.
- Orbit-stabilizer problems and computing normalizers for polycyclic groups.
- Algorithms for the Tits alternative and related problems.
- Computing polycyclic quotients of finitely (\(L\)-)presented groups via Groebner bases.
- On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
- The constructive membership problem for discrete free subgroups of rank 2 of \(\mathrm{SL}_2(\mathbb R)\).
- On the Frattini subgroup of a polycyclic group
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- The construction of finite solvable groups revisited.
- Irreducibility testing of finite nilpotent linear groups.
- Linear groups and computation
- Refined solvable presentations for polycyclic groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Testing polycyclicity of finitely generated rational matrix groups
This page was built for publication: Computing polycyclic presentations for polycyclic rational matrix groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456603)
