𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computation of Non-Commutative Gröbner Bases in Grassmann and Clifford Algebras

✍ Scribed by Rafał Abłamowicz

Publisher
Springer
Year
2010
Tongue
English
Weight
350 KB
Volume
20
Category
Article
ISSN
0188-7009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gröbner Bases in Clifford and Grassmann
Gröbner Bases in Clifford and Grassmann algebras
✍ David Hartley; Philip Tuckey 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We give an account of the theory of Gröbner bases for Clifford and Grassmann algebras, both important in physical applications. We describe a characterization criterion tailored to these algebras which is significantly simpler than those given earlier or for more general non-commuting algebras. Our

Computing Gröbner Bases by FGLM Techniqu
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
✍ M.A Borges-Trenard; M Borges-Quintana; T Mora 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A generalization of the FGLM technique is given to compute Gröbner bases for two-sided ideals of free finitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are

Gröbner Bases in Orders of Algebraic Num
Gröbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g