An algorithm to recognize echelon subgroups of a free group
| Autor: | Ascari, Dario |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: 16 pages, 3 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|