When Zharkov and Blinkov ([ZB93]) applied the classical ideas of involutive systems originating from the theory of partial dierential equations (c.f. [Ja29],[Po78]) to the computation of Gr obner bases (c.f. [Bu65],[BW93]) their theory seemed to be a rather marginal concept. But due to the opportunity of gaining a faster version for one of the most frequently applied algorithms the method came...

The determination of a set of geometric entities that satisfy a series of geometric relations (constraints) constitutes the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem. This problem appears in diierent forms in Assembly Planning, Constraint Driven Design, Computer Vision, etc. Its solution is related to the existence of roots to systems of polynomial equations. Previ...

p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transfor...

In the thesis we have investigated the complexity of proofs in several propositional proof systems. Our main motivation has been to contribute to the line of research started by Cook and Reckhow to obtain how much knowledge as possible about the complexity of di erent proof systems to show that there is no super proof system. We also have been motivated by more applied questions concerning the ...

Shapes such as triangles or rectangles can be defined in terms of geometric properties invariant under a group of transformations. Complex shapes can be described by logic formulae w i th simpler shapes as the atoms. A standard technique for computing invariant properties of simple shapes is the method of moment invariants, known since the early sixties. We generalize this technique to shapes d...

In this paper, it is proved that any algehraicgeometr ic code can be expressed as a cross section of an extended multidimensional cyclic code. Both algebraic-geometric codes and multidimensional cyclic codes are descr ibed by a unified theory of l inear block codes def ined over point sets: algebraic-geometric codes are def ined over the points of an algebraic curve, and an m-dimensional cyclic...

Abstract: This is the first of two articles devoted to a exposition of the generatingfunction method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit of fusions rules. We start by reviewing Sharp’s character method. An alternative approach to the construction of tensor-product generating functions ...

We present a new method that addresses the various deficiencies of the state-ofthe-art non-linear invariant generation methods for hybrid systems. Present approaches for non-linear invariant generation are limited to linear systems, or they relay on non scalable methods which have high complexity. Moreover, for hybrid systems with discrete transitions, differential rules, and local conditions t...

Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Gröbner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, firstly, a gener...

It is well known that the standard bracketings of Lyndon words in an alphabet A form a basis for the free Lie algebra Lie(A) generated by A . Suppose that g 2 Lie(A)/J is a Lie algebra given by a generating set A and a Lie ideal J of relations. Using a Grobner basis type approach we define a set of "standard" Lyndon words, a subset of the set Lyndon words, such that the standard bracketings of ...