The replenishment algorithm in algebras of sets

DOI10.1007/S10559-021-00407-0MaRDI QIDQ2058702zbMATH OpenOpenAlexFDO

Authors M. S. Lvov, Y. Tarasich

Publication date 9 December 2021

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-021-00407-0

zbMATH Keywords

constructive algebras of setsreplenishment algorithmstandard basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational real algebraic geometry (14Q30) Symbolic computation and algebraic computation (68W30)

Review text

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.

Recommendations

• Efficient simplicial replacement of semialgebraic sets
• Algebras of complemented subsets
• A new symbolic representation for the algebra of sets
• The algebraic completion of posets
• scientific article; zbMATH DE number 3982488
• scientific article; zbMATH DE number 4043899
• Algebra and theory of order-deterministic pomsets
• On some classes of algorithmic algebras
• Algorithms in A_-algebras

Cites work

• Algebraic approach to the problem of solving systems of linear inequalities
• Algebraic simplification
• Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
• scientific article; zbMATH DE number 3896290 (Why is no real title available?)
• scientific article; zbMATH DE number 3952003 (Why is no real title available?)
• scientific article; zbMATH DE number 3478840 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• Polynomial invariants for linear loops

Cited in

(1)

• Disjunctive bases of applied algebras of sets and their use in problems of combinatorial geometry

This page was built for publication: The replenishment algorithm in algebras of sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2058702)