The conjugacy problem for Higman’s group

DOI10.1142/S0218196720500393MaRDI QIDQ4970526

Owen Baker

Publication date: 14 October 2020

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

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

zbMATH Keywords

conjugacy problemfinite state transducerpower circuitHigman's group

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ Improved parallel algorithms for generalized Baumslag groups

Uses Software

• CRAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugacy in Baumslag's group, generic case complexity, and division in power circuits
• Generic-case complexity, decision problems in group theory, and random walks.
• Combinatorial group theory.
• Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P
• Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
• Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
• THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES
• The Conjugacy Problem for Graph Products with Cyclic Edge Groups
• The conjugacy problem and cyclic amalgamations
• On Cyclic Subgroups and the Conjugacy Problem
• The Conjugacy Problem for HNN Extensions with Infinite Cyclic Associated Groups
• POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY
• Probability Inequalities for Sums of Bounded Random Variables
• A Finitely Generated Infinite Simple Group

This page was built for publication: The conjugacy problem for Higman’s group