Table of Contents

1. Discussion of Mr. Riordan's paper 'Abel identities and inverse relations'; 2. Duality in addition chains; 3. Combinatorial analysis and computers; 4. Tables of finite fields; 5. Finite semifields and projective planes; 6. A class of projective planes; 7. Construction of a random sequence; 8. Oriented subtrees of an arc digraph; 9. Another enumeration of trees; 10. Notes on central groupoids; 11. Permutations, matrices, and generalized Young tableaux; 12. A note on solid partitions; 13. Subspaces, subsets, and partitions; 14. Enumeration of plane partitions; 15. Complements and transitive closures; 16. Permutations with nonnegative partial sums; 17. Wheels within wheels; 18. The asymptotic number of geometries; 19. Random matroids; 20. Identities from partition involutions; 21. Huffman's algorithm via algebra; 22. A permanent inequality; 23. Efficient balanced codes; 24. The power of a prime that divides a generalized binomial coefficient; 25. The first cycles in an evolving graph; 26. The birth of the giant component; 27. Polynomials involving the floor function; 28. The sandwich theorem; 29. Aztec diamonds, checkerboard graphs, and spanning trees.

About the Author

Donald E. Knuth is one of the world's pre-eminent computer scientists, whose works have had a profound influence on the subject since the publication in 1968 of the first volume of The Art of Computer Programming. Knuth created TeX, a language for typesetting mathematical and scientific texts, and METAFONT, a computer software system for alphabet design. He is professor emeritus at Stanford University.