[DMANET] Algorithms & Pretty Theorems in Paris, February 8-12, 2010

Algorithms and Pretty Theorems --- Existential Polytime.
Led by Jack Edmonds and some of Claude Berge's other progeny.

The "Laboratoire d'Informatique Algorithmique: Fondements et
Applications" (LIAFA) invites you to a 5-day didactic seminar on
simple algorithmic proofs of an assortment of beautiful discrete
existence theorems, at the Hermite Amphitheatre of the historic
Institut Henri Poincare, Latin Quarter of Paris, 11 rue Pierre et
Marie Curie - Paris 05 February 8 - 12, 2010, at 10:00 & at 14:00.
http://www.ihp.jussieu.fr/calendar/

REGISTER - There is no cost and no budget. However if you are hoping to come,
please send an email to pretty.structures@free.fr

Philosophy:

Mathematicians traditionally prove the kinds of theorem of the seminar
by contradiction, induction, double-counting. Algorithmic proofs can
be just as attractive when they are rendered in casual math language.
To be worth everyone knowing, and teaching in basic courses, will be
an aim of the seminar, with topics from graph theory, algebra,
combinatorial optimization, polymatroids, geometry, and game
theory. In celebration of "Turing Year", P and NP will be useful. An
"existentially polytime" or "EP" theorem is one which says that
something exists, any instance of which is easy, when it is displayed,
to recognize as an instance. It is worth studying proofs of EP
theorems which tell a way to find an instance of whatever is asserted
to exist. Many theorems fit the paradigm when suitably stated.
Contributions are welcome.

Seminar website: http://pretty.structures.free.fr/
Institut Henri Poincare website: http://www.ihp.jussieu.fr
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************