

Algorithms and Pretty Theorems Blog
You are invited to send didactic math pdf's,
for possible posting here and for discussion at the seminar,
by attaching them to an email to
pretty.structures@free.fr,
and tagging the email to include the statement
"with attachment".
 
A4size Poster of the Seminar Schedule and links to talks Participants Photos Jack's Talks S Strogatz, From Fish to Infinity, NYT, January 31, 2010 E. Wigner, 1960, The unreasonable effectiveness of math  

Seminarl'Equipe Combinatoire et Optimisation (ECO) du CNRS et de l'Université Paris VI
invite you to a 5day didactic seminar on simple algorithmic proofs 
REGISTER  There is no cost and no budget. However if you are hoping to come,
please send an email to
pretty.structures@free.fr.
Mathematicians traditionally prove the kinds of theorem of the seminar by contradiction, induction, doublecounting. 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 Poincaré website: http://www.ihp.jussieu.fr 