2017
DOI: 10.4171/ggd/393
|View full text |Cite
|
Sign up to set email alerts
|

Decision problems, complexity, traces, and representations

Abstract: In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure efficiency in terms of the size of the quotients required to distinguish a distinct pair of conjugacy classes.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 17 publications
(24 citation statements)
references
References 66 publications
0
24
0
Order By: Relevance
“…There are only a few results concerning the asymptotic behaviour of conjugacy separability for different classes of groups. Lawton, Louder, and McReynolds [19] demonstrate that if G is a nonabelian free group or the fundamental group of a closed oriented surface of genus g ≥ 2, then Conj G (n) n n 2 . For the class of finitely generated nilpotent groups, the second named author and Dére [7] demonstrate the following alternative.…”
mentioning
confidence: 99%
“…There are only a few results concerning the asymptotic behaviour of conjugacy separability for different classes of groups. Lawton, Louder, and McReynolds [19] demonstrate that if G is a nonabelian free group or the fundamental group of a closed oriented surface of genus g ≥ 2, then Conj G (n) n n 2 . For the class of finitely generated nilpotent groups, the second named author and Dére [7] demonstrate the following alternative.…”
mentioning
confidence: 99%
“…The proof is similar to [5,Lem 1.1] (see also [6,Lem 1.2] and [30,Lem 2.1]). We first give some lemmas about the function F G,X,S before coming to our main result.…”
Section: Separability Of Extensions Of Twisted Conjugacy Separable Groupssmentioning
confidence: 58%
“…Observe that if ϕ = id, then Conj ϕ G,S is equal to the conjugacy separability Conj G,S introduced by Lawton, Louder, and McReynolds [30]; subsequently, Conj G,S (n) Tconj G,S (n). If, for some ϕ ∈ Aut(G), we have that Conj ϕ G,S (n) < ∞ for all n ∈ N, then G is ϕ-twisted conjugacy separable.…”
Section: Finitely Generated Groups and Separabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, several effective separability results have been established; see [2][3][4][5][6]8,9,[12][13][14][15][20][21][22][23]26]. Most relevant here are the papers [9,20] where bounds on the index of the separating subgroups for free and surface groups given.…”
Section: Introductionmentioning
confidence: 99%