arXiv subjects

Prativa Biswas

Publications and source records attributed to Prativa Biswas.

4 recordsLinked to original sources

arXiv2026

A comparison of the v-number of a monomial ideal and its integral closure

Let $I$ be a monomial ideal in a standard graded polynomial ring and let $\overline{I}$ denote its integral closure. We study the relationship between $\mathrm{v}(I)$ and $\mathrm{v}(\overline{I})$. We prove that $\mathrm{v}(\overline{I}) \leq \mathrm{v}(I)$ for monomial ideals in two variables, for equigenerated monomial ideals in three variables and for several special classes of monomial ideals, while providing examples showing that this inequality does not hold in general. For the edge ideal $I(G)$ of a connected graph $G$, we show that $\mathrm{v}(I(G)^k)=\mathrm{v}(\overline{I(G)^k}) = 2k-1$ for all $k \geq 1+|E(G)|$. Moreover, when $G$ is disconnected, we prove that $\mathrm{v}(\overline{I(G)^k})\leq\mathrm{v}({I(G)^k})$ for all sufficiently large $k$.

math.AC↗

arXiv2026

Lattice points arising from regularity and $\mathrm{v}$-number of Graphs: Whisker and Cameron-Walker

Let $G$ be a simple graph on $n$ vertices and $I(G)\subseteq R$ be its edge ideal. In this paper, we initiate the study of determining lattice points in $\mathbb{N}^2$ that appear as a pair $(\mathrm{reg}(R/I(G)), \mathrm{v}(I(G)))$, where $G$ ranges over all connected graphs on $n$ vertices, and we denote this set by $\mathcal{RV}(n)$. Here `$\mathrm{reg}$' denotes the (Castelnuovo-Mumford) regularity and `$\mathrm{v}$' denotes the $\mathrm{v}$-number. We establish general bounds for $\mathcal{RV}(n)$ by identifying two sets $A(n)$ and $B(n)$ satisfying $A(n)\subseteq \mathcal{RV}(n)\subseteq B(n)$. Furthermore, we explicitly determine the subsets of $\mathcal{RV}(n)$ consisting of all possible pairs $(\mathrm{reg}(R/I(G)), \mathrm{v}(I(G)))$ arising from whisker graphs and Cameron-Walker graphs on $n$ vertices. Finally, we propose a conjecture on the subset of $\mathcal{RV}(n)$ arising from connected chordal graphs.

math.AC↗

arXiv2024

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

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.

math.AC↗

arXiv2023

A study of $v$-number for some monomial ideals

In this paper, we give formulas for $v$-number of edge ideals of some graphs like path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two cycles and join of two graphs. For an $\mathfrak{m}$-primary monomial ideal $I\subset S=K[x_1,\ldots,x_t]$, we provide an explicit expression of $v$-number of $I$, denoted by $v(I)$, and give an upper bound of $v(I)$ in terms of the degree of its generators. We show that for a monomial ideal $I$, $v(I^{n+1})$ is bounded above by a linear polynomial for large $n$ and for certain classes of monomial ideals, the upper bound is achieved for all $n\geq 1$. For $\mathfrak m$-primary monomial ideal $I$ we prove that $v(I)\leq$ reg$(S/I)$ and their difference can be arbitrarily large.

math.AC↗