The geometry of the conjugacy problem in wreath products and free solvable groups. (Q2352891): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
 
Property / arXiv ID
 
Property / arXiv ID: 1307.6812 / rank
 
Normal rank

Latest revision as of 04:41, 19 April 2024

scientific article
Language Label Description Also known as
English
The geometry of the conjugacy problem in wreath products and free solvable groups.
scientific article

    Statements

    The geometry of the conjugacy problem in wreath products and free solvable groups. (English)
    0 references
    6 July 2015
    0 references
    Let \(G\) be a recursively presented group with finite generating set \(X\), and \(|\cdot|\) denote word-length in \(G\) w.r.t. \(X\). The conjugacy length function \(\mathrm{CLF}\colon\mathbb N\to\mathbb N\) maps \(n\) to \(\max\{\min\{|w|:wu=vw\}:|u|+|v|\leq n\text{ and }u\) is conjugate to \(v\) in \(G\)
    0 references
    conjugacy problem
    0 references
    free solvable groups
    0 references
    wreath products
    0 references
    subgroup distorsion
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references