Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.05567 v1 pith:7BSZCAVP submitted 2024-06-08 math.AC

classification math.AC
keywords mathrmbinomialexpansionformulafunctionmonomialsubsetanalogous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    math.AC 2025-07 conditional novelty 7.0 of 10

    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 o...

Pith tools