Resolving Decompositions of Polynomial Modules |
Co-author(s): Mario Albert |
Reference: In preparation |
Description: We provide a unifying framework for some results of [32, 91, 41] and for some generalisations of them. Starting with the axiomatic definition of a resolving decomposition as a basis defining a combinatorial decomposition and a division algorithm, we show first a Schreyer Theorem for such bases and discuss then the construction of free resolutions based on it. |
File: sorry, no downloadable file available |
Home, Last update: Thu Mar 24 19:36:48 2016 |