Based on an explicit description of the idealization of a graded submodule of a graded free module, we examine the behaviour of Gröbner bases and minimal homogeneous systems of generators under this process. Then we show how one can idealize a homogeneous presentation. Using this theory, we present a unified description of several strategies for computing minimal homogeneous presentations and minimal graded free resolutions, in particular of the vertical and horizontal strategies. We obtain at a simple and compact algorithm for computing minimal graded free resolutions degree‐by‐degree which lends itself well to further optimizations.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com