Decision problems, complexity, traces, and representations
classification
🧮 math.GR
math.GT
keywords
conjugacygroupsproblemarticleclassescomplexityconnectionsdecision
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.