The replenishment algorithm in algebras of sets (Q2058702)
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 7441885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The replenishment algorithm in algebras of sets |
scientific article; zbMATH DE number 7441885 |
Statements
The replenishment algorithm in algebras of sets (English)
0 references
9 December 2021
0 references
In [Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Innsbruck: Univ. Innsbruck, Mathematisches Institut (Diss.) (1965; Zbl 1245.13020)] \textit{B. Buchberger} described an algorithm, known as Buchberger's algorithm, for the construction of Gröbner bases. In this paper, the authors present an analogue of this algorithm (see also the Knuth-Bendix algorithm) for the computation of standard bases in algebras of finite, numerical, and linear semialgebraic sets, as well as in the algebra of multisets. They refer to this algorithm as the replenishment algorithm and it can be used mainly to solve the membership problem in the mentioned kinds of algebras. Furthermore, they apply the replenishment algorithm to solve some algorithmic problems in the algebra of linear semialgebraic sets.
0 references
replenishment algorithm
0 references
constructive algebras of sets
0 references
standard basis
0 references
0.8645468
0 references
0 references
0.8525511
0 references
0 references
0.84890014
0 references
0.8472188
0 references
0 references
