Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1602.02445

A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups

Armin Weiß
View original source ↗Read source document ↗Export metadata ↓

Abstract

Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are HNN extensions, there is a natural generalization in terms of graph of groups. Concerning algorithmic aspects of generalized Baumslag-Solitar groups, several decidability results are known. Indeed, a straightforward application of standard algorithms leads to a polynomial time solution of the word problem (the question whether some word over the generators represents the identity of the group). The conjugacy problem (the question whether two given words represent conjugate group elements) is more complicated; still decidability has been established by Anshel and Stebe for ordinary Baumslag-Solitar groups and for generalized Baumslag-Solitar groups independently by Lockhart and Beeker. However, up to now no precise complexity estimates have been given. In this work, we give a LOGSPACE algorithm for both problems. More precisely, we describe a uniform TC^0 many-one reduction of the word problem to the word problem of the free group. Then we refine the known techniques for the conjugacy problem and show that it can be solved in LOGSPACE. Moreover, for ordinary Baumslag-Solitar groups also conjugacy is AC^0-Turing-reducible to the word problem of the free group. Finally, we consider uniform versions (where also the graph of groups is part of the input) of both word and conjugacy problem: while the word problem still is solvable in LOGSPACE, the conjugacy problem becomes EXPSPACE-complete.

Explore related subjects

cs.CCcs.DMmath.GR

Keep this discovery

BibTeXRIS

Armin Weiß. 2016-02-08. A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups. https://arxiv.org/abs/1602.02445

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

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗