Symbolic Collection using Deep Thought
From MaRDI portal
Publication:4230657
DOI10.1112/S1461157000000127zbMath0924.20029MaRDI QIDQ4230657
Leonard H. Soicher, Charles 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/
algorithmssymbolic computationHall polynomialscentral seriesrational polynomialsfinitely generated torsion-free nilpotent groups
Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) Software, source code, etc. for problems pertaining to group theory (20-04) Commutator calculus (20F12)
Related Items (16)
Efficient characteristic refinements for finite groups ⋮ Parallel complexity for nilpotent groups ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ An effective version of the Lazard correspondence. ⋮ Using the Mal'cev correspondence for collection in polycyclic groups. ⋮ A fast isomorphism test for groups whose Lie algebra has genus 2 ⋮ Maximal linear groups induced on the Frattini quotient of a \(p\)-group ⋮ On the dimension of matrix embeddings of torsion-free nilpotent groups ⋮ Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups ⋮ Matrix representations for torsion-free nilpotent groups by Deep Thought. ⋮ TC^0 circuits for algorithmic problems in nilpotent groups ⋮ The complexity of the equation solvability and equivalence problems over finite groups ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups ⋮ Computing in Unipotent and Reductive Algebraic Groups
Cites Work
This page was built for publication: Symbolic Collection using Deep Thought
