We present an algorithm for computing Gröbper and free canonical Schreier bestes for finitely generated ono-sided ideals in free group algebras. That is, given a zet of \(n\) elements of a free group algebra, we construct a canonical Schrejer basie of free generators as well an a Gröbnar basis for t
✦ LIBER ✦
An algorithm for constructing gröbner bases from characteristic sets and its application to geometry
✍ Scribed by Shang-Ching Chou; William F. Schelter; Jin-Gen Yang
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 347 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An Algorithm for Constructing Gröbner an
✍
Amnon Rosenmann
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 915 KB
An Optimal Algorithm for Constructing th
✍
Ulla Koppenhagen; Ernst W. Mayr
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 404 KB
It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper
An algorithm for clustering profile data
✍
Estabrook, G. F. ;Outcalt, S.
📂
Article
📅
1984
🏛
Springer
🌐
English
⚖ 748 KB