scholarly journals Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1330
Author(s):  
Raeyong Kim
Keyword(s):  
Group Structure ◽  
Conjugacy Problem ◽  
High Dimensional ◽  
Fundamental Groups ◽  
Graph Manifold ◽  
Solvable Word Problem ◽  
Algorithmic Problems ◽  
Graph Manifolds ◽  
Dimensional Graph ◽  
Solvable Word

The conjugacy problem for a group G is one of the important algorithmic problems deciding whether or not two elements in G are conjugate to each other. In this paper, we analyze the graph of group structure for the fundamental group of a high-dimensional graph manifold and study the conjugacy problem. We also provide a new proof for the solvable word problem.

A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM

2009 ◽  
Vol 02 (04) ◽  
pp. 611-635 ◽  
Author(s):  
K. Kalorkoti
Keyword(s):  
Conjugacy Problem ◽  
Finitely Presented Groups ◽  
Finitely Presented Group ◽  
Recursively Enumerable ◽  
Computation Step ◽  
Solvable Word Problem ◽  
Finitely Presented ◽  
Solvable Word ◽  
Extended Notion ◽  
Ordered Pairs

The algorithmic unsolvability of the conjugacy problem for finitely presented groups was demonstrated by Novikov in the early 1950s. Various simplifications and alternative proofs were found by later researchers and further questions raised. Recent work by Borovik, Myasnikov and Remeslennikov has considered the question of what proportion of the number of elements of a group (obtained by standard constructions) falls into the realm of unsolvability. In this paper we provide a straightforward construction, as a Britton tower, of a finitely presented group with solvable word problem but unsolvable conjugacy problem of any r.e. (recursively enumerable) Turing degree a. The question of whether two elements are conjugate is bounded truth-table reducible to the question of whether the elements are both conjugate to a single generator of the group. We also define computable normal forms, based on the method of Bokut', that are suitable for the conjugacy problem. We consider (ordered) pairs of normal words U, V for the conjugacy problem whose lengths add to l and show that the proportion of such pairs for which conjugacy is undecidable (in the case a ≠ 0) is strictly less than l2/(2λ - 1)l where λ > 4. The construction is based on modular machines, introduced by Aanderaa and Cohen. For the purposes of this construction it was helpful to extend the notion of configuration to include pairs of m-adic integers. The notion of computation step was also extended and is referred to as s-fold computation where s ∈ ℤ (the usual notion coresponds to s = 1). If gcd (m, s) = 1 then determinism is preserved, i.e., if the modular machine is deterministic then it remains so under the extended notion. Furthermore there is a simple correspondence between s-fold and standard computation in this case. Otherwise computation is non-deterministic and there does not seem to be any straightforward correspondence between s-fold and standard computation.

Hierarchies of Computable groups and the word problem

1966 ◽  
Vol 31 (3) ◽  
pp. 376-392 ◽  
Author(s):  
Frank B. Cannonito
Keyword(s):  
Word Problem ◽  
Free Groups ◽  
Orientable Surface ◽  
Fundamental Groups ◽  
Church’S Thesis ◽  
Free Products ◽  
Closed Orientable Surface ◽  
Products Of Groups ◽  
Solvable Word Problem ◽  
Solvable Word

The word problem for groups was first formulated by M. Dehn [1], who gave a solution for the fundamental groups of a closed orientable surface of genus g ≧ 2. In the following years solutions were given, for example, for groups with one defining relator [2], free groups, free products of groups with a solvable word problem and, in certain cases, free products of groups with amalgamated subgroups [3], [4], [5]. During the period 1953–1957, it was shown independently by Novikov and Boone that the word problem for groups is recursively undecidable [6], [7]; granting Church's Thesis [8], their work implies that the word problem for groups is effectively undecidable.

Unsolvable Problems in Groups With Solvable Word Problem

1970 ◽  
Vol 22 (4) ◽  
pp. 836-838 ◽  
Author(s):  
James McCool
Keyword(s):  
Word Problem ◽  
Conjugacy Problem ◽  
The Other ◽  
Decision Problems ◽  
Finitely Presented Group ◽  
Other Hand ◽  
Solvable Word Problem ◽  
Finitely Presented ◽  
Effective Procedures ◽  
Solvable Word

Let G be a finitely presented group with solvable word problem. It is of some interest to ask which other decision problems must necessarily be solvable for such a group. Thus it is easy to see that there exist effective procedures to determine whether or not such a group is trivial, or nilpotent of a given class. On the other hand, the conjugacy problem need not be solvable for such a group, for Fridman [5] has shown that the word problem is solvable for the group with unsolvable conjugacy problem given by Novikov [9].

TOPOLOGICAL PROPERTIES OF CYCLICALLY PRESENTED GROUPS

2003 ◽  
Vol 12 (02) ◽  
pp. 243-268 ◽  
Author(s):  
ALBERTO CAVICCHIOLI ◽  
DUŠAN REPOVŠ ◽  
FULVIA SPAGGIARI
Keyword(s):  
Finite Volume ◽  
High Dimensional ◽  
Fundamental Groups ◽  
Topological Properties ◽  
3 Dimensional ◽  
Hnn Extensions ◽  
Finite Set ◽  
Split Extensions

We introduce a family of cyclic presentations of groups depending on a finite set of integers. This family contains many classes of cyclic presentations of groups, previously considered by several authors. We prove that, under certain conditions on the parameters, the groups defined by our presentations cannot be fundamental groups of closed connected hyperbolic 3–dimensional orbifolds (in particular, manifolds) of finite volume. We also study the split extensions and the natural HNN extensions of these groups, and determine conditions on the parameters for which they are groups of 3–orbifolds and high–dimensional knots, respectively.

On Weighted Geodesics in Groups

1987 ◽  
Vol 30 (1) ◽  
pp. 86-91
Author(s):  
Seymour Lipschutz
Keyword(s):  
Weight Function ◽  
Free Product ◽  
Word Problem ◽  
Minimum Weight ◽  
Minimum Length ◽  
Finitely Generated ◽  
Finitely Generated Groups ◽  
Solvable Word Problem ◽  
Geodesic Problem ◽  
Solvable Word

AbstractA word W in a group G is a geodesic (weighted geodesic) if W has minimum length (minimum weight with respect to a generator weight function α) among all words equal to W. For finitely generated groups, the word problem is equivalent to the geodesic problem. We prove: (i) There exists a group G with solvable word problem, but unsolvable geodesic problem, (ii) There exists a group G with a solvable weighted geodesic problem with respect to one weight function α1, but unsolvable with respect to a second weight function α2. (iii) The (ordinary) geodesic problem and the free-product geodesic problem are independent.

scholarly journals The Asymptotics of the Higher Dimensional Reidemeister Torsion for Exceptional Surgeries Along Twist Knots

2018 ◽  
Vol 61 (1) ◽  
pp. 211-224 ◽  
Author(s):  
Anh T. Tran ◽  
Yoshikazu Yamaguchi
Keyword(s):  
Asymptotic Behavior ◽  
Reidemeister Torsion ◽  
Graph Manifold ◽  
Higher Dimensional ◽  
Graph Manifolds

AbstractWe determine the asymptotic behavior of the higher dimensional Reidemeister torsion for the graph manifolds obtained by exceptional surgeries along twist knots. We show that all irreducible SL2()-representations of the graph manifold are induced by irreducible metabelian representations of the twist knot group. We also give the set of the limits of the leading coeõcients in the higher dimensional Reidemeister torsion explicitly.

Sign in / Sign up

Export Citation Format

Share Document