Finite universal Sagbi basis conjecture for the Grassmannian coordinate ring

Let G(m,n)G(m,n) denote the Grassmannian, and let a universal Sagbi basis mean a finite generating set that is a Sagbi basis for every monomial order. Finite universal Sagbi basis conjecture. G(m,n)G(m,n) has a finite universal Sagbi basis. The preceding results establish this experimentally in several cases for m=3m=3, but the general assertion remains open.

Sources & referencesView supporting material

Primary source

Winfried Bruns and Aldo Conca, “Sagbi combinatorics of maximal minors and a Sagbi algorithm”, arXiv:2302.14345 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.