Math 2.0

Associative rings and algebras Computation Concept

Noncommutative Gröbner basis

Summary

A noncommutative Gröbner basis, or Gröbner–Shirshov basis, generates a two-sided ideal of a free algebra k⟨X⟩k\langle X \rangle. Its leading words control the leading words of all elements of the ideal. It extends the commutative Gröbner basis from polynomial rings to free algebras, with words in place of monomials. The words that avoid all leading words give a linear basis of the quotient algebra. So a Gröbner basis solves the normal form problem for an algebra given by generators and relations. Unlike the commutative case, a finitely generated ideal may have no finite Gröbner basis, and the completion procedure need not terminate.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gr%C3%B6bner_basis
About this page
TagEPPR3DAFP6
URIm2://EPPR3DAFP6
Kindconcept
WritingW0 stub
MSC16Z10, 16S15

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions