Moreno-Socias's generic weakly-grevlex ideal conjecture

Let kk be an infinite field, let AA be the polynomial ring under consideration, and let AdiA_{d_i} denote its degree-did_i homogeneous component. For sNs\in\mathbb{N} and d1,,dsNd_1,\dots,d_s\in\mathbb{N}, consider tuples (f1,,fs)Ad1××Ads(f_1,\dots,f_s)\in A_{d_1}\times\dots\times A_{d_s} and the ideal I=(f1,,fs)I=(f_1,\dots,f_s). An ideal is weakly-grevlex if it is weakly-ww-ideal for the graded reverse lexicographic monomial order ww.

Moreno-Socias's conjecture. There is a non-empty Zariski-open subset UAd1××AdsU\subseteq A_{d_1}\times\dots\times A_{d_s} such that every (f1,,fs)U(f_1,\dots,f_s)\in U generates an ideal I=(f1,,fs)I=(f_1,\dots,f_s) 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

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.