Gareth Alun Evans

Learn More
Gröbner Basis theory originated in the work of Buchberger [4] and is now considered to be one of the most important and useful areas of computer algebra. In 1993, Zharkov and Blinkov [13] proposed an alternative method of computing a commutative Gröbner Basis, namely the computation of an Involutive Basis. In the mid 1980's, Mora showed [11] that(More)
The Human Genome Project (HGP), an international program to decode the entire DNA sequence of the human genome in 15 years, represents the largest biological experiment ever conducted. This set of information will contain the blueprint for the construction and operation of a human being. While the primary driving force behind the genome project is the(More)
Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M. This article develops an alternative approach, using noncommutative involutive basis(More)
Preface CMCS – the International Workshop on Coalgebraic Methods in Computer Science , and WADT – the Workshop on Algebraic Development Techniques, have joined their forces and reputations into a new high-level biannual conference. Starting in 2005, CALCO brings together researchers and practitioners to exchange new results related to foundational aspects(More)
Buchberger's algorithm for computing a Gröbner basis solves the ideal membership problem over commutative polynomial rings. In the early 1990's, an alternative to this algorithm was found, namely the involutive basis algorithm, which provides a Gröbner basis with extra combinatorial properties. Buchberger's work was generalised to noncommuta-tive polynomial(More)
  • 1