• John M. Harris
  • Jeffry L. Hirst
  • Michael J. Mossinghoff
Part of the Undergraduate Texts in Mathematics book series (UTM)


The formal study of combinatorics dates at least to Gottfried Wilhelm Leibniz’s Dissertatio de Arte Combinatoria in the seventeenth century. The last half-century, however, has seen a huge growth in the subject, fueled by problems and applications from many fields of study. Applications of combinatorics arise, for example, in chemistry, in studying arrangements of atoms in molecules and crystals; biology, in questions about the structure of genes and proteins; physics, in problems in statistical mechanics; communications, in the design of codes for encryption, compression, and correction of errors; and especially computer science, for instance in problems of scheduling and allocating resources and in analyzing the efficiency of algorithms.


Stable Match Binomial Coefficient Stirling Number Cycle Index Maclaurin Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • John M. Harris
    • 1
  • Jeffry L. Hirst
    • 2
  • Michael J. Mossinghoff
    • 3
  1. 1.Department of MathematicsFurman UniversityGreenvilleUSA
  2. 2.Department of MathematicsAppalachian State UniversityBooneUSA
  3. 3.Department of MathematicsUCLALos AngelesUSA

Personalised recommendations