Displaying similar documents to “On Sierpiński sets in groups”

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F . Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F . We show that the latter dependency can be made exponential in the rank difference rank ( F ) - rank ( H ) , which often makes a significant change.

Conjugacy pinched and cyclically pinched one-relator groups.

Benjamin Fine, Gerhard Rosenberger, Michael Stille (1997)

Revista Matemática de la Universidad Complutense de Madrid

Similarity:

Here we consider two classes of torsion-free one-relator groups which have proved quite amenable to study-the cyclically pinched one-relator groups and the conjugacy pinched one-relator groups. The former is the class of groups which are free products of free groups with cyclic amalgamations while the latter is the class of HNN extensions of free groups with cyclic associated subgroups. Both are generalizations of surface groups. We compare and contrast results in these classes relative...