Symbolic Collection using Deep Thought

DOI10.1112/S1461157000000127MaRDI QIDQ4230657zbMATH OpenFDO

Authors Leonard H. Soicher, C. R. Leedham-Green

Publication date 8 February 1999

Published in LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL http://www.lms.ac.uk/jcm/1/

zbMATH Keywords

algorithmscentral seriessymbolic computationHall polynomialsrational polynomialsfinitely generated torsion-free nilpotent groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Commutator calculus (20F12) Nilpotent groups (20F18) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• Algorithmic use of the Mal'cev correspondence.
• Efficient collection in infinite polycyclic groups.
• Collection from the left
• Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups

Cites work

• scientific article; zbMATH DE number 193183 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• A Contribution to the Theory of Groups of Prime-Power Order
• Collection from the left and other strategies
• Computational aspects of affine representations for torsion free nilpotent groups via the Seifert construction

Cited in

(19)

• Using the Mal'cev correspondence for collection in polycyclic groups.
• Matrix representations for torsion-free nilpotent groups by Deep Thought.
• Logspace and compressed-word computations in nilpotent groups
• The complexity of the equation solvability and equivalence problems over finite groups
• Parallel complexity for nilpotent groups
• Maximal linear groups induced on the Frattini quotient of a \(p\)-group
• The conjugacy problem and canonical representatives in finitely generated nilpotent groups
• An effective version of the Lazard correspondence.
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups
• \(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
• A constructive proof that many groups with non-torsion 2-cohomology are not matricially stable
• On homomorphic encryption using abelian groups: classical security analysis
• Computation of orders and cycle lengths of automorphisms of finite solvable groups
• Efficient characteristic refinements for finite groups
• A fast isomorphism test for groups whose Lie algebra has genus 2
• Computing in unipotent and reductive algebraic groups.
• On the dimension of matrix embeddings of torsion-free nilpotent groups
• Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group

This page was built for publication: Symbolic Collection using Deep Thought

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230657)