Context-Freeness of Higman-Thompson group's co-word problem

Simple item page
dc.creatorLehnert, Joerg
dc.creatorSchweitzer, Pascal
dc.date2005-07-05
dc.date.accessioned2026-07-07T05:21:24Z
dc.date.available2026-07-07T05:21:24Z
dc.descriptionThe co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to show, that the Higman-Thompson groups, and therefore the Houghton groups, have context-free co-word problem. We also give some examples of groups, that even have an easier co-word problem. We call this property semi-deterministic context-free. The second Houghton group belongs to this class.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0507090
dc.identifierhttp://arxiv.org/abs/math/0507090
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75679
dc.subjectGroup Theory
dc.subject20F10; 68Q45 (primary) 03D40 (secondary)
dc.titleContext-Freeness of Higman-Thompson group's co-word problem
dc.typetext

Files

Collections

arXiv