## Reports on Computer Algebra (ZCA Report)

### Filtern

#### Erscheinungsjahr

- 1998 (6) (entfernen)

#### Schlagworte

- coset enumeration (2)
- subgroup problem (2)
- Gröbner base (1)
- Gröbner bases (1)
- Gröbner bases in monoid and group rings (1)
- Monoid and group rings (1)
- confluence (1)
- monoid- and group-presentations (1)
- prefix reduction (1)
- prefix string rewriting (1)
- prefix-rewriting (1)
- subgroup presentation problem (1)

- 23
- Observations on coset enumeration (1998)
- Todd and Coxeter's method for enumerating cosets of finitely generated subgroups in finitely presented groups (abbreviated by Tc here) is one famous method from combinatorial group theory for studying the subgroup problem. Since prefix string rewriting is also an appropriate method to study this problem, prefix string rewriting methods have been compared to Tc. We recall and compare two of them briefly, one by Kuhn and Madlener [4] and one by Sims [15]. A new approach using prefix string rewriting in free groups is derived from the algebraic method presented by Reinert, Mora and Madlener in [14] which directly emulates Tc. It is extended to free monoids and an algebraic characterization for the "cosets" enumerated in this setting is provided.

- 22
- Some Applications Of Prefix-Rewriting In Monoids, Groups, And Rings (1998)
- Rewriting techniques have been applied successfully to various areas of symbolic computation. Here we consider the notion of prefix-rewriting and give a survey on its applications to the subgroup problem in combinatorial group theory. We will see that for certain classes of finitely presented groups finitely generated subgroups can be described through convergent prefix-rewriting systems, which can be obtained from a presentation of the group considered and a set of generators for the subgroup through a specialized Knuth-Bendix style completion procedure. In many instances a finite presentation for the subgroup considered can be constructed from such a convergent prefix-rewriting system, thus solving the subgroup presentation problem. Finally we will see that the classical procedures for computing Nielsen reduced sets of generators for a finitely generated subgroup of a free group and the Todd-Coxeter coset enumeration can be interpreted as particular instances of prefix-completion. Further, both procedures are closely related to the computation of prefix Gr"obner bases for right ideals in free group rings.

- 21
- SINGULAR version 1.2 User Manual (1998)

- 20
- MRC - A System for Computing Gröbner Bases in Monoid and Group Rings (1998)
- Gröbner bases and Buchberger's algorithm have been generalized to monoid and group rings. In this paper we summarize procedures from this field and present a description of their implementation in the system Mrc V 1.0.

- 19
- A Note on Nielsen Reduction and Coset Enumeration (1998)
- Groups can be studied using methods from different fields such as combinatorial group theory or string rewriting. Recently techniques from Gröbner basis theory for free monoid rings (non-commutative polynomial rings) respectively free group rings have been added to the set of methods due to the fact that monoid and group presentations (in terms of string rewriting systems) can be linked to special polynomials called binomials. In the same mood, the aim of this paper is to discuss the relation between Nielsen reduced sets of generators and the Todd-Coxeter coset enumeration procedure on the one side and the Gröbner basis theory for free group rings on the other. While it is well-known that there is a strong relationship between Buchberger's algorithm and the Knuth-Bendix completion procedure, and there are interpretations of the Todd-Coxeter coset enumeration procedure using the Knuth-Bendix procedure for special cases, our aim is to show how a verbatim interpretation of the Todd-Coxeter procedure can be obtained by linking recent Gröbner techniques like prefix Gröbner bases and the FGLM algorithm as a tool to study the duality of ideals. As a side product our procedure computes Nielsen reduced generating sets for subgroups in finitely generated free groups.

- 18
- Monomial Representations for Gröbner Bases Computations (1998)
- Monomial representations and operations for Gröbner bases computations are investigated from an implementation point of view. The technique ofvectorized monomial operations is introduced and it is shown how it expedites computations of Gröbner bases. Furthermore, a rank-based monomialrepresentation and comparison technique is examined and it is concluded that this technique does not yield an additional speedup over vectorizedcomparisons. Extensive benchmark tests with the Computer Algebra System SINGULAR are used to evaluate these concepts.