THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES

DOI10.1142/S0218196707003652zbMATH Open1149.20025arXiv0903.3751OpenAlexW2053952521MaRDI QIDQ3502829FDOQ3502829

Alexei Myasnikov, Vladimir Remeslennikov, Alexandre V. Borovik

Publication date: 20 May 2008

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

Abstract: We discuss the time complexity of the word and conjugacy search problems for free products $G=Asta{r}_{C}B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity of the word and conjugacy problems and show that for the generic stratum the conjugacy search problem is decidable under some reasonable assumptions about groups $A,B,C$.

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

Recommendations

• Conjugacy problem for subgroups in a free product of cyclic groups with amalgamation.
• A problem of expressibility in some amalgamated products of groups
• The conjugacy problem and Higman embeddings
• GENERALIZED LIOUVILLE PROPERTY FOR SCHRÖDINGER OPERATOR ON GRAPHS
• Comeagre conjugacy classes and free products with amalgamation
• On generalized conjugacy and some related problems
• Amitsur's conjecture for associative algebras with a generalized Hopf action.
• Products of conjugacy classes in algebraic groups. I
• Amalgamation in finite dimensional cylindric algebras
• Solution of the generalized conjugacy problem for a free product with commuting subgroups.

zbMATH Keywords

decidabilitytime complexityword problemamalgamated productsconjugacy search problem

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Relatively hyperbolic groups: intrinsic geometry, algebraic properties, and algorithmic problems
• Title not available (Why is that?)
• An algebraic method for public-key cryptography
• A combination theorem for negatively curved groups
• Automatic groups and amalgams
• Generic-case complexity, decision problems in group theory, and random walks.
• Hyperbolic groups and free constructions
• MULTIPLICATIVE MEASURES ON FREE GROUPS
• CSA-groups and separated free constructions
• GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS

Cited In (6)

• Cubic graphs and the golden mean
• The conjugacy problem for Higman’s group
• Amalgamated free product of groups: normal forms and measures.
• Exponentially generic subsets of groups
• Amalgamated products of groups: measures of random normal forms.
• Partial word and equality problems and Banach densities

This page was built for publication: THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES

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