Moreno-Socias's generic weakly-grevlex ideal conjecture
Moreno-Socias's generic weakly-grevlex ideal conjecture
Let be an infinite field, let be the polynomial ring under consideration, and let denote its degree- homogeneous component. For and , consider tuples and the ideal . An ideal is weakly-grevlex if it is weakly--ideal for the graded reverse lexicographic monomial order .
Moreno-Socias's conjecture. There is a non-empty Zariski-open subset such that every generates an ideal that is weakly-grevlex.
The conjecture asserts that weakly-grevlex behavior is generic for ideals generated by homogeneous polynomials of prescribed degrees over an infinite field. If true, this would provide a broad class of inputs for which the Matrix-F5 algorithm can avoid the ambiguity caused by non-pivot columns and certify an approximate Gröbner basis.
Sources & referencesView supporting material
Primary source
Tristan Vaccon, “Matrix-F5 algorithms over finite-precision complete discrete valuation fields”, arXiv:1403.5464 (2015).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.