Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.09264 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of 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.