The v-number of generalized binomial edge ideals of some graphs
Abstract
Let G be a finite connected simple graph, and let JKm,G denote its generalized binomial edge ideal. By investigating the colon ideals of JKm,G, we derive a formula for the local v-number of JKm,G with respect to the empty cut set. Furthermore, we classify graphs for which this generalized binomial edge ideal has v-numbers 1 or 2. When G is a connected closed graph, we compute the local v-number of JK2,G by generalizing the work of Dey et al. Additionally, under the condition that G is Cohen--Macaulay, we derive formulas for the v-number of JKm,G and JK2,Gk, and show that the v-number of JK2,Gk is a linear function of k.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.