Pith. sign in

Binomial expansion and the $\mathrm{v}$-number

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

background 1

citation-polarity summary

fields

math.AC 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Comparing the $\mathrm{v}$-number and $h$-polynomials of edge ideals

math.AC · 2025-07-08 · conditional · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Comparing the $\mathrm{v}$-number and $h$-polynomials of edge ideals math.AC · 2025-07-08 · conditional · none · ref 33 · internal anchor

    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.