Tietze transformations with weighted substring search (Q1110650): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Joachim Neubüser / rank | |||
Property / reviewed by | |||
Property / reviewed by: Joachim Neubüser / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3220735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some computations of non-Abelian tensor products of groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Presentations for the simple groups g, l0<sup>5</sup>≪ |g| < 10<sup>6</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3222359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686870 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3217271 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Groups of exponent five and class four / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The last of the Fibonacci groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3877854 / rank | |||
Normal rank |
Latest revision as of 19:31, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tietze transformations with weighted substring search |
scientific article |
Statements
Tietze transformations with weighted substring search (English)
0 references
1988
0 references
Implementations of Tietze transformations have been used both interactively and in the framework of simplification routines that follow certain strategies. They serve to find presentations with few generators and/or relations from given ones as well as to reduce presentations of subgroups of finite index in finitely presented groups that have been constructed by the Reidemeister-Schreier or the Modified Todd-Coxeter method. Because of the unsolvability of the word problem and related problems there is no ``best'' strategy for the simplification of presentations; each strategy follows certain heuristic rules as to which subwords to replace. The author reports about rather successful experiments with certain such rules influencing the elimination process by the assignment of weights to generators. A Tietze program in FORTRAN 77 incorporating these ideas is available from the author.
0 references
Reidemeister-Schreier program
0 references
Tietze transformations
0 references
presentations
0 references
generators
0 references
relations
0 references
subgroups of finite index
0 references
finitely presented groups
0 references
simplification of presentations
0 references
Tietze program
0 references