The big mother of all dualities: Moller algorithm

被引：11

作者：

Alonso, ME ^{[1
]}

Marinari, MG

Mora, T

机构：

[1] Univ Complutense Madrid, Fac CC Matemat, Dept Algebra, E-28040 Madrid, Spain

[2] Univ Genoa, DIMA, Genoa, Italy

[3] Univ Genoa, DISI, Genoa, Italy

来源：

COMMUNICATIONS IN ALGEBRA | 2003年 / 31卷 / 02期

关键词：

Groebner bases; polynomial systems; Artinian rings;

D O I：

10.1081/AGB-120017343

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Duality was introduced in Computer Algebra in 1982 by MoIler and since that has been widely used. We give a survey of Moller algorithm and its applications, presenting a new one to the computation of canonical modules. "Its dual application" allow us to give answer to a question posed to us by Stetter.

引用

页码：783 / 818

页数：36

共 30 条

[1] Computing ideals of points [J].

Abbott, J ;

Bigatti, A ;

Kreuzer, M ;

Robbiano, L .

JOURNAL OF SYMBOLIC COMPUTATION, 2000, 30 (04) :341-356

[2]

ALONSO ME, 1992, P 1992 INT WORKSH MA, P135

[3]

ALONSO ME, 2000, GROBNER KREUZER ALGO

[4]

AUZINGER W, 1988, INT SCHRIFTENREIHE N, V86, P11

[5]

Beck S, 1996, PROG MATH, V143, P51

[6] Computing Grobner bases by FGLM techniques in a non-commutative setting [J].

Borges-Trenard, MA ;

Borges-Quintana, M ;

Mora, T .

JOURNAL OF SYMBOLIC COMPUTATION, 2000, 30 (04) :429-449

[7]

BUCHBERGER B, 1982, LECT NOTES COMPUTER, V144, P24

[8]

CERLIENCO L, 1990, 24 SESS SEM LOTH COM, P39

[9]

CIOFFI F, 2001, P ISSAC 01 ACM, P72

[10]

CIOFFI F, 1999, RIC MAT, V47, P55

← 1 2 3 →