Collection from the left (Q917695)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Collection from the left |
scientific article |
Statements
Collection from the left (English)
0 references
1990
0 references
In finite p-groups there exists a normal form for the elements, the so- called power-commutator presentation, which mainly is used in dealing with computational questions. The problem of finding an optimal algorithm for the calculation of the normal form of the product of two such elements is one of the most important in computational group theory. A fast algorithm is based on the so-called collection from the left, a new version of which is presented in this paper.
0 references
Havas-Nicholson algorithm
0 references
finite p-groups
0 references
normal form
0 references
power-commutator presentation
0 references
computational group theory
0 references
fast algorithm
0 references
collection from the left
0 references
