Admissible orderings and bounds for Gröbner basis normal form algorithms
✍ Scribed by T. Dubé, Bud Mishra, Chee-Keng Yap
- Year
- 1995
- Tongue
- English
- Leaves
- 28
- Series
- preprint?
- Edition
- version 6 Jul 1995
- Category
- Library
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
<P>This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. </P> <P>Topics covered include coherent configur
The book is about (associative, Lie and other) algebras, groups, semigroups presented by generators and defining relations. They play a great role in modern mathematics. It is enough to mention the quantum groups and Hopf algebra theory, the Kac-Moody and Borcherds algebra theory, the braid groups a