SAGBI and Gröbner Bases Detection

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Borovik, Viktoriia, Duff, Timothy, Shehu, Elima
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911853376962560
author Borovik, Viktoriia
Duff, Timothy
Shehu, Elima
author_facet Borovik, Viktoriia
Duff, Timothy
Shehu, Elima
contents We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gröbner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named SagbiGbDetection for Macaulay2 and Julia. Both packages allow the user to find one or more term orders for which a set of input polynomials form either Gröbner basis for the ideal they generate or a SAGBI basis for the subalgebra. Additionally, we investigate the computational complexity of homogeneous SAGBI detection and apply our implementation to several novel examples.
format Preprint
id arxiv_https___arxiv_org_abs_2404_16796
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle SAGBI and Gröbner Bases Detection
Borovik, Viktoriia
Duff, Timothy
Shehu, Elima
Commutative Algebra
Algebraic Geometry
We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gröbner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named SagbiGbDetection for Macaulay2 and Julia. Both packages allow the user to find one or more term orders for which a set of input polynomials form either Gröbner basis for the ideal they generate or a SAGBI basis for the subalgebra. Additionally, we investigate the computational complexity of homogeneous SAGBI detection and apply our implementation to several novel examples.
title SAGBI and Gröbner Bases Detection
topic Commutative Algebra
Algebraic Geometry
url https://arxiv.org/abs/2404.16796