440 Little Hall.
The second edition was published at the end of 2006. It had two new chapters, one on Algorithms and one on Computational Complexity.
The third edition of this book was published in Summer of 2011. It has two extra chapters, one on block designs and one on counting unlabeled structures. The book has just been published in Korean. Here is the errata for this latest edition.
In 2006, the book won an Outstanding Academic Title award from the American Library Association that graded it Essential. In 2012, the book was placed on the Basic Library List by the Mathematical Association of America. This means that the book is recommended for undergraduate mathematics libraries. See the review of the book on the MAA website.
This is a textbook for a special topic Graduate Course. The publisher is Chapman-Hall and CRC Press. Click here for some info about this book.
A recent result of mine is that the Stanley-Wilf limit of 1324-avoiding permutations is at most 13.92.
With my colleague Andrew Vince, we have recently completed a paper entitled The Number of Ways to Assemble a Graph that, among other things, applies a very strong recent result of Doron Zeilberger.
I have recently finished a paper On surprising symmetries in 132-avoiding permutations. I am dedicating it to the memory of Herb Wilf. This paper has been published in the Electronic Journal of Combinatorics.
If you read this through a computer with MathSciNet access, you can check the reviews of my publications here.
See a list of my publications.
Read my detailed cv.
In Fall 2013, I teach two courses. Find the syllabus below.
Here are the grades for the December 2 test in Combinatorics.
Here are the grades for the December 2 test in Differential Equations.
You are visitor number
since October 17, 2002.
Counter provided by digits.com .