Dice Question Streamline Icon: https://streamlinehq.com

Asymptotic inequality between v-number and regularity for graded filtrations

Determine whether, for any Noetherian graded filtration I = {I[k]} of a finitely generated N-graded domain R, the v-number v(I[k]) is strictly less than the Castelnuovo–Mumford regularity reg(I[k]) for all sufficiently large integers k.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper proves that for a Noetherian graded filtration I the v-function k ↦ v(I[k]) is eventually quasi-linear (Theorem 1.3). For many classes of filtrations, Castelnuovo–Mumford regularity is also known to be eventually linear/quasi-linear. The authors ask for a direct asymptotic comparison between these two invariants.

This question seeks to understand whether, in the asymptotic regime, the v-number is always dominated by the regularity for general Noetherian graded filtrations.

References

Question 5.1. Is it true that v(I ) < re[k] ) for all[k]≫ 0?

Asymptotic behaviour of integer programming and the $\text{v}$-function of a graded filtration (2403.08435 - Ficarra et al., 13 Mar 2024) in Question 5.1, Section 5 (Open questions), page 9