How beneficial are Gröbner bases for solving systems of equations

Mathematics Asked by Qwaster on December 13, 2020

So I have understood that Gröbner bases are a pretty big deal and have variety of applications. Namely, if you can represent something with a system of polynomial equations you have the Gröbner bases and anything related to them at your disposal. However, what is the relation of Gröbner basis to other available methods? Is it more like so that any system of polynomial equations can always be solved with a Gröbner bases, but computationally might not be the best possible choice; however alternatives to the G-bases might not provide solution at all?

I am trying to understand how Gröbner bases fit into the bigger picture of optimization and solving problems efficiently.

One Answer

There are several improvements you can make on Buchberger's Algorithm for computing Groebner bases, to the point where using other methods usually doesn't make sense. Most computer algebra systems use Groebner bases for their computations since they typically outperform any other method. I think one main reason Groebner bases are so revered is that they provide constructive solutions for many important problems. Take Hilbert's Syzygy Theorem for example. You can prove it using abstract nonsense homological algebra stuff, or you can prove it using Groebner bases. The Groebner basis approach actually gives a recipe for an algorithm to compute finite free resolutions, which is vastly more desirable.

Correct answer by Michael Morrow on December 13, 2020

Add your own answers!

Related Questions

Understanding roots of complicated equations

3  Asked on January 9, 2021 by landon-carter


Order of a Module

0  Asked on January 9, 2021 by user193319


Retract of $F_2$ onto $[F_2,F_2]$

2  Asked on January 8, 2021 by sasha


Ask a Question

Get help from others!

© 2022 All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP