Remarks and problems about algorithmic descriptions of groups
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908594709987328 |
|---|---|
| author | Rauzy, Emmanuel |
| author_facet | Rauzy, Emmanuel |
| contents | Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated groups. We establish the Rice and Rice-Shapiro Theorems for recursive presentations, and establish similar results for co-recursive presentations. We give an algorithmic characterization of finitely presentable groups in terms of semi-decidability of two decision problems: the word problem and the marked quotient problem, which we introduce. We explain how this result can be used to define algorithmic generalizations of finite presentations. Finally, we discuss how the Adian-Rabin Theorem provides incomplete answers in several respects. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_01190 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Remarks and problems about algorithmic descriptions of groups Rauzy, Emmanuel Group Theory Logic 20F10, 03D40, 20F05 Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated groups. We establish the Rice and Rice-Shapiro Theorems for recursive presentations, and establish similar results for co-recursive presentations. We give an algorithmic characterization of finitely presentable groups in terms of semi-decidability of two decision problems: the word problem and the marked quotient problem, which we introduce. We explain how this result can be used to define algorithmic generalizations of finite presentations. Finally, we discuss how the Adian-Rabin Theorem provides incomplete answers in several respects. |
| title | Remarks and problems about algorithmic descriptions of groups |
| topic | Group Theory Logic 20F10, 03D40, 20F05 |
| url | https://arxiv.org/abs/2111.01190 |