Abstract
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.
[Combinatorics] has emerged as a new subject standing at the crossroads between pure and applied mathematics the center of bustling activity, a simmering pot of new problems and exciting speculations.
— Gian-Carlo Rota, [129, p. vii]
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Harris, J.M., Hirst, J.L., Mossinghoff, M.J. (2000). Combinatorics. In: Combinatorics and Graph Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4803-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-4803-1_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-4805-5
Online ISBN: 978-1-4757-4803-1
eBook Packages: Springer Book Archive