RITT-WU'S CHARACTERISTIC SET METHOD FOR ORDINARY DIFFERENCE POLYNOMIAL SYSTEMS WITH ARBITRARY ORDERING

In this paper, a Ritt-Wu＇s characteristic set method for ordinary difference systems is proposed, which is valid for any admissible ordering. New definition for irreducible chains and new zero decomposition algorithms are also proposed.

Differential characteristic set algorithm for the complete symmetry classification of partial differential equations

In this paper, we present a differential polynomial characteristic set algorithm for the complete symmetry classification of partial differential equations （PDEs） with some parameters. It can make the solution to the complete symmetry classification problem for PDEs become direct and systematic. As an illustrative example, the complete potential symmetry classifications of nonlinear and linear wave equations with an arbitrary function parameter are presented. This is a new application of the differential form characteristic set algorithm, i.e., Wu＇s method, in differential equations.

A CHARACTERISTIC SET METHOD FOR SOLVING BOOLEAN EQUATIONS AND APPLICATIONS IN CRYPTANALYSIS OF STREAM CIPHERS

This paper presents a characteristic more efficient and has better properties than the set method for solving Boolean equations, which is general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.

PARAMETRIC EQUATION SOLVING AND QUANTIFIER ELIMINATION IN FINITE FIELDS WITH THE CHARACTERISTIC SET METHOD

For a parametric algebraic system in finite fields, this paper presents a method for computing the cover and the refined cover based on the characteristic set method. From the cover, the author knows for what parametric values the system has solutions and at the same time presents the solutions in the form of proper chains. By the refined cover, the author gives a complete classification of the number of solutions for this system, that is, the author divides the parameter space into several disjoint components, and on every component the system has a fix number of solutions. Moreover, the author develops a method of quantifier elimination for first order formulas in finite fields.

Automated Reasoning and Equation Solving with the Characteristic Set Method

A brief introduction to the characteristic set method is given for solving algebraic equation systems and then the method is extended to algebraic difference systems. The method can be used to decompose the zero set for a difference polynomial set in general form to the union of difference polynomial sets in triangular form. Based on the characteristic set method, a decision procedure for the first order theory over an algebraically closed field and a procedure to prove certain difference identities are proposed.

Mechanical theorem proving in the surfaces using the characteristic set method and Wronskian determinant

In this paper, we generalize the method of mechanical theorem proving in curves to prove theorems about surfaces in differential geometry with a mechanical procedure. We improve the classical result on Wronskian determinant, which can be used to decide whether the elements in a partial differential field are linearly dependent over its constant field. Based on Wronskian determinant, we can describe the geometry statements in the surfaces by an algebraic language and then prove them by the characteristic set method.

On Software Development of Characteristic Set Method

Characteristic set method of polynomial equation solving has been widely spread and its implementation in software has been urged to consider in recent years. Several packages for the method are implemented in some computer algebra systems, such as REDUCE and Maple. In order to improve the efficiency of the method, we have developed a computer algebra system ″ELIMINO″ written in C language and implemented on Linux operation system on a PC. The authors wish to share with the reader the knowledge and experiences about the design and development of software package of the characteristic set method.

An explicit finite volume element method for solving characteristic level set equation on triangular grids

Level set methods are widely used for predicting evolutions of complex free surface topologies,such as the crystal and crack growth,bubbles and droplets deformation,spilling and breaking waves,and two-phase flow phenomena.This paper presents a characteristic level set equation which is derived from the two-dimensional level set equation by using the characteristic-based scheme.An explicit finite volume element method is developed to discretize the equation on triangular grids.Several examples are presented to demonstrate the performance of the proposed method for calculating interface evolutions in time.The proposed level set method is also coupled with the Navier-Stokes equations for two-phase immiscible incompressible flow analysis with surface tension.The Rayleigh-Taylor instability problem is used to test and evaluate the effectiveness of the proposed scheme.

APPLICATION OF MECHANIZED MATHEMATICS TO ROTOR DYNAMICS

Based on the mechanized mathematics and WU Wen-tsun elimination method, using oil film forces of short-bearing model and Muszynska's dynamic model, the dynamical behavior of rotor-beating system and its stability of motion are investigated. As example, the concept of Wu characteristic set and Maple software, whirl parameters of short-bearing model, which is usually solved by the numerical method, are analyzed. At the same time, stability of zero solution of Jeftcott rotor whirl equation and stability of self-excited vibration are studied. The conditions of stable motion are obtained by using theory of nonlinear vibration.

Conservation Laws of a Class of Combined Equations

In this paper, we investigate conservation laws of a class of partial differential equations, which combines the nonlinear telegraph equations and the nonlinear diffusion-convection equations. Moreover, some special conservation laws of the combined equations are obtained by means of symmetry classifications of wave equations uxx = H （x）utt.

ON A COLLISION PROBLEM

Traffic control is necessary for traffic safety in driving cars. To avoid collision of cars in crossroads is an important practical problem. We study in this paper the collision problem of two cars in elliptical forms which move with uniform speed on two crossroads orthogonal to each other. In applying Wb Wen-tsun's method of mathexnatics-mechanization we find conditions such that collision will not occur. We have also determined in the possible colliding case the time and place of first collision.

A SYMBOLIC COMPUTATION METHOD TO DECIDE THE COMPLETENESS OF THE SOLUTIONS TO THE SYSTEM OF LINEAR PARTIAL DIFFERENTIAL EQUATIONS

A symbolic computation method to decide whether the solutions to the system Of linear partial differential equation is complete via using differential algebra and characteristic set is presented. This is a mechanization method, and it can be carried out on the computer in the Maple environment.

Molecular uniting set identified characteristic(MUSIC): a promising strategy for purely organic RTP luminogens

The room temperature phosphorescences（RTP）are of growing interest owing to their promising applications in material science and bioimaging.To date,the lumiogens showing persistent RTP effect mainly contain the noble metals which have the shortcomings such as high cost,potential toxicity.The exploration of metal free luminogens,i.e.,purely organic RTP luminogens,is thus of great importance for the community.

Analyzing Boolean Functions via Solving Parametric Polynomial Systems

In this paper,a new method to analyze Boolean functions is proposed.By this method,one can analyze the balancedness,the nonlinearity,and the input-output correlation of vectorial Boolean functions.The basic idea of this method is to compute the refined covers of some parametric Boolean polynomial systems which are equivalent to these problems.By a refined cover,the parameter space is divided into several disjoint components,and on each component,the parametric Boolean polynomial system has a fixed number of solutions.An efficient algorithm based on the characteristic set method to compute refined covers of parametric Boolean polynomial systems is presented.The experimental results about some instances generated from cryptanalysis show that this new method is efficient and can solve some instances which can not be solved in reasonable time by other methods.

Exact Computation of the Topology and Geometric Invariants of the Voronoi Diagram of Spheres in 3D

In this paper, we are addressing the exact the Voronoi diagram of spheres using Wu＇s algorithm. computation of the Delaunay graph （or quasi-triangulation） and Our main contributions are first a methodology for automated derivation of invariants of the Delaunay empty circumsphere predicate for spheres and the Voronoi vertex of four spheres, then the application of this methodology to get all geometrical invariants that intervene in this problem and the exact computation of the Delaunay graph and the Voronoi diagram of spheres. To the best of our knowledge, there does not exist a comprehensive treatment of the exact computation with geometrical invariants of the Delaunay graph and the Voronoi diagram of spheres. Starting from the system of equations defining the zero-dimensional algebraic set of the problem, we are applying Wu＇s algorithm to transform the initial system into an equivalent Wu characteristic （triangular） set. In the corresponding system of algebraic equations, in each polynomial （except the first one）, the variable with higher order from the preceding polynomial has been eliminated （by pseudo-remainder computations） and the last polynomial we obtain is a polynomial of a single variable. By regrouping all the formal coefficients for each monomial in each polynomial, we get polynomials that are invariants for the given problem. We rewrite the original system by replacing the invariant polynomials by new formal coefficients. We repeat the process until all the algebraic relationships （syzygies） between the invariants have been found by applying Wu＇s algorithm on the invariants. Finally, we present an incremental algorithm for the construction of Voronoi diagrams and Delaunay graphs of spheres in 3D and its application to Geodesy.

A CRITERION FOR TESTING WHETHER A DIFFERENCE IDEAL IS PRIME

This paper presents a criterion for testing the irreducibility of a polynomial over an algebraicextension field.Using this criterion and the characteristic set method,the authors give a criterion fortesting whether certain difference ascending chains are strong irreducible,and as a consequence,whetherthe saturation ideals of these ascending chains are prime ideals.