Group-theoretic orbit decidability
Visualitza/Obre
Cita com:
hdl:2117/27428
Tipus de documentArticle
Data publicació2014-12-01
EditorDe Gruytr
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
A recent collection of papers in the last years have given a renovated interest to the notion of orbit decidability. This is a new quite general algorithmic notion, connecting with several classical results, and closely related to the study of the conjugacy problem for extensions of groups. In the present survey we explain several of the classical results closely
related to this concept, and we explain the main ideas behind the recent connection with the conjugacy problem made by Bogopolski–Martino–Ventura in [2]. All the consequences up to date, published in several other papers by other authors, are also commented and reviewed.
CitacióVentura, E. Group-theoretic orbit decidability. "Groups Complexity Cryptology", 01 Desembre 2014, vol. 6, núm. 2, p. 133-148.
ISSN1869-6104
Versió de l'editorThe final publication is available at www.degruyter.com
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
OD-survey.pdf | 382,4Kb | Visualitza/Obre |