Word and Conjugacy Problems in Groups Gkk+1

Standard

Word and Conjugacy Problems in Groups G^k_k+1. / Fedoseev, D. A.; Karpov, A. B.; Manturov, V. O.

In: Lobachevskii Journal of Mathematics, Vol. 41, No. 2, 01.02.2020, p. 176-193.

Research output: Contribution to journal › Article › peer-review

Harvard

Fedoseev, DA, Karpov, AB & Manturov, VO 2020, 'Word and Conjugacy Problems in Groups G^k_k+1', Lobachevskii Journal of Mathematics, vol. 41, no. 2, pp. 176-193. https://doi.org/10.1134/S1995080220020067

APA

Fedoseev, D. A., Karpov, A. B., & Manturov, V. O. (2020). Word and Conjugacy Problems in Groups G^k_k+1. Lobachevskii Journal of Mathematics, 41(2), 176-193. https://doi.org/10.1134/S1995080220020067

Vancouver

Fedoseev DA, Karpov AB, Manturov VO. Word and Conjugacy Problems in Groups G^k_k+1. Lobachevskii Journal of Mathematics. 2020 Feb 1;41(2):176-193. doi: 10.1134/S1995080220020067

Author

Fedoseev, D. A. ; Karpov, A. B. ; Manturov, V. O. / Word and Conjugacy Problems in Groups G^k_k+1. In: Lobachevskii Journal of Mathematics. 2020 ; Vol. 41, No. 2. pp. 176-193.

BibTeX

@article{13de9ef7d889451bb4627c0e7487bb98,

title = "Word and Conjugacy Problems in Groups Gkk+1",

abstract = "Recently the third named author defined a 2-parametric family of groups Gkn [12]. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups Gkn and dynamical systems led to the discovery of the following fundamental principle: {\textquoteleft}{\textquoteleft}If dynamical systems describing the motion of n particles possess a nice codimension one property governed by exactly k particles, then these dynamical systems admit a topological invariant valued in Gkn. The Gkn groups have connections to different algebraic structures, Coxeter groups and Kirillov–Fomin algebras, to name just a few. Study of the Gkn groups led to, in particular, the construction of invariants, valued in free products of cyclic groups. In the present paper we prove that word and conjugacy problems for certain Gkk+1 groups are algorithmically solvable.",

keywords = "$G_{n}^{2}$ group, braid, conjugacy problem, dynamical system, group, Howie diagram, invariant, manifold, small cancellation, word problem, G(n)(k) group",

author = "Fedoseev, {D. A.} and Karpov, {A. B.} and Manturov, {V. O.}",

year = "2020",

month = feb,

day = "1",

doi = "10.1134/S1995080220020067",

language = "English",

volume = "41",

pages = "176--193",

journal = "Lobachevskii Journal of Mathematics",

issn = "1995-0802",

publisher = "Maik Nauka Publishing / Springer SBM",

number = "2",

}

RIS

TY - JOUR

T1 - Word and Conjugacy Problems in Groups Gkk+1

AU - Fedoseev, D. A.

AU - Karpov, A. B.

AU - Manturov, V. O.

PY - 2020/2/1

Y1 - 2020/2/1

N2 - Recently the third named author defined a 2-parametric family of groups Gkn [12]. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups Gkn and dynamical systems led to the discovery of the following fundamental principle: ‘‘If dynamical systems describing the motion of n particles possess a nice codimension one property governed by exactly k particles, then these dynamical systems admit a topological invariant valued in Gkn. The Gkn groups have connections to different algebraic structures, Coxeter groups and Kirillov–Fomin algebras, to name just a few. Study of the Gkn groups led to, in particular, the construction of invariants, valued in free products of cyclic groups. In the present paper we prove that word and conjugacy problems for certain Gkk+1 groups are algorithmically solvable.

AB - Recently the third named author defined a 2-parametric family of groups Gkn [12]. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups Gkn and dynamical systems led to the discovery of the following fundamental principle: ‘‘If dynamical systems describing the motion of n particles possess a nice codimension one property governed by exactly k particles, then these dynamical systems admit a topological invariant valued in Gkn. The Gkn groups have connections to different algebraic structures, Coxeter groups and Kirillov–Fomin algebras, to name just a few. Study of the Gkn groups led to, in particular, the construction of invariants, valued in free products of cyclic groups. In the present paper we prove that word and conjugacy problems for certain Gkk+1 groups are algorithmically solvable.

KW - $G_{n}^{2}$ group

KW - braid

KW - conjugacy problem

KW - dynamical system

KW - group

KW - Howie diagram

KW - invariant

KW - manifold

KW - small cancellation

KW - word problem

KW - G(n)(k) group

UR - http://www.scopus.com/inward/record.url?scp=85084320510&partnerID=8YFLogxK

U2 - 10.1134/S1995080220020067

DO - 10.1134/S1995080220020067

M3 - Article

AN - SCOPUS:85084320510

VL - 41

SP - 176

EP - 193

JO - Lobachevskii Journal of Mathematics

JF - Lobachevskii Journal of Mathematics

SN - 1995-0802

IS - 2

ER -

ID: 24957220