Syzygies among reduction operators

08/29/2017
by   Cyrille Chenavier, et al.
0

We introduce the notion of syzygy for a set of reduction operators and relate it to the notion of syzygy for presentations of algebras. We give a method for constructing a linear basis of the space of syzygies for a set of reduction operators. We interpret these syzygies in terms of the confluence property from rewriting theory. This enables us to optimise the completion procedure for reduction operators based on a criterion for detecting useless reductions. We illustrate this criterion with an example of construction of commutative Gröbner basis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2017

A lattice formulation of the F4 completion procedure

We write a procedure for constructing noncommutative Groebner bases. Red...
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/15/2016

A Method for Image Reduction Based on a Generalization of Ordered Weighted Averaging Functions

In this paper we propose a special type of aggregation function which ge...
research
04/07/2022

Algebraic Structure of the Weak Stage Order Conditions for Runge-Kutta Methods

Runge-Kutta (RK) methods may exhibit order reduction when applied to sti...
research
09/21/2021

Adding Negation to Lambda Mu

We present L, an extension of Parigot's λμ-calculus by adding negation a...
research
05/09/2018

Generalized Hermite Reduction, Creative Telescoping and Definite Integration of D-Finite Functions

Hermite reduction is a classical algorithmic tool in symbolic integratio...
research
10/07/2021

Bisimulations for Neural Network Reduction

We present a notion of bisimulation that induces a reduced network which...

Please sign up or login with your details

Forgot password? Click here to reset