Back to Search
Start Over
Aperiodic Pointlikes and Beyond
- Publication Year :
- 2007
-
Abstract
- We prove that if $\pi$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $\pi$-groups. In particular, when $\pi$ is the empty set, we obtain Henckell's decidability of aperiodic pointlikes. Our proof, restricted to the case of aperiodic semigroups, is simpler than the original proof.
- Subjects :
- Mathematics - Group Theory
20M07
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.0706.0248
- Document Type :
- Working Paper