Resolving Decompositions of Polynomial Modules
|
Co-author(s): Mario Albert |
Reference: Computer Algebra in Scientific Computing - CASC 2016,
V.P. Gerdt, W. Koepf, W.M. Seiler, E.V. Vorozhtsov (eds.), Springer-Verlag,
Berlin 2016, Lecture Notes in Computer Science 9890, pp. 15-29 |
Description: We provide a unifying framework for some results of
[32,
95,
41]
and for some generalisations of them. Starting
with the axiomatic definition of a resolving decomposition as a basis
inducing simultaneous combinatorial decompositions of the generated module
and an associated monomial module and a normal form, we show first a
Schreyer Theorem for the underlying basis and discuss then the construction
of free resolutions based on it. |
PDF File: (311 kB)
|
Home,
Last update:
Sat Oct 1 15:35:48 2016
|