Speeding Up the GVW Algorithm via a Substituting Method

Journal of Systems Science and Complexity - The GVW algorithm is an efficient signature-based algorithm for computing Gröbner bases. In this paper, the authors consider the implementation of...     

On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra

Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gr?bner basis computations.These techniques can also be used in fast implementations of F5 and some other signature-based Gr?bner basis algorithms.When these techniques are applied,a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function(given in F4).Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function,this step can be very costly when the number of involved polynomials/monomials is huge.In this paper,multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported.Many examples have been tested by using this method,and the experimental data shows that the new method is very efficient.     

A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases

Journal of Systems Science and Complexity - Weispfenning in 1992 introduced the concepts of comprehensive Gröbner system/basis of a parametric polynomial system, and he also presented an...     

Solving the perspective-three-point problem using comprehensive Gröbner systems

A complete solution classification of the perspective-three-point (P3P) problem is given by using the Gröbner basis method. The structure of the solution space of the polynomial system deduced by the P3P problem can be obtained by computing a comprehensive Gröbner system. Combining with properties of the generalized discriminant sequences, the authors give the explicit conditions to determine the number of distinct real positive solutions of the P3P problem. Several examples are provided to illustrate the effectiveness of the proposed conditions.     

关系模式中候选码数

本文研究了关系模式中可能出现的候选码数;候选码数与属性、函数依赖之间的关系;候选码数的极值问题.     

Solving Multivariate Polynomial Matrix Diophantine Equations with Gr?bner Basis Method

Different from previous viewpoints, multivariate polynomial matrix Diophantine equations are studied from the perspective of modules in this paper, that is, regarding the columns of matrices as elements in modules. A necessary and sufficient condition of the existence for the solution of equations is derived. Using powerful features and theoretical foundation of Gr?bner bases for modules, the problem for determining and computing the solution of matrix Diophantine equations can be solved. Meanwh...     

Hilbert Problem 15 and Ritt-Wu Method (II)

This paper proves three statements of Schubert about cuspal cubic curves in a plane by using the concept of generic point of Van der Waerden and Weil and Ritt-Wu methods. They are relations of some special lines: 1) For a given point, all the curves containing this point are considered. For any such curve, there are five lines. Two of them are the tangent lines of the curve passing through the given point. The other three are the lines connecting the given point with the cusp, the inflexion point and the intersection point of the tangent line at the cusp and the inflexion line. 2) For a given point, the curves whose tangent line at the cusp passes through this point are considered. For any such curve, there are four lines. Three of them are the tangent lines passing through this point and the other is the line connect the given point and the inflexion point. 3) For a given point, the curves whose cusp, inflexion point and the given point are collinear are considered. For any such curve, there are five lines. Three of them are tangent lines passing through the given point. The other two are the lines connecting the given point with the cusp and the intersection point of the tangent line at the cusp and the inflexion line.

     

强主属性与拓扑序结构

本文定义了强主属性概念,讨论了属性子集拓扑序结构问题,导出了求解全部候选关键字的新算法.     

一种新的概率定义及其注记

给出概率的公理化定义的新形式,证明了与悉知定义的等价性;指出了某些概率著作在这方面的不足和欠妥。