Enumeration in algebra - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

Enumeration in algebra

Résumé

We show how the concept of enumeration reducibility from comput-ability theory may be applied to obtain computability conditions on descriptions of substructures of algebras, more prominently on the language of forbidden words of a subshift, and on the word problem for finitely generated groups. Many of the results here are already known for recursively presented groups and effectively closed subshifts, but using enumeration reducibility we are able to generalize them to arbitrary objects. The proof is based on a topological framework similar to universal algebra, and generalizes in particular work by Kuznetsov and others.
Fichier principal
Vignette du fichier
enum_hal.pdf (156.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01146744 , version 1 (29-04-2015)
hal-01146744 , version 2 (29-05-2015)
hal-01146744 , version 3 (04-08-2017)

Identifiants

Citer

Emmanuel Jeandel. Enumeration in algebra. 2015. ⟨hal-01146744v1⟩
375 Consultations
499 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More