In this paper we address the basic problem of computing minimal finite free resolutions of homogeneous submodules of graded free modules over polynomial rings. We develop a strategy, which keeps the resolution minimal at every step. Among the relevant benefits is a marked saving of time, as the firs
✦ LIBER ✦
Constructive finite free resolutions
✍ Scribed by Thierry Coquand; Claude Quitté
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 202 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Computing minimal finite free resolution
✍
A. Capani; G. De Dominicis; G. Niesi; L. Robbiano
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 904 KB
Linear Equations over Commutative Rings
✍
J.A. Hermidaalonso
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 477 KB
Remarks on the Computation of Minimal Fi
✍
Francesca Cioffi
📂
Article
📅
2001
🏛
Springer
🌐
English
⚖ 88 KB
Stiffness of finite free resolutions and
✍
Anne-Marie Simon; Jan R. Strooker
📂
Article
📅
2003
🏛
Elsevier Science
🌐
French
⚖ 103 KB
Free Resolutions of Simplicial Posets
✍
Art M Duval
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 371 KB
A simplicial poset, a poset with a minimal element and whose every interval is a Boolean algebra, is a generalization of a simplicial complex. Stanley defined a ring A associated with a simplicial poset P that generalizes the face-ring of a P w x simplicial complex. If V is the set of vertices of P,
Free resolutions and Koszul homology
✍
Annetta Aramova; Jürgen Herzog
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 887 KB