Computer-assisted methods in Sigma-theory

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Hartmann, Elisa
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910617225396224
author Hartmann, Elisa
author_facet Hartmann, Elisa
contents We develop an algorithm for recognizing whether a character belongs to $Σ^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable for this group. Then finite data is sufficient proof of membership in $Σ^m$, not just for the given character but also for a neighborhood of it.
format Preprint
id arxiv_https___arxiv_org_abs_2407_09264
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Computer-assisted methods in Sigma-theory
Hartmann, Elisa
Group Theory
Algebraic Topology
We develop an algorithm for recognizing whether a character belongs to $Σ^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable for this group. Then finite data is sufficient proof of membership in $Σ^m$, not just for the given character but also for a neighborhood of it.
title Computer-assisted methods in Sigma-theory
topic Group Theory
Algebraic Topology
url https://arxiv.org/abs/2407.09264