Linear time algorithm for the conjugacy problem in the first Grigorchuk group

DOI10.1142/S0218196721500363OpenAlexW3166114698MaRDI QIDQ5002196

No author found.

Publication date: 27 July 2021

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.04028

zbMATH Keywords

complexityword problemconjugacy problemGrigorchuk group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic equations in the Grigorchuk group.
• The conjugacy problem in the Grigorchuk group is polynomial time decidable.
• On Burnside's problem on periodic groups
• A system of defining relations for a Grigorchuk group
• Lexicographically least circular substrings
• The complexity of Grigorchuk groups with application to cryptography
• Conjugacy problem in a class of \(2\)-groups
• Conjugacy problem in an automorphism group of an infinite tree
• Random subgroups and analysis of the length-based and quotient attacks
• Fast Pattern Matching in Strings
• A STRUCTURAL PROPERTY CONCERNING ABSTRACT COMMENSURABILITY OF SUBGROUPS
• Cryptography and Coding
• THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS

This page was built for publication: Linear time algorithm for the conjugacy problem in the first Grigorchuk group