An algorithm to recognize echelon subgroups of a free group
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.