Table of Contents
Fetching ...

Asymptotic behaviour and stability index of v-numbers of graded ideals

Prativa Biswas, Mousumi Mandal, Kamalesh Saha

Abstract

Recently, Ficarra and Sgroi initiated the study of v-numbers of powers of graded ideals. They proved that for a graded ideal $I$ in a polynomial ring $S$, $\mathrm{v}(I^k)$ is a linear function in $k$ for $k>>0$. Later, Ficarra conjectured that if $I$ is a monomial ideal with linear powers, then $\mathrm{v}(I^k)=α(I)k-1$ for all $k\geq 1$, where $α(I)$ denotes the initial degree of $I$. In this paper, we generalize this conjecture for graded ideals. We prove this conjecture for several classes of graded ideals: principal ideals, ideals $I$ with $\mathrm{depth}(S/I)=0$, cover ideals of graphs, $t$-path ideals, monomial ideals generated in degree $2$, edge ideals of weighted oriented graphs. We reduce the conjecture for several classes of graded ideals (including square-free monomial ideals) by showing it is enough to prove the conjecture for $k=1$ only. We define the stability index of the $\mathrm{v}$-number for graded ideals and investigate the stability index for edge ideals of graphs.

Asymptotic behaviour and stability index of v-numbers of graded ideals

Abstract

Recently, Ficarra and Sgroi initiated the study of v-numbers of powers of graded ideals. They proved that for a graded ideal in a polynomial ring , is a linear function in for . Later, Ficarra conjectured that if is a monomial ideal with linear powers, then for all , where denotes the initial degree of . In this paper, we generalize this conjecture for graded ideals. We prove this conjecture for several classes of graded ideals: principal ideals, ideals with , cover ideals of graphs, -path ideals, monomial ideals generated in degree , edge ideals of weighted oriented graphs. We reduce the conjecture for several classes of graded ideals (including square-free monomial ideals) by showing it is enough to prove the conjecture for only. We define the stability index of the -number for graded ideals and investigate the stability index for edge ideals of graphs.
Paper Structure (5 sections, 21 theorems, 28 equations)

This paper contains 5 sections, 21 theorems, 28 equations.

Key Result

Theorem 2.9

ban Every generator $uv$$(u$ may be equal to $v)$ of $(I(G)^{s+1}:e_1e_2\ldots e_s)$ is either an edge of $G$ or even-connected with respect to $e_1\ldots e_s,~s\geq1.$

Theorems & Definitions (64)

  • Definition 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Definition 2.5
  • Definition 2.6
  • Definition 2.7
  • Definition 2.8: ban
  • Theorem 2.9
  • Definition 2.10
  • ...and 54 more