Quotient tests and random walks in computational group theory.

MaRDI QIDQ5488871zbMATH OpenFDO

Authors Alexandre V. Borovik, Alexei Myasnikov

Publication date 25 September 2006

zbMATH Keywords

Cayley graphsconjugacy problemdecision algorithmsdecision problemsefficiencyfinite quotient groupsfinitely presented groupsidentity problemquotient testsrandom walksword problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Probabilistic methods in group theory (20P05) Sums of independent random variables; random walks (60G50) Symbolic computation and algebraic computation (68W30)

Recommendations

• Generic-case complexity, decision problems in group theory, and random walks.
• Quotient tests and Gröbner bases.
• scientific article; zbMATH DE number 96386
• scientific article; zbMATH DE number 96387
• The product replacement algorithm and Kazhdan's property (T)

Cited in

(3)

• Quotient tests and Gröbner bases.
• Random equations in nilpotent groups.
• Exponentially generic subsets of groups

This page was built for publication: Quotient tests and random walks in computational group theory.

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