Applying Buchberger's criteria for computing Gröbner bases over finite-chain rings (Q2853970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6215929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applying Buchberger's criteria for computing Gröbner bases over finite-chain rings |
scientific article; zbMATH DE number 6215929 |
Statements
17 October 2013
0 references
Gröbner bases
0 references
Buchberger's algorithm
0 references
Buchberger's criteria
0 references
finite-chain rings
0 references
Applying Buchberger's criteria for computing Gröbner bases over finite-chain rings (English)
0 references
The authors of this paper prove a version of Buchberger's criteria for Gröbner bases over finite-chain rings, i.e. rings which have only finitely many ideals. Moreover, they generalize the algorithm for the computation of Gröbner bases over Galois rings, i.e. special finite-chain rings, as introduced in [\textit{E. Byrne} and \textit{P. Fitzpatrick}, J. Symb. Comput. 31, No. 5, 565--584 (2001; Zbl 1030.94047)] to arbitrary finite-chain rings. They also show that their version of Buchberger's criteria can be effectively implemented in this generalized algorithm. At last, they give some examples that show that Buchberger's criteria significantly ease the computation of Gröbner bases over Galois rings.
0 references
0.8168450593948364
0 references
0.796761155128479
0 references
0.7955880165100098
0 references
