Algorithms for polycyclic-by-finite groups

DOI10.1016/j.jsc.2016.02.008zbMath1358.20005OpenAlexW1849106276MaRDI QIDQ507137

S. K. Sinanan, Derek F. Holt

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/77143/7/WRAP_pcbf.pdf

zbMATH Keywords

permutationpolycyclic groupfinitely presentedpolycyclic-by-finite group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

Algorithms for twisted conjugacy classes of polycyclic-by-finite groups ⋮ Universal covers of finite groups

Cites Work

• Computing intersections and normalizers in soluble groups
• A \(p\)-adic algorithm for computing the inverse of integer matrices
• Exact solution of linear equations using p-adic expansions
• The algorithmic theory of polycyclic-by-finite groups
• Computing conjugacy classes of elements in matrix groups.
• Some remarks on the computation of conjugacy classes of soluble groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for polycyclic-by-finite groups