arXiv · 2412.10335
Regular Edges, Matchings and Hilbert Series
Abstract
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild separability assumption, we identify when such elements can be combined to form a regular sequence. Using these regular sequences, we show that the Hilbert series and corresponding $h$-vector can be calculated from a related graph using a simplified calculation on the $f$-vector, or independence vector, of the related graph. In the case when the graph is Cohen-Macaulay with a perfect matching of regular edges satisfying the separability criterion, the $h$-vector of $R/I(G)$ will be precisely the $f$-vector of the Stanley-Reisner complex of a graph with half as many vertices as $G$.
Explore related subjects
Keep this discovery
Joseph Brennan, Susan Morey. 2024-12-13. Regular Edges, Matchings and Hilbert Series. https://arxiv.org/abs/2412.10335
Cite the original work for its findings. Save a collection to share your selection of sources.