Combinatorial Bounds of the Regularity of Elimination Ideals
Ars Combinatoria · 2023
DOI: 10.61091/ars156-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, 2023. Verfasst von Muhammad Junaid Ali Junjua und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Elimination ideals are monomial ideals associated to simple graphs, not necessarily square–free, was introduced by Anwar and Khalid. These ideals are Borel type. In this paper, we obtain sharp combinatorial upper bounds of the Castelnuovo–Mumford regularity of elimination ideals corresponding to certain family of graphs.
Zitieren
APA
Junjua, M. J. A., Shabbir, K., & Naseem, A. (2023). Combinatorial Bounds of the Regularity of Elimination Ideals. Ars Combinatoria. https://doi.org/10.61091/ars156-3
Vancouver
Junjua MJA, Shabbir K, Naseem A. Combinatorial Bounds of the Regularity of Elimination Ideals. Ars Combinatoria. 2023. doi:10.61091/ars156-3
BibTeX
@article{Junjua2023,
author = {Junjua, Muhammad Junaid Ali and Shabbir, Khurram and Naseem, Asim},
title = {Combinatorial Bounds of the Regularity of Elimination Ideals},
journal = {Ars Combinatoria},
year = {2023},
doi = {10.61091/ars156-3}
}
EUVIMED