A universal tale of determinants and Gr\"obner bases
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.