For edge ideals of connected graphs, the v-number can be arbitrarily larger or smaller than the degree of the h-polynomial, their sum is at most the number of vertices, and equality holds exactly for disjoint unions of star graphs.
Binomial expansion and the $\mathrm{v}$-number
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Let $I\subset A$ and $J\subset B$ be two monomial ideals, where $A$ and $B$ are two polynomial rings with disjoint variables. Considering a general set-up of monomial filtrations, we study the behaviour of the $\mathrm{v}$-function under binomial expansion. As an application, we get an explicit formula of $\mathrm{v}((I+J)^{(k)})$ in terms of $\mathrm{v}(I^{(i)})$ and $\mathrm{v}(J^{(j)})$, where $L^{(k)}$ denote the symbolic power of an ideal $L$. Furthermore, an analogous formula is extended for the $\mathrm{v}$-function of integral closure of $(I+J)^k$.
citation-role summary
citation-polarity summary
fields
math.AC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Comparing the $\mathrm{v}$-number and $h$-polynomials of edge ideals
For edge ideals of connected graphs, the v-number can be arbitrarily larger or smaller than the degree of the h-polynomial, their sum is at most the number of vertices, and equality holds exactly for disjoint unions of star graphs.