Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1011.5931

Polynomial time conjugacy in wreath products and free solvable groups

Svetla Vassileva
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy Problems for A and B and of the power problem in B. We obtain the result by making the algorithm for the Conjugacy Problem described in a paper of Matthews run in polynomial time. Using this result and properties of the Magnus embedding, we show that the Conjugacy and Conjugacy Search Problems in free solvable groups are computable in polynomial time.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Svetla Vassileva. 2010-11-26. Polynomial time conjugacy in wreath products and free solvable groups. https://arxiv.org/abs/1011.5931

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Subindices and subfactors of $\mathbb{Z}_n$ and $k$-index stability of finite groups

We study subindices, subfactors, and index stability in the cyclic group $\mathbb{Z}_n$. We prove several theorems that not only confirm a conjecture and resolve some open problems about index stability of such groups, but also provide basic tools for the characterization of finite $k$-index stable groups. As a consequence, we completely characterize all 2-element index stable subsets of $\mathbb{Z}_n$, obtain an exact closed formula for their density, and determine all $n$ for which every 2-subset is index unstable. Finally, we present some problems and a research project extending the study to 3-subsets and general $k$-subsets.

math.GR↗
arXiv2026

Virtually generating graphs of pro-$p$ groups

We study the virtually generating graph of pro-$p$ groups. We show that various classes of pro-$p$ groups have connected virtually generating graph and we bound its diameter in these cases; e.g.\ compact subgroups of analytic groups over local fields and the Nottingham group.

math.GR↗
arXiv2026

Surface subgroups of Baumslag doubles along short words

If $U$ is a minimal, diskbusting, finite list of words in a free group $F_n$ of rank $n$ such that the sum of the lengths of words in $U$ is at most $2n+4$, we prove that the natural presentation complex of the Baumslag double of $F_n$ along $U$ virtually contains a $π_1$-injective embedded closed hyperbolic surface. This verifies the Tiling Conjecture of Kim and Wilton for this type of lists of words, and in particular, implies that the corresponding Baumslag double contains a hyperbolic surface subgroup.

math.GR↗