Metraipolis › archive › dc_2372155fa136

Almost Gorenstein edge rings of bipartite graphs and their $h$-vectors — arXiv:2611.01032

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.01032
License (as archived): CC0-1.0
Archived: 2026-11-04T19:00:26.897Z
SHA-256 of the archived text: 361ad1a45d970f77d81b99cf3dd1889254bfc1c6a1f43a037bb55ab756418350
Stable URL of this page: https://metraipolis.com/documento/dc_2372155fa136

How to cite

Almost Gorenstein edge rings of bipartite graphs and their $h$-vectors — arXiv:2611.01032 — arXiv (en), https://arxiv.org/abs/2611.01032 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2372155fa136 (Metraipolis archive dc_2372155fa136, sha256 361ad1a45d970f77d81b99cf3dd1889254bfc1c6a1f43a037bb55ab756418350)

BibTeX

@misc{dc2372155fa136,
  title = {Almost Gorenstein edge rings of bipartite graphs and their $h$-vectors — arXiv:2611.01032},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01032},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2372155fa136; sha256 361ad1a45d970f77d81b99cf3dd1889254bfc1c6a1f43a037bb55ab756418350},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01032. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Commutative Algebra (math.AC) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01032 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:22.329Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).