MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

A Complete Algorithm for Automated Discovering of a Class of Inequality-type Theorems

Xia Bican
Peking University
AG2 Working Group Seminar
AG 1, AG 2, AG 3, AG 4  
AG Audience
-- Not specified --

Date, Time and Location

Thursday, 14 February 2002
14:00
-- Not specified --
46.1 - MPII
007
Saarbrücken

Abstract

Making use of the discriminant sequence for polynomials,

WR algorithm, Wu's elimination and a partial cylindrical
algebraic decomposition, we present here a practical algorithm
for automated inequality discovering which can discover
new inequalities automatically, without requiring us to put
forward any conjectures beforehand. That is complete for
an extensive class of inequality-type theorems. Also this
algorithm is applied to the classification of the real physical
solutions of geometric constraint problems. Many inequalities
with various backgrounds have been discovered or re-discovered
by our program, DISCOVERER, which implements the algorithm in
Maple.

Contact

Uwe Waldmann
--email hidden
passcode not visible
logged in users only