EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Regular edges, matchings and Hilbert series

Joseph Brennan, Susan Morey

Journal of Algebraic Combinatorics · 2026-02 · 63 (1)

DOI: 10.1007/s10801-025-01495-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 10.01.2026. Verfasst von Joseph Brennan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

When I is the edge ideal of a graph G , we use combinatorial properties, 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 .

Zitieren

APA

Brennan, J., & Morey, S. (2026). Regular edges, matchings and Hilbert series. Journal of Algebraic Combinatorics, 63(1). https://doi.org/10.1007/s10801-025-01495-3

Vancouver

Brennan J, Morey S. Regular edges, matchings and Hilbert series. Journal of Algebraic Combinatorics. 2026;63(1). doi:10.1007/s10801-025-01495-3

BibTeX
@article{Brennan2026,
  author = {Brennan, Joseph and Morey, Susan},
  title = {Regular edges, matchings and Hilbert series},
  journal = {Journal of Algebraic Combinatorics},
  year = {2026},
  volume = {63},
  number = {1},
  doi = {10.1007/s10801-025-01495-3}
}
Kostenlos starten →