Computing Finite and Infinite Free Resolutions with Pommaret-Like Bases
Co-author(s): Amir Hashemi and Matthias Orth
Reference: Journal of Symbolic Computation, 131 (2025) 102454 (32 pages)
Description: As shown in particular in [32] , Pommaret bases are well suited for computing resolutions and allow for the easy determination of the Castelnuovo-Mumford regularity and the projective dimension. In this work, we generalise these ideas to Pommaret-like bases which are usually smaller. Furthermore, we show that they can also be applied to ideals in quotient rings. For the case of Clements-Lindström rings, we characterise some classes of ideals where one even obtains a minimal resolution.
PDF File: PDF (422 kB)
Home, Last update: Fri May 16 11:46:23 2025