arXiv subjects

Ajay P. Joseph

Publications and source records attributed to Ajay P. Joseph.

2 recordsLinked to original sources

arXiv2026

Barile-Macchia Resolutions and the closed neighborhood ideal

We investigate the minimal free resolutions of closed neighborhood ideals of graphs within the framework of Barile-Macchia (BM) resolutions. We show that for any tree $T$, the closed neighborhood ideal $NI(T)$ is bridge-friendly, and hence its BM resolution is minimal. The combinatorial structure of trees further allows us to construct a maximal critical cell of size $α(T)$, leading to the equality $\operatorname{pd}(R/NI(T)) = α(T)$, where $α(T)$ denotes the independence number of $T$ and $\operatorname{pd}$ is the projective dimension. Using Betti splitting techniques, we also obtain explicit formulas for the graded Betti numbers of $NI(P_n)$, where $P_n$ is the path graph on $n$ vertices. Finally, we make some observations on the bridge-friendly condition of the closed neighborhood ideals of chordal and bipartite graphs.

math.AC↗

arXiv2024

Castelnuovo-Mumford regularity of the closed neighborhood ideal of a graph

Let $G$ be a finite simple graph and let $NI(G)$ denote the closed neighborhood ideal of $G$ in a polynomial ring $R$. We show that if $G$ is a forest, then the Castelnuovo-Mumford regularity of $R/NI(G)$ is the same as the matching number of $G$, thus proving a conjecture of Sharifan and Moradi in the affirmative. We also show that the matching number of $G$ provides a lower bound for the Castelnuovo-Mumford regularity of $R/NI(G)$ for any $G$. Furthermore, we prove that, if $G$ contains a simplicial vertex, then $NI(G)$ admits a Betti splitting, and consequently, we show that the projective dimension of $R/NI(G)$ is also bounded below by the matching number of $G$, if $G$ is a forest or a unicyclic graph.

math.AC↗