arXiv:2311.02784 [math.GR]AbstractReferencesReviewsResources
An algorithm to recognize echelon subgroups of a free group
Published 2023-11-05Version 1
We provide an algorithm that, given a finite set of generators for a subgroup $H$ of a finitely generated free group $F$, determines whether $H$ is echelon or not and, in case of affirmative answer, also computes a basis with respect to which $H$ is in echelon form. This answers to a question of A. Rosenmann. We also prove, by means of a counterexample, that intersection of two echelon subgroups needs not to be echelon, answering to another question of A. Rosenmann.
Comments: 16 pages, 3 figures
Categories: math.GR
Related articles: Most relevant | Search more
Free Groups in Lattices
arXiv:1007.4845 [math.GR] (Published 2010-07-27)
The Largest Subsemilattices of the Semigroup of Transformations on a Finite Set
arXiv:2009.05627 [math.GR] (Published 2020-09-11)
Block-groups and Hall relations