PreprintCC0arXiv
Diagonal F-threshold of binomial edge ideals
Abstract
We compute the diagonal F-threshold of binomial edge ideals associated to graphs in the case of cycles, cycles with whiskers, bipartite graphs, and block graphs. Moreover, we provide general bounds for any graph.
Related
- On the Hilbert Series and Multiplicity of Generalized Binomial Edge Ideals
- Binomial edge ideals of bipartite complements of even cycles
- Combinatorial bounds for the v-number of binomial edge ideals
- Regularity and depth of binomial ideals arising from combinatorics
- Weakly Newton-nondegenerate binomial ideals
BibTeX
@misc{rinaldo2026diagonal,
title = {{Diagonal F-threshold of binomial edge ideals}},
author = {Giancarlo Rinaldo and Francesco Romeo},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.28083},
eprint = {2608.28083},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.28083},
note = {CC0},
}
RIS
TY - UNPB
TI - Diagonal F-threshold of binomial edge ideals
AU - Giancarlo Rinaldo
AU - Francesco Romeo
PY - 2026
DA - 2026/08/28
PB - arXiv
DO - 10.48550/arxiv.2608.28083
UR - https://arxiv.org/abs/2608.28083
AB - We compute the diagonal F-threshold of binomial edge ideals associated to graphs in the case of cycles, cycles with whiskers, bipartite graphs, and block graphs. Moreover, we provide general bounds for any graph.
ER -