Assistive Technologies and Computer Access for Motor Disabilities 1st Edition Georgios Kouroupetroglou download pdf
Assistive Technologies and Computer Access for Motor Disabilities 1st Edition Georgios Kouroupetroglou download pdf
https://ebookfinal.com/download/disability-informatics-and-web-
accessibility-for-motor-limitations-1st-edition-georgios-
kouroupetroglou/
ebookfinal.com
https://ebookfinal.com/download/keep-it-simple-a-guide-to-assistive-
technologies-1st-edition-ravonne-a-green/
ebookfinal.com
Computer Synthesized Speech Technologies Tools for Aiding
Impairment 1st Edition John W. Mullennix
https://ebookfinal.com/download/computer-synthesized-speech-
technologies-tools-for-aiding-impairment-1st-edition-john-w-mullennix/
ebookfinal.com
https://ebookfinal.com/download/assistive-technology-and-science-1st-
edition-cathy-bodine/
ebookfinal.com
INTRODUCTION
TO ENUMERATIVE
two fundamental themes of bijective proofs and generating func-
tions, together with their intimate connections, recur constantly. A
AND ANALYTIC
wide selection of topics, including several never appearing before in
a textbook, is included that gives an idea of the vast range of enu-
merative combinatorics.”
—From the Foreword to the First Edition by Richard Stanley,
Cambridge, Massachusetts, USA COMBINATORICS
Introduction to Enumerative and Analytic Combinatorics fills the
gap between introductory texts in discrete mathematics and ad-
SECOND EDITION
vanced graduate texts in enumerative combinatorics. The book first
Miklós Bóna
deals with basic counting principles, compositions and partitions,
and generating functions. It then focuses on the structure of per-
mutations, graph enumeration, and extremal combinatorics. Lastly,
the text discusses supplemental topics, including error-correcting
codes, properties of sequences, and magic squares. 20
Strengthening the analytic flavor of the book, this Second Edition:
10 10
• Features a new chapter on analytic combinatorics and new
sections on advanced applications of generating functions
• Demonstrates powerful techniques that do not require the
1
residue theorem or complex integration
• Adds new exercises to all chapters, significantly extending
coverage of the given topics
1
Introduction to Enumerative and Analytic Combinatorics, Second
Edition makes combinatorics more accessible, increasing interest in
this rapidly expanding field.
Bóna
K23708
w w w. c rc p r e s s . c o m
Steven Furino, Ying Miao, and Jianxing Yin, Frames and Resolvable Designs: Uses,
Constructions, and Existence
Mark S. Gockenbach, Finite-Dimensional Linear Algebra
Randy Goldberg and Lance Riek, A Practical Handbook of Speech Coders
Jacob E. Goodman and Joseph O’Rourke, Handbook of Discrete and Computational Geometry,
Second Edition
Jonathan L. Gross, Combinatorial Methods with Computer Applications
Jonathan L. Gross and Jay Yellen, Graph Theory and Its Applications, Second Edition
Jonathan L. Gross, Jay Yellen, and Ping Zhang Handbook of Graph Theory, Second Edition
David S. Gunderson, Handbook of Mathematical Induction: Theory and Applications
Richard Hammack, Wilfried Imrich, and Sandi Klavžar, Handbook of Product Graphs,
Second Edition
Darrel R. Hankerson, Greg A. Harris, and Peter D. Johnson, Introduction to Information Theory
and Data Compression, Second Edition
Darel W. Hardy, Fred Richman, and Carol L. Walker, Applied Algebra: Codes, Ciphers, and
Discrete Algorithms, Second Edition
Daryl D. Harms, Miroslav Kraetzl, Charles J. Colbourn, and John S. Devitt, Network Reliability:
Experiments with a Symbolic Algebra Environment
Silvia Heubach and Toufik Mansour, Combinatorics of Compositions and Words
Leslie Hogben, Handbook of Linear Algebra, Second Edition
Derek F. Holt with Bettina Eick and Eamonn A. O’Brien, Handbook of Computational Group Theory
David M. Jackson and Terry I. Visentin, An Atlas of Smaller Maps in Orientable and
Nonorientable Surfaces
Richard E. Klima, Neil P. Sigmon, and Ernest L. Stitzinger, Applications of Abstract Algebra
with Maple™ and MATLAB®, Second Edition
Richard E. Klima and Neil P. Sigmon, Cryptology: Classical and Modern with Maplets
Patrick Knupp and Kambiz Salari, Verification of Computer Codes in Computational Science
and Engineering
William Kocay and Donald L. Kreher, Graphs, Algorithms, and Optimization
Donald L. Kreher and Douglas R. Stinson, Combinatorial Algorithms: Generation Enumeration
and Search
Hang T. Lau, A Java Library of Graph Algorithms and Optimization
C. C. Lindner and C. A. Rodger, Design Theory, Second Edition
San Ling, Huaxiong Wang, and Chaoping Xing, Algebraic Curves in Cryptography
Nicholas A. Loehr, Bijective Combinatorics
Toufik Mansour, Combinatorics of Set Partitions
Titles (continued)
Toufik Mansour and Matthias Schork, Commutation Relations, Normal Ordering, and Stirling
Numbers
Alasdair McAndrew, Introduction to Cryptography with Open-Source Software
Elliott Mendelson, Introduction to Mathematical Logic, Fifth Edition
Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, Handbook of Applied
Cryptography
Stig F. Mjølsnes, A Multidisciplinary Introduction to Information Security
Jason J. Molitierno, Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs
Richard A. Mollin, Advanced Number Theory with Applications
Richard A. Mollin, Algebraic Number Theory, Second Edition
Richard A. Mollin, Codes: The Guide to Secrecy from Ancient to Modern Times
Richard A. Mollin, Fundamental Number Theory with Applications, Second Edition
Richard A. Mollin, An Introduction to Cryptography, Second Edition
Richard A. Mollin, Quadratics
Richard A. Mollin, RSA and Public-Key Cryptography
Carlos J. Moreno and Samuel S. Wagstaff, Jr., Sums of Squares of Integers
Gary L. Mullen and Daniel Panario, Handbook of Finite Fields
Goutam Paul and Subhamoy Maitra, RC4 Stream Cipher and Its Variants
Dingyi Pei, Authentication Codes and Combinatorial Designs
Kenneth H. Rosen, Handbook of Discrete and Combinatorial Mathematics
Douglas R. Shier and K.T. Wallenius, Applied Mathematical Modeling: A Multidisciplinary
Approach
Alexander Stanoyevitch, Introduction to Cryptography with Mathematical Foundations and
Computer Implementations
Jörn Steuding, Diophantine Analysis
Douglas R. Stinson, Cryptography: Theory and Practice, Third Edition
Roberto Tamassia, Handbook of Graph Drawing and Visualization
Roberto Togneri and Christopher J. deSilva, Fundamentals of Information Theory and Coding
Design
W. D. Wallis, Introduction to Combinatorial Designs, Second Edition
W. D. Wallis and J. C. George, Introduction to Combinatorics
Jiacun Wang, Handbook of Finite State Based Models and Applications
Lawrence C. Washington, Elliptic Curves: Number Theory and Cryptography, Second Edition
DISCRETE MATHEMATICS AND ITS APPLICATIONS
INTRODUCTION
TO ENUMERATIVE
AND ANALYTIC
COMBINATORICS
SECOND EDITION
Miklós Bóna
University of Florida
Gainesville, Florida, USA
CRC Press
Taylor & Francis Group
6000 Broken Sound Parkway NW, Suite 300
Boca Raton, FL 33487-2742
© 2016 by Taylor & Francis Group, LLC
CRC Press is an imprint of Taylor & Francis Group, an Informa business
This book contains information obtained from authentic and highly regarded sources. Reasonable
efforts have been made to publish reliable data and information, but the author and publisher cannot
assume responsibility for the validity of all materials or the consequences of their use. The authors and
publishers have attempted to trace the copyright holders of all material reproduced in this publication
and apologize to copyright holders if permission to publish in this form has not been obtained. If any
copyright material has not been acknowledged please write and let us know so we may rectify in any
future reprint.
Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced,
transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or
hereafter invented, including photocopying, microfilming, and recording, or in any information stor-
age or retrieval system, without written permission from the publishers.
For permission to photocopy or use material electronically from this work, please access www.copy-
right.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222
Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that pro-
vides licenses and registration for a variety of users. For organizations that have been granted a photo-
copy license by the CCC, a separate system of payment has been arranged.
Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are
used only for identification and explanation without intent to infringe.
Visit the Taylor & Francis Web site at
http://www.taylorandfrancis.com
and the CRC Press Web site at
http://www.crcpress.com
To Linda
To Mikike, Benny, and Vinnie
Contents
Acknowledgments xix
I Methods 1
1 Basic methods 3
1.1 When we add and when we subtract . . . . . . . . . . . . . . 4
1.1.1 When we add . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.2 When we subtract . . . . . . . . . . . . . . . . . . . . 5
1.2 When we multiply . . . . . . . . . . . . . . . . . . . . . . . . 6
1.2.1 The product principle . . . . . . . . . . . . . . . . . . 6
1.2.2 Using several counting principles . . . . . . . . . . . . 9
1.2.3 When repetitions are not allowed . . . . . . . . . . . . 10
1.2.3.1 Permutations . . . . . . . . . . . . . . . . . . 10
1.2.3.2 Partial lists without repetition . . . . . . . . 12
1.3 When we divide . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.1 The division principle . . . . . . . . . . . . . . . . . . 14
1.3.2 Subsets . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.3.2.1 The number of k-element subsets of an n-
element set . . . . . . . . . . . . . . . . . . . 16
1.3.2.2 The binomial theorem for positive integer ex-
ponents . . . . . . . . . . . . . . . . . . . . . 17
1.4 Applications of basic counting principles . . . . . . . . . . . 19
1.4.1 Bijective proofs . . . . . . . . . . . . . . . . . . . . . . 19
1.4.1.1 Catalan numbers . . . . . . . . . . . . . . . . 23
1.4.2 Properties of binomial coefficients . . . . . . . . . . . 25
1.4.3 Permutations with repetition . . . . . . . . . . . . . . 30
1.5 The pigeonhole principle . . . . . . . . . . . . . . . . . . . . 32
1.6 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
1.7 Chapter review . . . . . . . . . . . . . . . . . . . . . . . . . . 37
1.8 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
1.9 Solutions to exercises . . . . . . . . . . . . . . . . . . . . . . 42
ix
x Contents
II Topics 179
4 Counting permutations 181
4.1 Eulerian numbers . . . . . . . . . . . . . . . . . . . . . . . . 182
4.2 The cycle structure of permutations . . . . . . . . . . . . . . 189
4.2.1 Stirling numbers of the first kind . . . . . . . . . . . . 189
4.2.2 Permutations of a given type . . . . . . . . . . . . . . 196
4.3 Cycle structure and exponential generating functions . . . . 200
4.4 Inversions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 205
4.4.1 Counting permutations with respect to inversions . . . 210
4.5 Advanced applications of generating functions to permutation
enumeration . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
4.5.1 The combinatorial meaning of the derivative . . . . . 215
4.5.2 Multivariate generating functions . . . . . . . . . . . . 215
4.6 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 216
4.7 Chapter review . . . . . . . . . . . . . . . . . . . . . . . . . . 217
4.8 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218
4.9 Solutions to exercises . . . . . . . . . . . . . . . . . . . . . . 222
4.10 Supplementary exercises . . . . . . . . . . . . . . . . . . . . 232
Bibliography 525
Index 531
Foreword to the first edition
What could be a more basic mathematical activity than counting the number
of elements of a finite set? The misleading simplicity that defines the sub-
ject of enumerative combinatorics is in fact one of its principal charms. Who
would suspect the wealth of ingenuity and of sophisticated techniques that
can be brought to bear on a such an apparently superficial endeavor? Miklós
Bóna has done a masterful job of bringing an overview of all of enumerative
combinatorics within reach of undergraduates. The two fundamental themes
of bijective proofs and generating functions, together with their intimate con-
nections, recur constantly. A wide selection of topics, including several never
appearing before in a textbook, are included that give an idea of the vast
range of enumerative combinatorics. In particular, for those with sufficient
background in undergraduate linear algebra and abstract algebra there are
many tantalizing hints of the fruitful connection between enumerative com-
binatorics and algebra that plays a central role in the subject of algebraic
combinatorics. In a foreword to another book by Miklós Bóna I wrote, “This
book can be utilized at a variety of levels, from random samplings of the trea-
sures therein to a comprehensive attempt to master all the material and solve
all the exercises. In whatever direction the reader’s tastes lead, a thorough
enjoyment and appreciation of a beautiful area of combinatorics is certain to
ensue.” Exactly the same sentiment applies to the present book, as the reader
will soon discover.
Richard Stanley
Cambridge, Massachusetts
June 2005
xv
Preface to the second edition
There are at least three ways to use this book. If one decides to cover every
chapter, and some of the exercises containing new material, then one can
teach a two-semester combinatorics course from the book. Instructors looking
for a text for a course in enumerative combinatorics can teach such a course
selecting chapters with the strongest focus on counting, such as Chapters 2,
3, 4, 5, 7, and 9. Finally, one can teach a one-semester course with a not-
quite-as-strong focus on enumeration by using Chapters 1, 2, 3, and then the
desired chapters from the rest of the book.
Our hope is that our book can broaden access to the fascinating topics of
enumerative and analytic combinatorics, and will prepare readers for the more
advanced, classic books of the field, such as Enumerative Combinatorics by
Richard Stanley and Analytic Combinatorics by Philippe Flajolet and Robert
Sedgewick.
This current edition of the book contains a new chapter on analytic combi-
natorics. Instructors trying to teach that topic to a relatively novice audience
often hit a roadblock when they realize that the audience is unfamiliar with
complex analysis. The goal of this chapter is to at least partially overcome
that roadblock by showing the reader some of the powerful techniques of that
field that do not require the residue theorem or complex integration. Hope-
fully, readers will find the results interesting and that will entice them to learn
the techniques that we only mention here. Strengthening the analytic flavor
of the book, Chapters 4 and 5 have been enhanced by new sections discussing
advanced applications of generating functions. Finally, we added new exer-
cises to all chapters. Just as before, numerous exercises contain material not
discussed in the text, which allows instructors to extend the time they spend
on a given topic.
Combinatorics is a rapidly expanding field, and we hope that our book
will increase the number of students with an interest in it even further.
Gainesville, FL
August 2015
xvii
Acknowledgments
First, I am thankful to my grandfather, the late Dr. János Bóna, who in-
troduced me to counting problems at an early age. I am indebted to the
researchers whose work attracted me to enumerative combinatorics. They in-
clude Richard Stanley, Herbert Wilf, Bruce Sagan, Catherine Yan, Francesco
Brenti, and many others. The second edition of the book has an analytic
flavor that would not have been possible if I had not learned analytic combi-
natorics from, and been influenced by, Philippe Flajolet, Robert Sedgewick,
Boris Pittel, Robin Pemantle, and E. Rodney Canfield.
As always, my gratitude is extended to my wife Linda and my sons Miki,
Benny, and Vinnie, who tolerated another book project reasonably well.
xix
Frequently used notation
• Cn a cycle on n vertices
• |F| number of edges of the hypergraph F
• Gi stabilizer of the element i under the action of the group G
• G−v graph G with its vertex v and all edges adjacent to v removed
• i(p) number of inversions of the permutation p
• iG orbit of the element i under the action of the group G
• Kn complete graph on n vertices
• n! n(n − 1) · · · 1
(n)k
• nk k!
• (n)m n(n − 1) · · · (n − m + 1)
• p(n) number of partitions of the integer n
xxi
xxii Introduction to Enumerative and Analytic Combinatorics
Methods
1
Basic methods
CONTENTS
1.1 When we add and when we subtract . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.1 When we add . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.2 When we subtract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2 When we multiply . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.2.1 The product principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.2.2 Using several counting principles . . . . . . . . . . . . . . . . . . . . . . . . 9
1.2.3 When repetitions are not allowed . . . . . . . . . . . . . . . . . . . . . . . 10
1.2.3.1 Permutations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
1.2.3.2 Partial lists without repetition . . . . . . . . . . . . . . . 12
1.3 When we divide . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.1 The division principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1.3.2 Subsets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.3.2.1 The number of k-element subsets of an
n-element set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.3.2.2 The binomial theorem for positive integer
exponents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
1.4 Applications of basic counting principles . . . . . . . . . . . . . . . . . . . . . . . . 19
1.4.1 Bijective proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
1.4.1.1 Catalan numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
1.4.2 Properties of binomial coefficients . . . . . . . . . . . . . . . . . . . . . . . 25
1.4.3 Permutations with repetition . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
1.5 The pigeonhole principle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
1.6 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
1.7 Chapter review . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
1.8 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
1.9 Solutions to exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
1.10 Supplementary exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
3
4 Introduction to Enumerative and Analytic Combinatorics
Theorem 1.1 (Addition principle) If A and B are two disjoint finite sets,
then
|A ∪ B| = |A| + |B|. (1.1)
It may seem somewhat strange that we provide a proof for such an ex-
tremely simple statement, but we want to set standards.
Proof: Both sides of (1.1) count the elements of the same set, the set A ∪ B.
The left-hand side does this directly, while the right-hand side counts the
elements of A and B separately. In either case, each element is counted exactly
once (as A and B are disjoint), so the two sides are indeed equal. ♦
The previous theorem was about two disjoint finite sets, but there is noth-
ing magical about the number two here. If we had said that each of the par-
ticipants of the canoe trip had exactly one unfortunate event on the trip, say,
five of them fell into the water, three were attacked by hornets, and four got
a sunstroke, then we could still conclude that there were 5 + 3 + 4 = 12 people
at this enjoyable excursion. This is an example of the generalized addition
principle.
Basic methods 5
Proof: Again, both sides count the elements of the same set, the set A1 ∪
A2 ∪ · · · ∪ An ; therefore, they have to be equal. ♦
Needless to say, it is again very important to insist that the sets Ai are
pairwise disjoint.
Example 1.3 Let A = {2, 3, 5, 7}, and let B = {4, 5, 7}. Then A − B =
{2, 3}.
This equation holds true by the addition principle. Indeed, A − B and B are
disjoint sets, and their union is A.
In other words, both sides count the elements of A, but the left-hand side
first counts those that are not contained in B, then those that are contained
in B.
The claim of Theorem 1.4 is now proved by subtracting |B| from both
sides of (1.2). ♦
positive integers that are divisible by 3. Then A = {2, 4, 6, 8}, so |A| = 4, and
B = {3, 6, 9}, so |B| = 3. However, |A − B| = |{2, 4, 8}| = 3. As 4 − 3 6= 3, we
see that the subtraction principle does not hold here. The reason for this is
that the conditions of the subtraction principle are not fulfilled, that is, B is
not a subset of A.
The reader should go back to our proof of the subtraction principle and
see why the proof fails if B is not a subset of A.
The use of the subtraction principle is advisable in situations when it is
easier to enumerate the elements of B (“bad guys”) than the elements of A−B
(“good guys”).
Example 1.5 The number of positive integers less than or equal to 1000 that
have at least two different digits is 1000 − 27 = 973.
Solution: Let A be the set of all positive integers less than or equal to 1000,
and let B be the subset of A that consists of all positive integers less than
or equal to 1000 that do not have two different digits. Then our claim is that
|A − B| = 973. By the subtraction principle, we know that |A − B| = |A| − |B|.
Furthermore, we know that |A| = 1000. Therefore, we will be done if we can
show that |B| = 27. What are the elements of B? They are all the positive
integers of at most three digits in which there are no two distinct digits. That
is, in any element of B, only one digit occurs, but that one digit can occur once,
twice, or three times. So the elements of B are 1, 2, · · · , 9, then 11, 22, · · · , 99,
and finally, 111, 222, · · · , 999. This shows that |B| = 27, proving our claim. ♦
Note that using the subtraction principle was advantageous because |A|
was very easy to determine and |B| was almost as easy to compute. Therefore,
getting |A| − |B| was faster than computing |A − B| directly.
Here each row corresponds to a certain model. As there are five rows, and
each of them consists of seven possible choices, the total number of choices is
5 × 7 = 35.
This is an example of the following general theorem.
Theorem 1.6 (Product principle) Let X and Y be two finite sets. Then
the number of pairs (x, y) satisfying x ∈ X and y ∈ Y is |X| × |Y |.
Proof: There are |X| choices for the first element x of the pair (x, y); then,
regardless of what we choose for x, there are |Y | choices for y. Each choice of
x can be paired with each choice of y, so the statement is proved. ♦
Note that the set of all ordered pairs (x, y) so that x ∈ X and y ∈ Y
is called the direct product (or Cartesian product) of X and Y , and is often
denoted by X × Y . We call the pairs (x, y) ordered pairs because the order of
the two elements matters in them. That is, (x, y) 6= (y, x), unless x = y.
reader has already seen that method. A brief overview of the method can be
found in the appendix.
Proof: (of Theorem 1.8) We prove the statement by induction on k. For k = 1,
there is nothing to prove, and for k = 2, the statement reduces to the product
principle.
Now let us assume that we know the statement for k −1, and let us prove it
for k. A k-tuple (x1 , x2 , · · · , xk ) satisfying xi ∈ Xi can be decomposed into an
ordered pair ((x1 , x2 , · · · , xk−1 ), xk ), where we still have xi ∈ Xi . The number
of such (k −1)-tuples (x1 , x2 , · · · , xk−1 ) is, by our induction hypothesis, |X1 |×
|X2 | × · · · × |Xk−1 |. The number of elements xk ∈ Xk is |Xk |. Therefore, by
the product principle, the number of ordered pairs ((x1 , x2 , · · · , xk−1 ), xk )
satisfying the conditions is
(|X1 | × |X2 | × · · · × |Xk−1 |) × |Xk |,
so this is also the number of k-tuples (x1 , x2 , · · · , xk ) satisfying xi ∈ Xi . ♦
Example 1.9 For any positive integer k, the number of k-digit positive in-
tegers is 9 · 10k−1 .
Example 1.10 How many four-digit positive integers both start and end in
even digits?
Solution: The first digit must come from the 4-element set {2, 4, 6, 8}, whereas
the last digit must come from the 5-element set {0, 2, 4, 6, 8}. The second and
third digits must come from the 10-element set {0, 1, · · · , 9}. Therefore, the
total number of such positive integers is 4 · 10 · 10 · 5 = 2000. ♦
An interesting special case of Theorem 1.8 is when all Xi have the same
size because all Xi are identical as sets.
If A is a finite alphabet consisting of n letters, then a k-letter string over
A is a sequence of k letters, each of which is an element of A.
Example 1.12 A user needs to choose a password for a bank card. The
password can use the digits 0, 1, · · · , 9 with no restrictions, and it has to consist
of at least four and at most seven digits. How many possible passwords are
there?
Solution: Let Ai denote the set of acceptable codes that consist of i digits.
Then, by the product principle (or Corollary 1.11), we see that Ai = 10i for
any i satisfying 4 ≤ i ≤ 7. So, by the addition principle, we get that the total
number of possibilities is
Example 1.13 Let us assume that a prospective thief tried to steal the code
of the card of Example 1.12. As the rightful user typed in the code, the thief
observed that the password consisted of five digits, did not start with zero, and
contained the digit 8. If the thief gets hold of the card, at most how many
attempts will he need to find out the password?
If we try to compute this number (that, is, the number of five-digit positive
integers that contain the digit 8) directly, we risk making our work unduly
difficult. For instance, we could compute the number of five-digit integers that
start with 8, the number of those whose second digit is 8, and so on. We would
run into difficulties in the next step, however, as the sets of these numbers are
not disjoint. Indeed, just because the first digit of a number is 8, it could well
be that its fourth and fifth digits are also 8. Therefore, if we simply added
our partial results, we would count some five-digit integers many times (the
number of times they contain the digit 8). For instance, we would count the
integer 83885 three times. While we will see in later chapters that this is not
an insurmountable difficulty, it does take a significant amount of computation
to get around it. It is much easier to solve the problem in a slightly more
indirect way.
Solution: (of Example 1.13) Instead of counting the five-digit positive integers
that contain the digit 8, we count those that do not. Then, simply apply the
subtraction principle by subtracting that number from the number of all five-
digit positive integers, which is, of course, 9 · 104 = 90000 by Example 1.9.
10 Introduction to Enumerative and Analytic Combinatorics
How many five-digit positive integers do not contain the digit 8? These
integers can start in eight different digits (everything but 0 and 8); then any of
their remaining digits can be one of nine digits (everything but 8). Therefore,
by the product principle, their number is 8·94 = 52488. Therefore, the number
of those five-digit positive integers that do not contain the digit 8 is 90000 −
52488 = 37512. ♦
We would hope that the cash machine will not let anyone take that many
guesses.
n · (n − 1) · · · · · 2 · 1
Theorem 1.15 For any positive integers n, the number of ways to arrange
all elements of the set [n] in a line is n!.
Proof: There are n ways to select the element that will be at the first place in
our line. Then, regardless of this selection, there are n − 1 ways to select the
element that will be listed second, n−2 ways to select the element listed third,
and so on. Our claim is then proved by the generalized product principle. ♦
With this terminology, Theorem 1.15 says that the number of permutations
of [n] is n!. Permutations are omnipresent in combinatorics, and they are
frequently used in other parts of mathematics, such as algebra, group theory,
and computer science. We will learn more about them in this book. For now,
let us return to basic counting techniques.
Proof: There are n choices for the first element of the list, then n − 1 choices
for the second element of the list, and so on; finally, there are n − k + 1 choices
for the last (kth) element of the list. The result then follows by the product
principle. ♦
Example 1.18 A student cafeteria offers the following special. For a certain
price, we can have our choice of one out of four salads, one out of five main
courses, and something for dessert. For dessert, we can either choose one out
of five sundaes, or we can choose one of four gourmet coffees and, no matter
which gourmet coffee we choose, one out of two cookies. How many different
meals can a customer buying this special have?
Basic methods 13
Example 1.19 A college senior will spend her weekend visiting some gradu-
ate schools. Because of geographical constraints, she can either go to the north,
where she can visit four schools out of the ten schools in which she is inter-
ested, or she can go to the south, where she can visit five schools out of eight
schools in which she is interested. How many different itineraries can she set
up?
Note that we are interested in the number of possible itineraries, so the
order in which the student visits the schools is important.
Solution: (of Example 1.19) The student can either go to the north, in which
case, by Theorem 1.17, she will have (10)4 possibilities, or she can go to the
south, in which case she will have (8)5 possibilities. Therefore, by the addition
principle, the total number of possibilities is
♦
14 Introduction to Enumerative and Analytic Combinatorics
Definition 1.20 Let S and T be finite sets, and let d be a fixed positive
integer. We say that the function f : T → S is d-to-one if for each element
s ∈ S there exist exactly d elements t ∈ T so that f (t) = s.
Recall that the fact that f is a function automatically ensures that f (t) is
unique for each t ∈ T . See Figure 1.1 for an illustration.
T S
f
Figure 1.1
Diagram of a three-to-one map.
Basic methods 15
In the above example, S was the set of families present, but we could not
determine |S| directly because we only saw the children and did not know
who were siblings. However, T was the set of children present. We could easily
determine |T |, then use our knowledge that each family had two children
present (so d = 2) and obtain |S| as |T |/2.
We will now turn to a classic example that will be useful in Chapter 4.
Let us ask n people to sit around a circular table, and consider two seat-
ing arrangements identical if each person has the same left neighbor in both
seatings.
For instance, the two seatings at the top of Figure 1.2 are identical, but the
one at the bottom is not, even if each person has the same neighbors in that
seating as well. This is because, in that seating, for each person, the former
left neighbor becomes the right neighbor. If the food always arrives from one
direction, this can be quite some difference.
A B
D same B A same C
C A D
B different D
Figure 1.2
Two identical seatings and a different one.
Having made clear when two seating arrangements are considered different,
we are ready to discuss our next example.
16 Introduction to Enumerative and Analytic Combinatorics
Solution: (of Example 1.22) If the table were linear, instead of circular, then
the number of all seating arrangements would be n!. In other words, if T is
the set of seating arrangements of n people along a linear table, then |T | = n!.
Now let S be the set of seating arrangements around our circular table. We
claim that each element of S corresponds to n elements of T . Indeed, take
a circular seating s ∈ S, and choose a person p in that seating, in one of n
ways. Then turn s into a linear seating by starting the seating with p, then
continuing with the left neighbor of p, the left neighbor of that person, then
the left neighbor of that person, and so on. As there are n choices for p, each
circular seating s can be turned into n different linear seating arrangements.
On the other hand, each linear seating lins corresponds to one circular
seating f (lins), because no matter where we “fold” lins into a circle, the left
neighbor of each person will not change.
This means that f : T → S is an n-to-one function. Therefore, by the
division principle,
|T | n!
|S| = = = (n − 1)!.
n n
So this is the number of circular seating arrangements. ♦
1.3.2 Subsets
1.3.2.1 The number of k-element subsets of an n-element set
At a certain university, the Department of Mathematics has 55 faculty mem-
bers. The department is asked to send three of its faculty members to the
commencement ceremonies to serve as marshals there. All three people cho-
sen for this honor will perform the same duties. It is up to the department chair
to choose the three professors who will serve. How many different possibilities
does the chair have?
A superficial and wrong argument would go like this: The chair has 55
choices for the first faculty member, then 54 choices for the second faculty
member, and, finally, 53 choices for the last one. Therefore, as we explained
with Theorem 1.17, the number of all possibilities is 55 · 54 · 53.
The reader should take a moment here to try to see the problem with this
argument. Once you have done that, you can read further. The problem is that
this line of thinking counts the same triple of professors many times. Indeed,
let A, B, and C be three professors from this department. (The department
hires people with short names only.) The above line of thinking considers ABC
and BAC as different triples, whereas they are in fact identical. Indeed, we
said that all three people chosen will perform the same duties. Therefore, the
order in which these people are chosen is irrelevant.
Exploring the Variety of Random
Documents with Different Content
that noble author himself alleged that he was engaged in ‘giving
fame to the Queen,’ the latter, one morning, noticed the alleged fact
to Lord Hervey. The King was present, and his Majesty remarked:—‘I
dare say he will paint you in fine colours, the dirty liar.’ ‘Why not?’
asked Caroline; ‘good things come out of dirt sometimes. I have ate
very good asparagus raised out of dung?’ When it was said that not
only Lord Carteret, but that Lords Bolingbroke and Chesterfield were
also engaged in writing the history of their times, the Queen
critically anticipated ‘that all the three histories would be three heaps
of lies; but lies of very different kinds: she said Bolingbroke’s would
be great lies; Chesterfield’s little lies; and Carteret’s lies of both
31
sorts.’ It may be added, that where there were vice and
coarseness there was little respect for justice or for independence of
conduct. The placeman who voted according to his conscience,
when he found his conscience in antagonism against the court, was
invariably removed from his place.
In concluding this chapter, it may be stated that when Frederick
was about to bring forward the question of his revenue, the Queen
would fain have had an interview with the son she alternately
despised and feared, to persuade him against pursuing this measure
—the carrying out of which she dreaded as prejudicial to the King’s
health in his present enfeebled state. Caroline, however, would not
see her son, for the reason, as the mother alleged, that he was such
an incorrigible liar that he was capable of making any mendacious
report of the interview, even of her designing to murder him. She
had, in an interview with him, at the time of the agitation connected
with the Excise bill, been compelled to place the Princess Caroline,
concealed, within hearing, that she might be a witness in case of the
prince, her brother, misrepresenting what had really taken place.
When the King learned the prince’s intentions, he took the
matter much more coolly than the Queen. Several messengers,
however, passed between the principal parties, but nothing was
done in the way of turning the prince from his purpose. It was an
innocent purpose enough, indeed, as he represented it. The
parliament had entrusted to the King a certain annual sum for the
prince’s use. The King and Queen did not so understand it, and he
simply applied to parliament to solicit that august body to put an
interpretation on its own act.
The supposed debilitated condition of the King’s health gave
increased hopes to the prince’s party. The Queen, therefore, induced
him to hold levées and appear more frequently in public. His
improvement in health and good humour was a matter of
disappointment to those who wished him dying, and feared to see
him grow popular.
The animosity of the Queen and her daughter, Caroline, against
32
the Prince of Wales was ferocious. The mother cursed the day on
which she had borne the son who was for ever destroying her
peace, and would end, she said, by destroying her life. There was no
opprobrious epithet which she did not cast at him; and they who
surrounded the Queen and princess had the honour of daily hearing
them hope that God would strike the son and brother dead with
apoplexy. Such enmity seems incredible. The gentle Princess
Caroline’s gentlest name for her brother was ‘that nauseous beast;’
and in running over the catalogue of crimes of which she declared
him capable, if not actually guilty, she did not hesitate to say that he
was capable of murdering even those whom he caressed. Never was
family circle so cursed by dissension as this royal circle; in which the
parents hated the son, the son the parents; the parents deceived
one another, the husband betrayed the wife, the wife deluded the
husband, the children were at mutual antagonism, and truth was a
stranger to all.
CHAPTER VII.
THE BIRTH OF AN HEIRESS.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookfinal.com