Grobner bases are a powerful tool in polynomial ideal theory with many applications in various areas of science and engineering. A Grobner basis is a particular generating set for a given ideal which represents many useful properties of the ideal. The general theory of Grobner bases along with the first algorithm for constructing them were introduced by Buchberger in 1965 in his Ph.D. thesis. An staggered linear basis is indeed a linear basis containing a Grobner basis for a given ideal. This notion was first introduced by Gebauer and Moller in 1988, however the algorithm that they described for computing these bases was not complete. In this talk, we first give a brief overview on the theory of Grobner bases (as well as of staggered linear bases) and then present a simple algorithm for computing staggered linear bases.

https://zoom.us/join
Meeting ID: 9086116889
Passcode: 362880