Papers
Topics
Authors
Recent
Search
2000 character limit reached

A universal tale of determinants and Gröbner bases

Published 11 Mar 2024 in math.AC | (2403.07098v1)

Abstract: In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical tool for the investigation of ideals and varieties via the so-called Gr\"obner deformation techniques. Rings and algebraic varieties defined by means of determinants are among the most classical objects in commutative algebra, algebraic geometry and invariant theory. By the end of the the eighties the time was ripe for the computation of Gr\"obner bases of determinantal ideals. We will tell the tale of how (universal) Gr\"obner bases of determinantal ideals were identified and the key role played by Bernd Sturmfels and his collaborators in this enterprise.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.