Aperiodic Pointlikes and Beyond

Simple item page
dc.creatorHenckell, Karsten
dc.creatorRhodes, John
dc.creatorSteinberg, Benjamin
dc.date2007-06-02
dc.date2007-06-17
dc.date.accessioned2026-07-07T08:10:15Z
dc.date.available2026-07-07T08:10:15Z
dc.descriptionWe prove that if $π$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $π$-groups. In particular, when $π$ 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.
dc.identifierhttps://arxiv.org/abs/0706.0248
dc.identifierhttp://arxiv.org/abs/0706.0248
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131772
dc.subjectGroup Theory
dc.subject20M07
dc.titleAperiodic Pointlikes and Beyond
dc.typetext

Files

Collections

arXiv