[FOM] Automated bijective proofs

Andreas Weiermann weiermann at math.uu.nl
Wed Jun 30 04:30:49 EDT 2004

"Timothy Y. Chow" <tchow at alum.mit.edu> wrote:
> I wonder if there has been any effort to automate the process of finding 
> bijective proofs in combinatorics?

To me it seems that the WZ method might be related in some parts to 
Chows problem: Maybe that everybody is aware of
this. Anyway (full) details of the WZ-story can be found under:

http://www.math.temple.edu/~akalu/html/pg1.html (Short overview)

http://www.cis.upenn.edu/~wilf/AeqB.html (The A=B book)

I agree with Jacques Carette's comments. I would like to add that
a corresponding online book is available on:


Best regards,
Andreas Weiermann

More information about the FOM mailing list