Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 50 min ago
PreprintCC BY 4.0arXiv

Almost Gorenstein edge rings of bipartite graphs and their h-vectors

Abstract

We characterize bipartite graphs whose edge rings are almost Gorenstein. Using this characterization, we recover known results for two families of graphs. In addition, we show that if the edge ring of a bipartite graph is almost Gorenstein and its h-polynomial has degree at least two, then the h-polynomial is palindromic except possibly for the linear and next-to-leading coefficients. Moreover, we construct two bipartite graphs whose edge rings have the same h-vector, although only one of the rings is almost Gorenstein.

Related

  1. Almost Gorenstein standard graded rings and their localizations
    Naoki Endo
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Betti Sequences of Four-Generated Non-Almost-Symmetric Nearly Gorenstein Numerical Semigroup Rings
    Zhi-Lin Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. A Fitting criterion for quasi-Gorenstein local rings
    Sora Miyashita
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. On classical and Gorenstein homological invariants of rings
    José Manuel Fresneda
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Gorenstein homological properties of n-trivial extensions of rings
    Lixin Mao
    arXivPreprintCC BY-NC-SA 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{hatasa2026almost,
  title = {{Almost Gorenstein edge rings of bipartite graphs and their $h$-vectors}},
  author = {Yuta Hatasa and Koji Matsushita},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01032},
  eprint = {2611.01032},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01032},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Almost Gorenstein edge rings of bipartite graphs and their h-vectors
AU  - Yuta Hatasa
AU  - Koji Matsushita
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01032
UR  - https://arxiv.org/abs/2611.01032
AB  - We characterize bipartite graphs whose edge rings are almost Gorenstein. Using this characterization, we recover known results for two families of graphs. In addition, we show that if the edge ring of a bipartite graph is almost Gorenstein and its h-polynomial has degree at least two, then the h-polynomial is palindromic except possibly for the linear and next-to-leading coefficients. Moreover, we construct two bipartite graphs whose edge rings have the same h-vector, although only one of the rings is almost Gorenstein.
ER  -