Guessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System

Alain Giorgetti 1, 2
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a theorem-proving experiment performed with a computer algebra system. It proves a conjecture about the general pattern of the generating functions counting rooted maps of given genus. These functions are characterized by a complex non-linear differential system between generating functions of multi-rooted maps. Establishing a pattern for these functions requires a sophisticated inductive proof. Up to now these proofs were made by hand. This work is the first computer proof of this kind of theorem. Symbolic computations are performed at the same abstraction level as the hand-made proofs, but with a computer algebra system. Generalizing this first success may significantly help solving algebraic problems in enumerative combinatorics.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00563330
Contributor : Jean-Michel Caricand <>
Submitted on : Friday, February 4, 2011 - 3:39:57 PM
Last modification on : Friday, July 6, 2018 - 3:06:10 PM
Long-term archiving on : Thursday, May 5, 2011 - 2:41:17 AM

File

giorgetti10_oip.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00563330, version 1

Citation

Alain Giorgetti. Guessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System. Symbolic Computation in Software Science, Jul 2010, Linz, Austria. pp.5--18. ⟨hal-00563330⟩

Share

Metrics

Record views

355

Files downloads

150