Computer-assisted methods in Sigma-theory
Abstract
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 FPm or of type F2 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.