Customer Reviews

Constructive Combinatorics (Undergraduate Texts in Mathematics)

5 star:		(1)
4 star:		(0)
3 star:		(0)
2 star:		(0)
1 star:		(0)

 

 

Unlike other textbook in the prosperous combinatorics , this introduction book takes a very different pace.It's paradigm is "SHOW me the proof". From the very beginning to the last page ,authors us that we can make a proof clear by write out directly the algorithm or just make a apparent bijection. The book contains 4 chapters, the first 2 stress on basic enumeration objects and posets, the last 2 on bijection and involution. With authour's carefully-selected topic and examples, this book is self-contained. this book shows us the splendid new concepts of combinatorics. I must say that I'm very happy and shocked that ,in such a few pages ,by using combinatorical method developed here we can EASILY prove Cayley's theorem, Vandemonde determinent, Roger-Ramanujan's partition formula. etc. The exercises are excellent too. Very many good seed ideas waiting to be developed.