DeepAI
Log In Sign Up

Gröbner Bases with Reduction Machines

09/04/2019
by   Georgiana Şurlea, et al.
0

In this paper, we make a contribution to the computation of Gröbner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we investigate what happens if we make that choice arbitrarily. It turns out not only this is possible (the fact that this produces a normal form being already known in the literature), but, for a fixed choice of reductors, the obtained normal form is the same no matter the order in which we reduce the monomials. To prove this, we introduce reduction machines, which work by reducing each monomial independently and then collecting the result. We show that such a machine can simulate any such reduction. We then discuss different implementations of these machines. Some of these implementations address inherent inefficiencies in reduction machines (repeating the same computations). We describe a first implementation and look at some experimental results.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/08/2021

Macaulay bases of modules

We define Macaulay bases of modules, which are a common generalization o...
03/06/2017

A lattice formulation of the F4 completion procedure

We write a procedure for constructing noncommutative Groebner bases. Red...
01/23/2017

Criteria for Finite Difference Groebner Bases of Normal Binomial Difference Ideals

In this paper, we give decision criteria for normal binomial difference ...
09/15/2017

Confluence and Convergence in Probabilistically Terminating Reduction Systems

Convergence of an abstract reduction system (ARS) is the property that a...
01/10/2021

A New Type of Bases for Zero-dimensional Ideals

We formulate a substantial improvement on Buchberger's algorithm for Grö...
05/10/2017

Model Order Reduction for Rotating Electrical Machines

The simulation of electric rotating machines is both computationally exp...
11/06/2020

Accelerating combinatorial filter reduction through constraints

Reduction of combinatorial filters involves compressing state representa...