Skip to main content Accessibility help
×
Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T23:05:00.878Z Has data issue: false hasContentIssue false

1 - Introduction

Published online by Cambridge University Press:  28 June 2017

Peter J. Cameron
Affiliation:
University of St Andrews, Scotland
Get access

Summary

This book is about counting. Of course this doesn't mean just counting a single finite set. Usually, we have a family of finite sets indexed by a natural number n, and we want to find F(n), the cardinality of the nth set in the family. For example, we might want to count the subsets or permutations of a set of size n, lattice paths of length n, words of length n in the alphabet {0, 1} with no two consecutive 1s, and so on.

What is counting?

There are several kinds of answer to this question:

  1. • An explicit formula (which may be more or less complicated, and in particular may involve a number of summations). In general, we regard a simple formula as preferable; replacing a formula with two summations by one with only one is usually a good thing.

  2. • A recurrence relation expressing F(n) in terms of n and the values of F(m) for m < n. This allows us to compute F(0),F(1), … in turn, up to any desired value.

  3. • A closed form for a generating function for F. We will have much more to say about generating functions later on. Roughly speaking, a generating function represents a sequence of numbers by a power series, which in some cases converges to an analytic function in some domain in the complex plane. An explicit formula for the generating function for a sequence of numbers is regarded as almost as good as a formula for the numbers themselves.

If a generating function converges, it is possible to find the coefficients by analytic methods (differentiation or contour integration).

In the examples below, we use two forms of generating function for a sequence (a0,a1, a2, …) of natural numbers: the ordinary generating function, given by

and the exponential generating function, given by

We will study these further in the next chapter, and meet them many times during later chapters. In Chapter 10, we will see a sort of explanation of why some problems need one kind of generating function and some need the other.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Introduction
  • Peter J. Cameron, University of St Andrews, Scotland
  • Book: Notes on Counting: An Introduction to Enumerative Combinatorics
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781108277457.002
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Introduction
  • Peter J. Cameron, University of St Andrews, Scotland
  • Book: Notes on Counting: An Introduction to Enumerative Combinatorics
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781108277457.002
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Introduction
  • Peter J. Cameron, University of St Andrews, Scotland
  • Book: Notes on Counting: An Introduction to Enumerative Combinatorics
  • Online publication: 28 June 2017
  • Chapter DOI: https://doi.org/10.1017/9781108277457.002
Available formats
×