Selected Papers on Discrete Mathematics
Distributed for Center for the Study of Language and Information
828 pages

50 line drawings

6 x 9

© 2003
 Contents
Table of Contents
Contents
1. Combinatorial Analysis and Computers
2. Two Notes on Notation
3. Bracket Notation for the ‘Coefficient of’ Operator
4. Johann Faulhaber and Sums of Powers
5. Notes on Thomas Harriot
6. A Permanent Inequality
7. Overlapping Pfaffians
8. The Sandwich Theorem
9. Combinatorial Matrices
10. Aztec Diamonds, Checkerboard Graphs, and Spanning Trees
11. Partitioned Tensor Products and Their Spectra
12. Oriented Subtrees of an Arc Digraph
13. Another Enumeration of Trees
14. Abel Identities and Inverse Relations
15. Convolution Polynomials
16. Polynomials Involving the Floor Function
17. Construction of a Random Sequence
18. An Imaginary Number System
10. Tables of Finite Fields
20. Finite Semifields and Projective Planes
21. A Class of Projective Planes
22. Notes on Central Groupoids
23. Huffman’s Algorithm via Algebra
24. Wheels Within Wheels
25. Complements and Transitive Closures
26. Random Matroids
27. The Asymptotic Number of Geometries
28. Permutations with Nonnegative Partial Sums
29. Efficient Balanced Codes
30. The Knowlton – Graham Partition Problem
31. Permutations, Matrices, and Generalized Young Tableaux
32. Enumeration of Plane Partitions
33. A Note on Solid Partitions
34. Identities from Partition Involutions
35. Subspaces, Subsets, and Partitions
36. The Power of a Prime That Divides a Generalized Coefficient
37. An Almost Linear Recurrence
38. Recurrence Relations Based on Minimization
39. A Recurrence Related to Trees
40. The First Cycles in an Evolving Graph
41. The Birth of the Giant Component
Index
2. Two Notes on Notation
3. Bracket Notation for the ‘Coefficient of’ Operator
4. Johann Faulhaber and Sums of Powers
5. Notes on Thomas Harriot
6. A Permanent Inequality
7. Overlapping Pfaffians
8. The Sandwich Theorem
9. Combinatorial Matrices
10. Aztec Diamonds, Checkerboard Graphs, and Spanning Trees
11. Partitioned Tensor Products and Their Spectra
12. Oriented Subtrees of an Arc Digraph
13. Another Enumeration of Trees
14. Abel Identities and Inverse Relations
15. Convolution Polynomials
16. Polynomials Involving the Floor Function
17. Construction of a Random Sequence
18. An Imaginary Number System
10. Tables of Finite Fields
20. Finite Semifields and Projective Planes
21. A Class of Projective Planes
22. Notes on Central Groupoids
23. Huffman’s Algorithm via Algebra
24. Wheels Within Wheels
25. Complements and Transitive Closures
26. Random Matroids
27. The Asymptotic Number of Geometries
28. Permutations with Nonnegative Partial Sums
29. Efficient Balanced Codes
30. The Knowlton – Graham Partition Problem
31. Permutations, Matrices, and Generalized Young Tableaux
32. Enumeration of Plane Partitions
33. A Note on Solid Partitions
34. Identities from Partition Involutions
35. Subspaces, Subsets, and Partitions
36. The Power of a Prime That Divides a Generalized Coefficient
37. An Almost Linear Recurrence
38. Recurrence Relations Based on Minimization
39. A Recurrence Related to Trees
40. The First Cycles in an Evolving Graph
41. The Birth of the Giant Component
Index
For more information, or to order this book, please visit http://www.press.uchicago.edu
Google preview here
You may purchase this title at these fine bookstores. Outside the USA, see our international sales information.