A lattice formulation of the F4 completion procedure

03/06/2017
by   Chenavier Cyrille, et al.
0

We write a procedure for constructing noncommutative Groebner bases. Reductions are done by particular linear projectors, called reduction operators. The operators enable us to use a lattice construction to reduce simultaneously each S-polynomial into a unique normal form. We write an implementation as well as an example to illustrate our procedure. Moreover, the lattice construction is done by Gaussian elimination, which relates our procedure to the F4 algorithm for constructing commutative Groebner bases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2017

Syzygies among reduction operators

We introduce the notion of syzygy for a set of reduction operators and r...
research
05/09/2018

Computing an LLL-reduced basis of the orthogonal lattice

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduc...
research
09/04/2019

Gröbner Bases with Reduction Machines

In this paper, we make a contribution to the computation of Gröbner base...
research
07/15/2019

Topological rewriting systems applied to standard bases and syntactic algebras

We propose a functional description of rewriting systems on topological ...
research
01/12/2021

Lattice reduction by cubification

Lattice reduction is a NP-hard problem well known in computer science an...
research
07/10/2018

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder

Zero-forcing (ZF) decoder is a commonly used approximation solution of t...
research
02/28/2023

Now It Compiles! Certified Automatic Repair of Uncompilable Protocols

Choreographic programming is a paradigm where developers write the globa...

Please sign up or login with your details

Forgot password? Click here to reset