Algorithmic constructions and primitive elements in the free group of rank 2

Simple item page
dc.creatorPiggott, Adam
dc.date2005-04-20
dc.date2005-04-26
dc.date.accessioned2026-07-07T05:19:15Z
dc.date.available2026-07-07T05:19:15Z
dc.descriptionThe centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a primitive element p in F(x, y) with a given exponent sum pair (X, Y), if such an element p exists. Several results concerning the primitive elements of F(x, y) are recast as applications of the algorithm and the normal form.
dc.description12 pages. Replaces old version (apologies for uploading wrong version) which contained an error in the statement of Second normal form theorem
dc.identifierhttps://arxiv.org/abs/math/0504401
dc.identifierhttp://arxiv.org/abs/math/0504401
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74952
dc.subjectGroup Theory
dc.subject20E05
dc.titleAlgorithmic constructions and primitive elements in the free group of rank 2
dc.typetext

Files

Collections

arXiv