Computer Algebra Proofs for Combinatorial Inequalities and Identities

Description

Computers have been used for quite some time now to prove combinatorial identities, such as hypergeometric summation identities, for instance. Rather than on logical calculi, methods arising from computer algebra are applied to this end. In this talk, we report on some recent progress in the area of algorithms for proving facts about combinatorial sequences. The methods we present in the talk go in two respects beyond the classical algorithms: (1) the class of sequences to which they apply is much larger than for other algorithms, and (2) not only identities but also inequalities can be proven. We will illustrate the methods at examples taken from the literature, which have not been proven automatically before, and we will also comment on theoretical and practical limitiations of our approach.

Period	12 Jan 2006
Event title	Computer Algebra Proofs for Combinatorial Inequalities and Identities
Event type	Other
Location	GermanyShow on map