Math236 Discrete Maths with Applications
|
|
- June Norris
- 5 years ago
- Views:
Transcription
1 Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math / 43
2 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1, s 2,..., s k ) of objects in which: the rst object s 1 comes from a set of size n 1 for each choice of s 1 there are n 2 choices for object s 2 for each choice of s 2 there are n 3 choices for object s 3 for each choice of s 3 there are n 4 choices for object s 4 and, in general, for each choice of s i, 1 i k 1, there are n i+1 choices for object s i+1 Then the number of k-tuples in the set S is n 1 n 2 n k Ittmann (UKZN PMB) Math / 43
3 The Multiplication Principle (cont.) How many 4-digit odd numbers are there? We consider each number abcd as the 4-tuple (a, b, c, d) Such a number is odd if and only if the last digit, d, is in the set {1, 3, 5, 7, 9} There are no other restrictions on the digits Thus: n 1 = 9 (since the rst digit cannot be 0), n 2 = n 3 = 10, and n 4 = 5 It follows that the number of 4-digit odd numbers is = 4500 Ittmann (UKZN PMB) Math / 43
4 Basic counting principles How many odd numbers less than 10,000 are there? We use the Addition Principle together with the Multiplication Principle For i {1, 2, 3, 4}, let N i be the set of all i-digit odd numbers So, N 1 = {1, 3, 5, 7, 9}, N 2 = {11, 13, 15, 17, 19, 21,..., 99} and so on Notice that {N 1, N 2, N 3, N 4 } is a pairwise disjoint collection of sets Ittmann (UKZN PMB) Math / 43
5 Basic counting principles (cont.) By the Addition Principle, the number of odd numbers less than 10,000 is N 1 + N 2 + N 3 + N 4 Using the Multiplication Principle as we did in the previous example We see that N 1 = 5, N 2 = 45, N 3 = 450 and N 4 = 4500 Thus the answer is = 5000 Ittmann (UKZN PMB) Math / 43
6 Basic counting principles (cont.) How many k-tuples can be chosen from a set of n elements if repetition is allowed? We seek the number of k-tuples (s 1, s 2,..., s k ) in which each s i from a xed set of n elements and in which it's possible that s i comes = s j For each position in the k-tuple, we can choose any one of n dierent elements Hence, by the Multiplication Principle, there are such k-tuples n n n }{{} = n k k terms Ittmann (UKZN PMB) Math / 43
7 The Power Set Denition If S is a set, then we let 2 S called the power set of S denote the set of all subsets of S, sometimes If S = {a, b, c}, then 2 S = {, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}} Ittmann (UKZN PMB) Math / 43
8 The Power Set (cont.) The Multiplication Principle enables us to prove a formula for the number of subsets of a set Theorem If S is a nite set, then 2 S = 2 S Ittmann (UKZN PMB) Math / 43
9 The Power Set (cont.) Proof. Let S = {x 1, x 2,..., x S } With each subset A S do the following: Associate an S -tuple (a 1, a 2,..., a S ) with A Where for i {1, 2,..., S } we set { 0 if x i A a i = 1 if x i A. Clearly, each subset corresponds to exactly one S -tuple and each S -tuple corresponds to one subset Ittmann (UKZN PMB) Math / 43
10 The Power Set (cont.) Proof. It follows that the number of subsets is equal to the number of such S -tuples Note each position in the S -tuple is chosen from a set {0, 1} of size 2 Thus we are asking the question How many S -tuples can be chosen from a set of 2 elements? From the second to last example, the answer is 2 S Ittmann (UKZN PMB) Math / 43
11 The Power Set (cont.) Let S = {a, b, c} and let x 1 = a, x 2 = b, and x 3 = c The subset {a, c} corresponds to the 3-tuple (1, 0, 1) The subset {b} corresponds to the 3-tuple (0, 1, 0) According to previous theorem, the number of subsets of S is 2 S = 2 S = 2 3 = 8 This can be veried by counting the subsets Ittmann (UKZN PMB) Math / 43
12 The Pigeonhole Principle The Pigeonhole Principle We study a principle referred to as the Pigeonhole Principle Theorem If n + 1 objects are placed into n boxes, then at least one box contains at least two objects Ittmann (UKZN PMB) Math / 43
13 The Pigeonhole Principle The Pigeonhole Principle (cont.) Proof. Suppose this is not the case Then, each box contains at most one object This implies that the number of objects is at most n This is a contradiction If we choose 13 people, then there are two who have their birthday in the same month Ittmann (UKZN PMB) Math / 43
14 The Pigeonhole Principle The Pigeonhole Principle (cont.) Suppose we have n married couples How many of the 2n people must be selected to guarantee that we have chosen at least one married couple? Construct n boxes, each corresponding to one married couple Each time we choose someone, place them into the box corresponding to the couple they are a member of The Pigeonhole Principle says that once we've chosen n + 1 people, at least one box must contain 2 people That is, we've chosen a married couple Ittmann (UKZN PMB) Math / 43
15 The Pigeonhole Principle The Pigeonhole Principle (cont.) We choose 101 of the integers 1, 2,..., 200 We claim that among the integers chosen, there are two having the property that one is divisible by the other Each integer in {1, 2,..., 200} can be written in the form n2 k, where n is an odd number between 1 and 199 Ittmann (UKZN PMB) Math / 43
16 The Pigeonhole Principle The Pigeonhole Principle (cont.) There are 100 odd integers in {1, 2,..., 200} So if we choose 101 numbers, by the Pigeonhole Principle, two of the numbers we've chosen must have the same odd n That is, two of the numbers we've chosen are of the form n2 k 1 n2 k 2 and We assume without loss of generality that k 1 k 2 The number n2 k 2 divides the number n2 k 1, as desired Ittmann (UKZN PMB) Math / 43
17 The Pigeonhole Principle The Strong Pigeonhole Principle We now give a stronger form of the Pigeonhole Principle Theorem Let n 1, n 2,..., n k be positive integers Let n 1 + n n k k + 1 objects are placed into k boxes Then there is an integer i {1, 2,..., k} such that the i th box contains at least n i objects Ittmann (UKZN PMB) Math / 43
18 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) Proof. Assume, to the contrary, that this is not the case Then for each i {1, 2,..., k}, the ith box contains at most n i 1 objects Thus the total number of objects is at most (n 1 1) + (n 2 1) + + (n k 1) = n 1 + n n k k This is a contradiction Ittmann (UKZN PMB) Math / 43
19 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) A basket of fruit is to be made up from apples, bananas, litchis, and mangos How many pieces of fruit must we place in the basket to be guaranteed that there are at least three apples or at least two bananas or at least ten litchis or at least ve mangos? From the Strong Pigeonhole Principle, the answer is = 17 Ittmann (UKZN PMB) Math / 43
20 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) Suppose that we choose n integers from the integers 1, 2,..., n Think of this in the following way: We pick n integers Each integer is put into a box marked from 1 to n depending on its value Ittmann (UKZN PMB) Math / 43
21 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) Note that n = (n + 1) + (n + 1) + + (n + 1) n + 1 }{{} n terms The Strong Pigeonhole Principle guarantees that at least one box contains at least n + 1 objects That is, at least one of the integers 1, 2,..., n is chosen at least n + 1 times Ittmann (UKZN PMB) Math / 43
22 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) Let a 1, a 2,..., a k be a sequence of real numbers Recall that a subsequence of a 1, a 2,..., a k a i1, a i2,..., a it, where is of the form 1 i 1 < i 2 < < i t k The sequence a 1, a 2,..., a k is increasing if a 1 a 2 a k and decreasing if a 1 a 2 a t Ittmann (UKZN PMB) Math / 43
23 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) Consider the sequence 8, 1, 3, 5, 9, 2, 6, 4, 7 Then 1, 5, 2, 7 is a subsequence, but 1, 2, 3, 4 is not Note that 1, 3, 5, 9 is an increasing subsequence, and 8, 5, 2 is a decreasing subsequence Ittmann (UKZN PMB) Math / 43
24 The Pigeonhole Principle The Strong Pigeonhole Principle (cont.) The Strong Pigeonhole Principle enables us to prove the following interesting result, rst established by Erdös and Szekeres Theorem Every sequence a 1, a 2,..., a n 2 +1 of n2 + 1 real numbers contains an increasing subsequence of length n + 1 or a decreasing subsequence of length n + 1 Ittmann (UKZN PMB) Math / 43
25 One-to-one functions and permutations One-to-one functions As mentioned before, a function is a relation in which each element of the domain is related to exactly one element of the range Let f be a function with the additional property that no two elements of its domain are related to the same element of its range That is, x y implies that f (x) f (y) We call f a one-to-one function, or an injection Ittmann (UKZN PMB) Math / 43
26 One-to-one functions and permutations One-to-one functions (cont.) If f is one-to-one, then the relation is also a function f 1 = {(b, a) : (a, b) f } Conversely, if f is not one-to-one, then f 1 is not a function If f is an injection, then f 1 is called the inverse function of f Ittmann (UKZN PMB) Math / 43
27 One-to-one functions and permutations One-to-one functions (cont.) Let f 1 = {(1, a), (2, c), (3, b)} and f 2 = {(1, a), (2, b), (3, b)} Both f 1 and f 2 are functions The function f 1 is an injection, while f 2 is not This follows since the element b of the range of f 2 is related to both 2 and 3 The inverse of f 1 is f 1 1 = {(a, 1), (c, 2), (b, 3))} Ittmann (UKZN PMB) Math / 43
28 One-to-one functions and permutations One-to-one functions (cont.) The relation f 3 = {(x, x 2 ) : x R} is a function However, both (2, 4) and ( 2, 4) are members of f 3, so f 3 is not one-to-one The relation f 4 = {(x, 5x + 6) : x R} is a one-to-one function Its inverse is the function f 1 4 = {(x, (x 6)/5 : x R} The relation f 5 = {(x, tan(π(x 1/2))) : x (0, 1)} is a one-to-one function Its inverse is the function f 1 5 = {(x, (1/π) arctan x + 1/2) : x (, )} Ittmann (UKZN PMB) Math / 43
29 One-to-one functions and permutations Permutations Let S be a nite nonempty set A permutation of S is a one-to-one function whose domain and range are both S Let S = {1, 2, 3} One permutation of S is the function f with f (1) = 1, f (2) = 3, and f (3) = 2 This permutation can be denoted in the following manner ( ) f = Ittmann (UKZN PMB) Math / 43
30 One-to-one functions and permutations Permutations (cont.) The top row of the matrix is read as the domain and the bottom row as the range Thus, in general, this notation has this form ( ) f = f (1) f (2) f (3) Ittmann (UKZN PMB) Math / 43
31 One-to-one functions and permutations Permutations (cont.) There are six permutations of a set of three elements. The six permutations of {1, 2, 3} are: ( f 1 = ( f 4 = ) ) ( f 2 = ( f 5 = ) ) ( f 3 = ( f 6 = ) ) Ittmann (UKZN PMB) Math / 43
32 One-to-one functions and permutations Permutations (cont.) Written this way, it's easy to nd the inverse of a permutation To do so, 1 Interchange the top and bottom rows of the matrix 2 (If necessary) re-order by the elements in the (new) rst row Ittmann (UKZN PMB) Math / 43
33 One-to-one functions and permutations Permutations (cont.) The inverse of f 2 = ( 1 2 ) is ( ) After resorting the top row into ascending order, becomes the permutation ( ) = f In other words, f 1 2 = f 3 Ittmann (UKZN PMB) Math / 43
34 One-to-one functions and permutations Permutations (cont.) Similarly f 1 1 = f 1 f 1 3 = f 2 f 1 4 = f 4 f 1 5 = f 5 f 1 6 = f 6 Ittmann (UKZN PMB) Math / 43
35 One-to-one functions and permutations Permutations (cont.) If f = f 1, as is the case with f 1, f 4, f 5, and f 6, then f is called an involution Another way of writing permutations is as follows For the permutation ( ) we only write the bottom row, (2413) Thus, we could write f 1 = (123), f 6 = (213), etc. Ittmann (UKZN PMB) Math / 43
36 Counting permutations Counting permutations We now attempt to count permutations and similar mathematical objects How many permutations of the set S = {a, b, c} are there? As mentioned in the last example, we can think of each permutation on S as a 3-tuple (f (a), f (b), f (c)) The question then becomes: How many such 3-tuples are there? Ittmann (UKZN PMB) Math / 43
37 Counting permutations Counting permutations (cont.) The value f (a) may be any of three things: a, b, and c Once we've assigned a value to f (a), we must assign one to f (b) Since f is one-to-one, f (b) cannot have the same value as f (a) This means that there are only two possibilities for f (b) Ittmann (UKZN PMB) Math / 43
38 Counting permutations Counting permutations (cont.) Lastly, once we've chosen f (b), we must specify f (c), which can be neither f (a) nor f (b) It follows that, whatever the values of f (a) and f (b), there's only one possible value for f (c) From the Multiplication Principle, the total number of such 3-tuples is = 6 Ittmann (UKZN PMB) Math / 43
39 Counting permutations Counting permutations (cont.) Recall that n factorial is the function with rule 0! = 1 and, for n 1, n! = n (n 1) (n 2) So, 0! = 1 1! = 1 2! = 2 3! = 6 4! = 24 5! = 120 This gives us a compact way to write certain expressions down Ittmann (UKZN PMB) Math / 43
40 Counting permutations Counting permutations (cont.) An n-set is a set containing n elements How many permutations of an n-set are there? Suppose that the elements of the n-set are x 1, x 2,..., x n As in the previous example, we can consider each permutation to be an n-tuple (f (x 1 ), f (x 2 ),..., f (x n )) As before, we have n choices for f (x 1 ) Once we've chosen f (x 1 ), there are (n 1) possible choices for f (x 2 ) Ittmann (UKZN PMB) Math / 43
41 Counting permutations Counting permutations (cont.) Once we've chosen f (x 2 ), there are (n 2) possible choices for f (x 3 ), and so on So we see that the number of permutations of an n-set is n(n 1)(n 2) 2 1 = n! Ittmann (UKZN PMB) Math / 43
42 Counting permutations Counting permutations (cont.) There are 6! = 720 permutations of the set {a, b, c, d, e, f } How many k-tuples can be chosen from an n-set if repetition of elements is not allowed? If repetition of elements is allowed, we already know the answer to this question is n k Suppose then that repetition is not allowed We may choose any of n elements for the rst position in the k-tuple Once we've done that, we may choose any element for the second position except the one we chose for the rst Ittmann (UKZN PMB) Math / 43
43 Counting permutations Counting permutations (cont.) So for each choice for the rst position, there are n 1 choices for the second position Once we've chosen the second position, there are (n 2) possibilities for the third position, and so on When we reach the kth position, there are n k + 1 possibilities From the Multiplication Principle, the number of such k-tuples is thus n(n 1)(n 2) (n k + 2)(n k + 1) Ittmann (UKZN PMB) Math / 43
Discrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/29/2018 at 18:22:13 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More informationWeek 3-4: Permutations and Combinations
Week 3-4: Permutations and Combinations February 20, 2017 1 Two Counting Principles Addition Principle. Let S 1, S 2,..., S m be disjoint subsets of a finite set S. If S = S 1 S 2 S m, then S = S 1 + S
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationCombinations. April 14, 2006
Combinations April 14, 2006 Combinations (cont'd), April 14, 2006 Inclusion-Exclusion Principle Theorem. Let P be a probability distribution on a sample space Ω, and let {A 1, A 2,..., A n } be a nite
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationWith Question/Answer Animations. Chapter 6
With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More information7.4 Permutations and Combinations
7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting
More informationMath 255 Spring 2017 Solving x 2 a (mod n)
Math 255 Spring 2017 Solving x 2 a (mod n) Contents 1 Lifting 1 2 Solving x 2 a (mod p k ) for p odd 3 3 Solving x 2 a (mod 2 k ) 5 4 Solving x 2 a (mod n) for general n 9 1 Lifting Definition 1.1. Let
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationCPCS 222 Discrete Structures I Counting
King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222 Discrete Structures I Counting Dr. Eng. Farag Elnagahy farahelnagahy@hotmail.com Office Phone: 67967 The Basics of counting
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Binomial Coefficients Pascal s Triangle The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must
More informationThe Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n
Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product
More informationThe Product Rule can be viewed as counting the number of elements in the Cartesian product of the finite sets
Chapter 6 - Counting 6.1 - The Basics of Counting Theorem 1 (The Product Rule). If every task in a set of k tasks must be done, where the first task can be done in n 1 ways, the second in n 2 ways, and
More informationCounting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
More information12. 6 jokes are minimal.
Pigeonhole Principle Pigeonhole Principle: When you organize n things into k categories, one of the categories has at least n/k things in it. Proof: If each category had fewer than n/k things in it then
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationDiscrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting
Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More informationTHE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n. Communicated by S. Alikhani
Algebraic Structures and Their Applications Vol 3 No 2 ( 2016 ) pp 71-79 THE REMOTENESS OF THE PERMUTATION CODE OF THE GROUP U 6n MASOOMEH YAZDANI-MOGHADDAM AND REZA KAHKESHANI Communicated by S Alikhani
More informationMA 524 Midterm Solutions October 16, 2018
MA 524 Midterm Solutions October 16, 2018 1. (a) Let a n be the number of ordered tuples (a, b, c, d) of integers satisfying 0 a < b c < d n. Find a closed formula for a n, as well as its ordinary generating
More informationToday s Topics. Sometimes when counting a set, we count the same item more than once
Today s Topics Inclusion/exclusion principle The pigeonhole principle Sometimes when counting a set, we count the same item more than once For instance, if something can be done n 1 ways or n 2 ways, but
More informationWhat is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?
Chapter 5. Counting 5.1 The Basic of Counting What is counting? (how many ways of doing things) combinations: how many possible ways to choose 4 people from 10? how many license plates that start with
More informationEXPLAINING THE SHAPE OF RSK
EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
More informationPermutation group and determinants. (Dated: September 19, 2018)
Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Invertible matrices Theorem. 1. An elementary matrix is invertible. 2.
More informationSome Fine Combinatorics
Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More information6.1 Basics of counting
6.1 Basics of counting CSE2023 Discrete Computational Structures Lecture 17 1 Combinatorics: they study of arrangements of objects Enumeration: the counting of objects with certain properties (an important
More informationSample Spaces, Events, Probability
Sample Spaces, Events, Probability CS 3130/ECE 3530: Probability and Statistics for Engineers August 28, 2014 Sets A set is a collection of unique objects. Sets A set is a collection of unique objects.
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationREU 2006 Discrete Math Lecture 3
REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4
More informationChapter 2. Permutations and Combinations
2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationX = {1, 2,...,n} n 1f 2f 3f... nf
Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.
More informationMAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017
MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa
More informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More information28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter.
28,800 Extremely Magic 5 5 Squares Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@uncc.edu
More informationLECTURE 8: DETERMINANTS AND PERMUTATIONS
LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More informationIntroductory Probability
Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts
More informationLecture 2.3: Symmetric and alternating groups
Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationCounting Snakes, Differentiating the Tangent Function, and Investigating the Bernoulli-Euler Triangle by Harold Reiter
Counting Snakes, Differentiating the Tangent Function, and Investigating the Bernoulli-Euler Triangle by Harold Reiter In this paper we will examine three apparently unrelated mathematical objects One
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationPermutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014
Permutations and Combinations MATH 107: Finite Mathematics University of Louisville March 3, 2014 Multiplicative review Non-replacement counting questions 2 / 15 Building strings without repetition A familiar
More informationTHE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS
THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master
More informationSymmetric Permutations Avoiding Two Patterns
Symmetric Permutations Avoiding Two Patterns David Lonoff and Jonah Ostroff Carleton College Northfield, MN 55057 USA November 30, 2008 Abstract Symmetric pattern-avoiding permutations are restricted permutations
More informationSec 5.1 The Basics of Counting
1 Sec 5.1 The Basics of Counting Combinatorics, the study of arrangements of objects, is an important part of discrete mathematics. In this chapter, we will learn basic techniques of counting which has
More informationPROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES
PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed
More informationand problem sheet 7
1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and
More information16 Alternating Groups
16 Alternating Groups In this paragraph, we examine an important subgroup of S n, called the alternating group on n letters. We begin with a definition that will play an important role throughout this
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationMath 166: Topics in Contemporary Mathematics II
Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11 Last Time Factorials For any natural number n, we define
More informationWeek 1: Probability models and counting
Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model
More informationFoundations of Computing Discrete Mathematics Solutions to exercises for week 12
Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are
More informationReview I. October 14, 2008
Review I October 14, 008 If you put n + 1 pigeons in n pigeonholes then at least one hole would have more than one pigeon. If n(r 1 + 1 objects are put into n boxes, then at least one of the boxes contains
More information6.4 Permutations and Combinations
Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects
More informationTheory of Probability - Brett Bernstein
Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of
More informationLecture 18 - Counting
Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program
More informationPrinciples of Counting. Notation for counting elements of sets
Principles of Counting MATH 107: Finite Mathematics University of Louisville February 26, 2014 Underlying Principles Set Counting 2 / 12 Notation for counting elements of sets We let n(a) denote the number
More informationDyck paths, standard Young tableaux, and pattern avoiding permutations
PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationMAT 243 Final Exam SOLUTIONS, FORM A
MAT 243 Final Exam SOLUTIONS, FORM A 1. [10 points] Michael Cow, a recent graduate of Arizona State, wants to put a path in his front yard. He sets this up as a tiling problem of a 2 n rectangle, where
More informationWeek 1. 1 What Is Combinatorics?
1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics
More informationDISCRETE STRUCTURES COUNTING
DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the
More informationCombinations and Permutations
Combinations and Permutations What's the Difference? In English we use the word "combination" loosely, without thinking if the order of things is important. In other words: "My fruit salad is a combination
More informationMATH 2420 Discrete Mathematics Lecture notes
MATH 2420 Discrete Mathematics Lecture notes Series and Sequences Objectives: Introduction. Find the explicit formula for a sequence. 2. Be able to do calculations involving factorial, summation and product
More informationA tournament problem
Discrete Mathematics 263 (2003) 281 288 www.elsevier.com/locate/disc Note A tournament problem M.H. Eggar Department of Mathematics and Statistics, University of Edinburgh, JCMB, KB, Mayeld Road, Edinburgh
More informationarxiv: v1 [math.co] 24 Nov 2018
The Problem of Pawns arxiv:1811.09606v1 [math.co] 24 Nov 2018 Tricia Muldoon Brown Georgia Southern University Abstract Using a bijective proof, we show the number of ways to arrange a maximum number of
More informationRestricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers
Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers arxiv:math/0109219v1 [math.co] 27 Sep 2001 Eric S. Egge Department of Mathematics Gettysburg College 300 North Washington
More informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationOutline. Content The basics of counting The pigeonhole principle Reading Chapter 5 IRIS H.-R. JIANG
CHAPTER 5 COUNTING Outline 2 Content The basics of counting The pigeonhole principle Reading Chapter 5 Most of the following slides are by courtesy of Prof. J.-D. Huang and Prof. M.P. Frank Combinatorics
More informationn! = n(n 1)(n 2) 3 2 1
A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event
More informationSome results on Su Doku
Some results on Su Doku Sourendu Gupta March 2, 2006 1 Proofs of widely known facts Definition 1. A Su Doku grid contains M M cells laid out in a square with M cells to each side. Definition 2. For every
More informationarxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY
CYCLIC PERMUTATIONS AVOIDING PAIRS OF PATTERNS OF LENGTH THREE arxiv:1805.05196v3 [math.co] 4 Dec 2018 MIKLÓS BÓNA MICHAEL CORY Abstract. We enumerate cyclic permutations avoiding two patterns of length
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationChapter 7. Intro to Counting
Chapter 7. Intro to Counting 7.7 Counting by complement 7.8 Permutations with repetitions 7.9 Counting multisets 7.10 Assignment problems: Balls in bins 7.11 Inclusion-exclusion principle 7.12 Counting
More informationProbability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37
Probability MAT230 Discrete Mathematics Fall 2018 MAT230 (Discrete Math) Probability Fall 2018 1 / 37 Outline 1 Discrete Probability 2 Sum and Product Rules for Probability 3 Expected Value MAT230 (Discrete
More informationEdge-disjoint tree representation of three tree degree sequences
Edge-disjoint tree representation of three tree degree sequences Ian Min Gyu Seong Carleton College seongi@carleton.edu October 2, 208 Ian Min Gyu Seong (Carleton College) Trees October 2, 208 / 65 Trees
More informationMATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30
MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in
More informationMATH 135 Algebra, Solutions to Assignment 7
MATH 135 Algebra, Solutions to Assignment 7 1: (a Find the smallest non-negative integer x such that x 41 (mod 9. Solution: The smallest such x is the remainder when 41 is divided by 9. We have 41 = 9
More informationInputs. Outputs. Outputs. Inputs. Outputs. Inputs
Permutation Admissibility in Shue-Exchange Networks with Arbitrary Number of Stages Nabanita Das Bhargab B. Bhattacharya Rekha Menon Indian Statistical Institute Calcutta, India ndas@isical.ac.in Sergei
More informationThe Sign of a Permutation Matt Baker
The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss
More informationNovember 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
More informationGenerating trees and pattern avoidance in alternating permutations
Generating trees and pattern avoidance in alternating permutations Joel Brewster Lewis Massachusetts Institute of Technology jblewis@math.mit.edu Submitted: Aug 6, 2011; Accepted: Jan 10, 2012; Published:
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of
More informationStaircase Rook Polynomials and Cayley s Game of Mousetrap
Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written
More informationThe next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:
CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such
More informationSection Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
More information