## Reports on Computer Algebra (ZCA Report)

### Refine

#### Keywords

- Gröbner bases (2)
- coset enumeration (2)
- subgroup problem (2)
- Abelian groups (1)
- Coxeter groups (1)
- Gröbner base (1)
- Gröbner bases in monoid and group rings (1)
- Hamiltonian groups (1)
- Monoid and group rings (1)
- Word problem (1)

- 16
- String Rewriting and Gröbner Bases - A General Approach to Monoid and Group Rings (1997)
- The concept of algebraic simplification is of great importance for the field of symbolic computation in computer algebra. In this paper we review somefundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. Thetechniques for presenting monoids or groups by string rewriting systems are used to define several types of reduction in monoid and group rings. Gröbnerbases in this setting arise naturally as generalizations of the corresponding known notions in the commutative and some non-commutative cases. Severalresults on the connection of the word problem and the congruence problem are proven. The concepts of saturation and completion are introduced formonoid rings having a finite convergent presentation by a semi-Thue system. For certain presentations, including free groups and context-free groups, theexistence of finite Gröbner bases for finitely generated right ideals is shown and a procedure to compute them is given.

- 15
- Splitting algorithm for vector bundles (1997)
- A new criteria for indecomposability of vector bundles on projective varieties is presented. It is deduced from a new finite algorithm computing direct sumdecompositions of graded modules over graded algebras. This algorithm applies as well to modules over local complete algebras over a field.

- 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)

- 14
- Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings (1997)
- A first explicit connection between finitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution tothe word problem in commutative monoids by deciding the ideal membership problem. The aim of this paper is to show in a similar fashion how congruenceson monoids and groups can be characterized by ideals in respective monoid and group rings. These characterizations enable to transfer well known resultsfrom the theory of string rewriting systems for presenting monoids and groups to the algebraic setting of subalgebras and ideals in monoid respectively grouprings. Moreover, natural one-sided congruences defined by subgroups of a group are connected to one-sided ideals in the respective group ring and hencethe subgroup problem and the ideal membership problem are directly related. For several classes of finitely presented groups we show explicitly howGröbner basis methods are related to existing solutions of the subgroup problem by rewriting methods. For the case of general monoids and submonoidsweaker results are presented. In fact it becomes clear that string rewriting methods for monoids and groups can be lifted in a natural fashion to definereduction relations in monoid and group rings.

- 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.

- 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.