Computing Gr\"obner Bases and Free Resolutions of OI-Modules

arXiv2303.06725MaRDI QIDQ6429263FDOQ6429263

Publication date: 12 March 2023

Abstract: Given a sequence of related modules

M_{n}

defined over a sequence of related polynomial rings, one may ask how to simultaneously compute a finite Gr"obner basis for each

M_{n}

. Furthermore, one may ask how to simultaneously compute the module of syzygies of each

M_{n}

. In this paper we address both questions. Working in the setting of OI-modules over a Noetherian polynomial OI-algebra, we provide OI-analogues of Buchberger's Criterion, Buchberger's Algorithm for computing Gr"obner bases, and Schreyer's Theorem for computing syzygies. We also establish a stabilization result for Gr"obner bases.

Has companion code repository: https://github.com/morrowmh/oigroebnerbases

This page was built for publication: Computing Gr\"obner Bases and Free Resolutions of OI-Modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429263)