Ideals of equations for elements in a free group and Stallings folding

From MaRDI portal
Publication:6404590

arXiv2207.04759MaRDI QIDQ6404590FDOQ6404590


Authors: Dario Ascari Edit this on Wikidata


Publication date: 11 July 2022

Abstract: Let F be a finitely generated free group and let HleF be a finitely generated subgroup. Given an element ginF, we study the ideal mathfrakIg of equations for g with coefficients in H, i.e. the elements w(x)inHlanglexangle such that w(g)=1 in F. The ideal mathfrakIg is a normal subgroup of Hlanglexangle, and we provide an algorithm, based on Stallings folding operations, to compute a finite set of generators for mathfrakIg as a normal subgroup. We provide an algorithm to find an equation in mathfrakIg with minimum degree, i.e. an equation w(x) such that its cyclic reduction contains the minimum possible number of occurrences of x and x1; this answers a question of A. Rosenmann and E. Ventura. More generally, we provide an algorithm that, given dinmathbbN, determines whether mathfrakIg contains equations of degree d or not, and we give a characterization of the set of all the equations of that specific degree. We define the set Dg of all integers d such that mathfrakIg contains equations of degree d; we show that Dg coincides, up to a finite set, either with the set of non-negative even numbers or with the set of natural numbers. Finally, we provide examples to illustrate the techniques introduces in this paper. We discuss the case where extrank(H)=1. We prove that both kinds of sets Dg can actually occur. The examples also show that the equations of minimum possible degree aren't in general enough to generate the whole ideal mathfrakIg as a normal subgroup.













This page was built for publication: Ideals of equations for elements in a free group and Stallings folding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404590)