"È$ß#È"ß$È#ß%È% This same mapping could also be represented in the form
|
|
- Carmel Garrison
- 6 years ago
- Views:
Transcription
1 Random Permutations A permutation of the objects "ß á ß defines a mapping. For example, the permutation 1 œ $ß "ß #ß % of the objects "ß #ß $ß % defines the mapping "È$ß#È"ß$È#ß%È% This same mapping could also be represented in the form "È$ß$È#ß#È" and %È% or more succinctly as "ß $ß # ß % The separate parts are referred to as cycles of the permutation. As argued in Riordan, An Introduction to Combinatorial Analysis, Chapter, The Cycles of Permutations, it is easy to see that every permutation can be uniquely represented by its cycles provided we adopt the convention that expressions such as "ß $ß #, 3ß 2ß 1, and 2ß 1ß 3, which represent the same cycle, are indistinguishable. We note that in the literature of cycles of permutations it is standard notation to write a cycle with its smallest element in the first position. Clearly x equals the total number of permutations of "ß á ß. It is well known that =ß>, the signless Stirling Number of the First Kind, counts the total number of permutations of "ß á ß with exactly > cycles. The article A Review of the Stirling Numbers, Their Generalizations and Statistical Applications, Charalambides, Ch. A.; Singh, Jagbir; Communications in Statistics, Theory and Methods, Vol. 1, No., 19, pages , is an excellent resource on Stirling Numbers. If a permutation of "ß á ß is selected uniformly at random from the set of all x permutations of "ß á ß, we will refer to this as a random permutation. If a permutation of "ß á ß is selected uniformly at random from the set of all = ß > permutations of "ß á ß with > cycles, we will refer to this as a random permutation with > cycles. We will need the following definitions.
2 : the infinite product space 0,1, á 0,1, á â : the set of all vectors s,s, á in such that "= #= á œ " # " # ß > : the set of all vectors s,s, " # á in such that " " "= #= # á œ = = á œ > # ß> ß> For any T define T œ T and T œ T We note that the condition that "=" #= # á œ implies that = œ! for all Þ Hence all vectors in T and Tß> are of the form + ", á, + ß!ß!ß á Þ For all T Á!ß!ßá, let be the collection of -dimensional vectors formed by taking each infinite-dimensional vector in and truncating after +ÞSo for example, T +, á, + ß!ß!ß á +, á, + " " Define ß> similarly. For notational consistency it is necessary to separate out the case T œ!ß!ßá. We will refer to a cycle with < elements as an r - cycle. A permutation of elements with 5 " - cycles, á, 5 - cycles is said to be of cycle class 5ßáß5Þ " " Let \ equal the number of - cycles in a random permutation of "ß á ß with > cycles. We can construct the set of all permutations of a set of elements into > cycles such that \" œ B" ßáß\ œ B in the following manner. Take any one of the x permutations of the elements and use the first B " elements of that permutation to fill the B " "- cycles, use the next #B# elements of that permutation to fill the B # #- cycles, and so on. In total we would use the "B" #B# á B œ elements to fill the B B á B cycles. " # This assignment yields x permutations but not all of these permutations are distinct. In particular this count would assume that rearranging the B -cycles amongst themselves leads to distinct permutations - which they do not. Furthermore this count would assume that all rearrangements of the elements within a cycle leads to distinct permutations - which they do not. Therefore it is necessary to divide the count of x by the number of ways to arrange the B
3 -cycles amongst themselves œ"ßáßand by the number of ways to arrange the elements in each cycle and not change the cycle. It follows that there are x " " â BxâBx " " B B " permutations of a set of "ß á ß with cycle class BßáßB " provided "B á B œ and B!ß áß a " and T \ " ß ß\ œ B" ß ßB œ! x " B" " B B" xâbx " â =ß> "B áb œ " B" ábœ> B!ß"ßáß a otherwise If we define [ as the number of - cycles in a random permutation of "ß á ß then it follows similarly that T [ " ß ß[ œ A" ß ßA œ! " " A " â" A "A" á Aœ AxâAx " " A!ß"ßáßa otherwise We note that it follows from the law of total probability that " " " " â œ " AxâAx " "A" áaœ A!ß"ßáßa " A A which is Cauchy's identity. Theorem 1.
4 ". " E1 [ " ß ß[ œ E1 ] " ß] # ß x.- " - - œ! where 1 + " ß+ # ßá is any function and 1 + " ßáß+ œ1 + " ßáß+ ß!ß!ßáand for T Á!ß!ßá ". " T [ " ß ß[ œ T] " ß] # ßá T x.- " - -œ! where that ]ß]ßá " # is an infinite sequence of independent Poisson random variables such - C exp - T ] œ C œ C œ!ß "ß #ß á and œ "ß #ß á è Cx Theorem 2. > E 1 \ ß ß\ œ.. " " " E =ß> 1 ] " ß] # ß.-.) > "- >x ) -œ! ) œ! where 1 + " ß+ # ßá is any function and 1 + " ßáß+ œ1 + " ßáß+ ß!ß!ßáand for T Á!ß!ßá >.. " " T\ " ß ß\ ß> œ T " ß # ßá T =ß>.-.) > ] ] "- >x ) -œ! ) œ! where that ]ß]ßá " # is an infinite sequence of independent Poisson random variables such )- C exp )- T ] œ C œ C œ!ß "ß #ß á and œ "ß #ß á è Cx Now consider the set of all possible ways to distribute distinguishable keys onto > distinct key rings such that no key ring is left empty and where the position of keys on a key ring matters, but only up to circular shifts. Suppose we pick a distribution from this set uniformly at random.
5 Let Yßœ"ßáß> equal the number of keys on the key ring. Then, >2 TYß " ßY> œ?ß " ß? > œ! x?" â? > >x =ß>?" á? > œ? "ß#ßá a else Let Zß œ"ßáß equal the number of (distinguishable) key rings containing keys. Then, TZ" ß ßZ " ß ß@ œ! x xâ@ x " â =ß> "@ á@ œ á@ a otherwise We note that the above probability distribution is based on a model where the > key rings are distinguishable (e.g. different colors) but clearly the latter probability would be the same if the > key rings were the same color or not. However distributing distinguishable keys onto > like key rings is equivalent to forming a permutation of "ß á ß with > cycles. That is, for all ß> ß> TZ ß ßZ œ T \ ß ß\ " ß> " ß> where as before the \ ßœ"ßáß> equal the number of cycles with elements in a random permutation of "ß á ß with > cycles. We will need the following definitions. > À the > -dimensional product space ",#á, â ",#á, > > " > À the set of all vectors?, áß? in such that? á? œ " > > " ß> " > Define h as that set such that Z ß ßZ Í Y ß ßY h. Theorem 3.
6 T \ ß ß\ " d œ " T ] ] >x = ß > > " ß> " > ln ), á, h d) ) œ! where ]ßáß] " > are iid logarithmic series random variables with parameter ). That is, T ] œ C œ! C ) C ln") C "ß #ß á else è Problem 1. (a) The probability that a random permutation of "ß #ß á ß contains exactly 5 cycles of length equals " 35 3 x " x 5 3x 3 3œ5 This result was derived by Goncharov, V.L. (19), Some Factors from Combinatorics, Izv. Akad. Nauk SSSR, Ser. Mat., 3. Translated from Russian in Goncharov, V.L. (1962), On the Field of Combinatory Analysis, Translations from American Mathematical Society, 19, 1 6. (b) The probability that a random permutation of "ß #ß á ß into > cycles will contain exactly 5 cycles of length is > " 3 x = 3ß>3 " = ß> x3 3x 3œ5 (c) The probability that a random permutation of "ß #ß á ß into > cycles contains at least 5 cycles of length is
7 > " 3" x = 3ß>3 " = ß> 35 5" 3x3 3x 3œ5 and the probability that a random permutation of "ß #ß á ß contains at least 5 cycles of length is " 35 3" x " x 5 " 3x 3 3œ5 >2 (d) The < descending factorial moment of the number of cycles of length in a random permutation of "ß #ß á ß ß is "!Ÿ<Ÿ < >2 and the < descending factorial moment of the number of cycles of length in a random permutation of "ß #ß á ß with > cycles is x = <ß > < < x < = ß> <"Ÿ>Ÿ< " The first of these two results can be found in Riordan, J. An Introduction to Combinatorial Analysis, page, Problem 12. (e) The probability that a random permutation of "ß #ß á ß contains exactly 5 " cycles of length ",exactly 52 cycles of length 2, á, and exactly 5r cycles of length is r " " á3< 5" á5 < " < â " â 5 5 3" 3< 3xâ3x â 3" ßáß3 < 3" 5" á3< 5< Ÿ 3 " 5" ßáß 3 < 5< " < " < " <
8 Problem 2. The descending factorial moment of the number of cycles in a random permutation of "ß #ß á ß is < >2 <x x = "ß<" This result can be found in Riordan, J. An Introduction to Combinatorial Analysis, page 1, equation (12). Problem 3. is The number of permutations of "ß #ß á ß which have 5 cycles, none of which an < cycle is < x " = <ß 5 x <x< œ! Riordan, J. An Introduction to Combinatorial Analysis, page 3, equation (1) is the special case <œ". In the case <œ" these numbers are referred to as the Associated Stirling Numbers of the First Kind. Riordan gives a recurrence relation for general < in Problem 16(a), page 5. Problem. (a) The probability that exactly 5 cycle lengths are multiples of in a random permutation of "ß #ß á ß with > cycles is
9 > > x 5 1 " = 3 ß = 3ß > =ß> 5 3x 3x œ5 3œ (b) The probability that every cycle length in a random permutation of "ß #ß á ß with > cycles is a multiple of (taking 5 œ > in above problem) simplifies to = ß> x " =ß> x > L. Carlitz, Set Partitions, Fibonacci Quarterly, Nov. 196, pages gives the formula in (b) for the case œ#. Riordan, An Introduction to Combinatorial Analysis, Problem 1, pages 6-, gives a table of the values of the above for œ# and Ÿ)Þ (c) The number of permutations of "ß á ß where every cycle length belongs to the set =ß=ß=#ßá for some integers = and,!ÿ=is x d ' " = " d) "') œ! ) œ! where ' œ/ # 13Î. (d) The number of permutations of "ß á ß where every cycle length is a multiple of (special case of (c) with = œ!) equals x " " This result can be found in Sachkov, Probabilistic Methods in Combinatorial Analysis, Chapter 5, Random Permutations, page 151.
10 Notes: Goulden and Jackson, Combinatorial Enumeration, Wiley-Interscience Series in Discrete Mathematics, 193, Problem (a), page 1 give the answer in the form x x " " œ" Bolker and Gleason, Counting Permutations, Journal of Combinatorial Theory, Series A, Vol. 29, 190, pages give the answer in the form œ " divides ) where )! else œ" (e) The number of permutations of "ß á ß where every cycle length belongs to the set # ß # ß # #ß á for even (special case of (c) with = œ # and even ) equals # x " œ! # " " provided # divides. This result can be found in Sachkov, Probabilistic Methods in Combinatorial Analysis, Chapter 5, Random Permutations, page 151. However there is a misprint where the above sum starts at œ" instead of œ!. (f) The number of permutations of "ß á ß where no cycle is a multiple of is x " 3 3œ! 3 "
11 This result can be found in Goulden and Jackson, Combinatorial Enumeration, Wiley-Interscience Series in Discrete Mathematics, 193, Problem (b), page 1. (g) The probability that a random permutation of "ß #ß á ß contains an even number of cycles all of which have odd length equals " Î# # This result can be found in Wilf, generatingfunctionology, 2nd edition, page. Problem 5. / 9 Let - (- ) equal the number of even (odd) permutations of "ß #ß á ß and let / equal the number of even (odd) permutations of "ß #ß á ß with 5 ß5 cycles. ß5 (a) / - œ " œ " 9 - œ! œ " x and x # # # # This result can be found in Riordan, John, An Introduction to Combinatorial Analysis, Problem 20, page -. Note: The standard proof wherein one demonstrates a bijection by switching the position of elements " and in any permutation and noting that the parity changes is a much simplier proof but the present approach illustrates another aspect of Theorem 1. (b)
12 0 / ß5 œ =ß5 =ß5 # =ß5 5 œ is even! 5 is odd and 9 0 ß5 œ =ß5 =ß5 #! 5 is even œ =ß5 5is odd This result can be found in Sachkov, Probabilistic Methods in Combinatorial Analysis, page 15. Note: Applying Theorem 2 is a useful demonstration but a simplier proof follows from the observation that for fixed and > such that "B" á B œ and B á B œ > with B!ß"ßáßa, then " B# B% B' á is even Í > is even. It follows from this observation that 0 / ß5 œ x " " â BxâBx " "B" ábœ B" ábœ> B# B% B' áœeven B!ß"ßáßa " B B " x " B" " B Bx " âb x " â > œ even "B" ábœ œ B" ábœ> B!ß"ßáßa! > œ odd =ß> œ >œeven! > œ odd Problem 6. (a) How many permutations of "ß #ß á ß are there for which the longest run of
13 "-cycles is less than or equal to 5? (b) How many permutations of "ß #ß á ß with > - cycles are there for which the longest run of "-cycles is less than or equal to 5? (c) How many permutations of "ß #ß á ß are there which have exactly < runs of length 5 of "- cycles? (d) How many permutations of "ß #ß á ß with > -cycles are there which have exactly < runs of length 5 of "- cycles? Problem. if Define [ œ " \ else if Define X œ " \!! else (a) How many permutations of "ß #ß á ß are there for which exactly < of the values in the cycle class 5 ßáß5 i.e. R [ á [ œ< " " (b) E[ á [ " < (c) TX á X œ< " (d) EX á X " < Problem. How many permutations of "ß #ß á ß are there for which all cycle lengths are between 6 and? inclusive? i.e. \ á\ \ á\ œ! " 6"?"
14 Problem 9. (a) Suppose a permutation of "ß #ß á ß is picked at random form the set of all x permutations of "ß #ß á ß and from this permutation a cycle is picked at random. Let [ represent the length of this cycle. Find T [ œ A and E[. < (b) Suppose a permutation of "ß #ß á ß is picked at random form the set of all permutations of "ß #ß á ß with > cycles and from this permutation a cycle is picked at random. Let [ represent the length of this cycle. Find T [ œ A and E[ < (c) Suppose a cycle is picked at random from the set of all cycles. (explain). Let [ represent the length of this cycle. Find T [ œ A and E[ < (d) Suppose a permutation of "ß #ß á ß is picked at random and an element is picked at random from that permutation. Let [ represent the length of this cycle containing the randomly picked element. Find T [ œ A and E[ < Goulden & Jackson, page 190, Problem Show that the number of permutations of "ß #ß á ß in which the cycle containing has length, is " x, for any œ "ßáßÞ Lovasz, page 29, problem 3. Shows that the probability that the cycle containing " 1 has length 5 is for 5 œ"ß#ßáßþ Hence expectation follows immediately. Grusho, A.A. Properties of random permutations with constraints on the maximum cycle length, Probabilistic Methods in Discrete Mathematics, (Petrozavodsk, 1992), pages considers this problem with the additional constraint that no cycle can have length greater than -.
15 Also look at other problems similar to this covered in section on Random Set Partitions Problem 10. T \ \ \ á œ< # % ' Problem 11. Determine the number of permutations of "ß #ß á ß for which the number of < - cycles equals the number of = - cycles. This problem is discussed in Riordan, John, An Introduction to Combinatorial Analysis, Problem 15(b), page -5. Problem 12. Determine the number of permutations of "ß #ß á ß which have no - cycles for any #Þ This problem is discussed in Riordan, John, An Introduction to Combinatorial Analysis, Problem 1, page 5-6. Problem 13. Determine the number of even (odd) permutations of "ß #ß á ß which have no "- cycles.
16 This problem is discussed in Riordan, John, An Introduction to Combinatorial Analysis, Problem 21, page -9. Problem 1. Show that the number of permutations of "ß #ß á ß which have 5 cycles, none of which is a " cycle, # cycle, á, or < cycle is Howard, F. T. refers to these numbers as the <-associated Stirling Numbers of the First Kind in Fibonacci Quarterly, Associated Stirling Numbers, Vol 1, no., 190, pages Problem 15. Record values. Goldie, Charles (199). Records, permutations and greatest convex minorants, Mathematical Proceedings of the Cambridge Philosophical Society, 106, no. 1, pp Let C be a random element of W, the set of permutations of, all x elements of W being equally likely. C may be written as a product of cycles. Let us say that 3 is a new-cycle index if 3does not belong to the cycles containing "ß á ß 3 "Þ The random set of new-cycle indices is denoted V. It always contains 1. Stam, theorem 3) has shown that the events 3 V are independent, with respective probabilities "Î3Þ ÒStam, A.J. (193). Cycles of random permutations, Ars Combinatoria, 16, pages 3-. Ó
17 Let Y be the set of record times. That is, Y À œ Ö3 À \ œ max Ð\ ß á ß \ Ñ 3 " 3 Let e be the set of record values. That is, ÐÑ " e À œ Ö\ 3 À 3 Y ÐÑ " Let \ ßáß\ be the order statistics of \ ßáß\ Theorem 3.1 The events Ö e ß 3 œ "ß á ß are independent with probabilities \ 3 ÐÑ T e œ \ 3 ÐÑ " "3 Proof ÐÑ ÐÑ ÐÑ ÐÑ 3 3 3" ÐÑ ÐÑ \" ßáß\ \ 3" á \ ÐÑ "ÎÐ " 3Ñ \ 3 ÐÑ ÐÑ \ 3" á \ ÐÑ "ÎÐ " 3Ñ \ 3 \ e if and only if \ occurs before \, á, \ in the finite sequence. Whatever order,, occur in among themselves, there is probability that occurs earlier. Thus given information on which of,, are record values, there is always probability that is a record value. (?) I give this argument here because I wonder if this argument is (1) rigorous and (2) can be used to prove the hook length formula. Note that in case where ÐÑ \ ßáß\ is a permutation of 1, á,, then \ œ. Let " ÐÑ M œ " \ e! else Consider TM œ"±m œ"ßáßm œ" " ÐÑ ÐÑ We are given that \ ", á,\ are record values so we know that ÐÑ ÐÑ ÐÑ " # " \ occurs before \, á,\ in the finite sequence \ ßáß\
18 and and ÐÑ ÐÑ ÐÑ # $ " \ occurs before \, á,\ in the finite sequence \ ßáß\ ÐÑ " ÐÑ " \ occurs before \ in the finite sequence \ ßáß\ conditioning but (as the argument goes) that tells us nothing about whether ÐÑ " ÐÑ " before \, á,\ in the finite sequence \ ßáß\. The ÐÑ " \ ÐÑ occurs only tells us about the position of \, á,\ relative to each other. ÐÑ Therefore TM œ"±m" œ"ßáßm œ" œtm œ" and subsequently TM" œ"ßm# œ"ßáßm œ" œtm œ"t M" œ"±m œ" âtm" œ"±m# œ"ßáßm œ" œtm œ"t M œ" âtm œ" " " which shows independence. Karamata-Stirling laws. The OW probability law is defined to be that of ^ á ^ where ^ ß á ß ^ " are independent and T ^ œ " œ "Î3ß T ^ œ! œ " "Î3Þ " 3 3 Explicitly, T^" á ^ œ5 œ =ß5 x Ð5œ!ß"ßáßÑ OW is the distribution of ( i) the number of cycles in a random permutation of n objects ( ii) the number of records in n exchangeable unequal r.v.s. ( iii) the number of sides in the gem of an n-step random walk with
19 Problem 16. exchangeable rationally independent increments
Principle 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 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 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 information#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION
#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION Samuel Connolly Department of Mathematics, Brown University, Providence, Rhode Island Zachary Gabor Department of
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 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 informationCombinatorics and Intuitive Probability
Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the
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 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 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 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 informationA Coloring Problem. Ira M. Gessel 1 Department of Mathematics Brandeis University Waltham, MA Revised May 4, 1989
A Coloring Problem Ira M. Gessel Department of Mathematics Brandeis University Waltham, MA 02254 Revised May 4, 989 Introduction. Awell-known algorithm for coloring the vertices of a graph is the greedy
More informationPermutations of a Multiset Avoiding Permutations of Length 3
Europ. J. Combinatorics (2001 22, 1021 1031 doi:10.1006/eujc.2001.0538 Available online at http://www.idealibrary.com on Permutations of a Multiset Avoiding Permutations of Length 3 M. H. ALBERT, R. E.
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 information5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.
A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
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 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 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 informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
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 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 information18.204: CHIP FIRING GAMES
18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on
More informationEuropean Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap
European Journal of Combinatorics 30 (2009) 532 539 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Staircase rook polynomials
More informationOn uniquely k-determined permutations
Discrete Mathematics 308 (2008) 1500 1507 www.elsevier.com/locate/disc On uniquely k-determined permutations Sergey Avgustinovich a, Sergey Kitaev b a Sobolev Institute of Mathematics, Acad. Koptyug prospect
More informationNOTES ON SEPT 13-18, 2012
NOTES ON SEPT 13-18, 01 MIKE ZABROCKI Last time I gave a name to S(n, k := number of set partitions of [n] into k parts. This only makes sense for n 1 and 1 k n. For other values we need to choose a convention
More informationChapter 6.1. Cycles in Permutations
Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,
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 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 informationAvoiding consecutive patterns in permutations
Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set
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 informationThe Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 3 (2017), pp. 1091-1101 Research India Publications http://www.ripublication.com The Classification of Quadratic Rook Polynomials
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 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 informationCombinatorics. Chapter Permutations. Counting Problems
Chapter 3 Combinatorics 3.1 Permutations Many problems in probability theory require that we count the number of ways that a particular event can occur. For this, we study the topics of permutations and
More informationSMT 2014 Advanced Topics Test Solutions February 15, 2014
1. David flips a fair coin five times. Compute the probability that the fourth coin flip is the first coin flip that lands heads. 1 Answer: 16 ( ) 1 4 Solution: David must flip three tails, then heads.
More informationECE313 Summer Problem Set 4. Reading: RVs, mean, variance, and coniditional probability
ECE Summer 0 Problem Set Reading: RVs, mean, variance, and coniditional probability Quiz Date: This Friday Note: It is very important that you solve the problems first and check the solutions afterwards.
More informationCorners in Tree Like Tableaux
Corners in Tree Like Tableaux Pawe l Hitczenko Department of Mathematics Drexel University Philadelphia, PA, U.S.A. phitczenko@math.drexel.edu Amanda Lohss Department of Mathematics Drexel University Philadelphia,
More informationAn Optimal Algorithm for a Strategy Game
International Conference on Materials Engineering and Information Technology Applications (MEITA 2015) An Optimal Algorithm for a Strategy Game Daxin Zhu 1, a and Xiaodong Wang 2,b* 1 Quanzhou Normal University,
More informationSMT 2013 Advanced Topics Test Solutions February 2, 2013
1. How many positive three-digit integers a c can represent a valid date in 2013, where either a corresponds to a month and c corresponds to the day in that month, or a corresponds to a month and c corresponds
More informationMath 3012 Applied Combinatorics Lecture 2
August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from
More informationCSE 312 Midterm Exam May 7, 2014
Name: CSE 312 Midterm Exam May 7, 2014 Instructions: You have 50 minutes to complete the exam. Feel free to ask for clarification if something is unclear. Please do not turn the page until you are instructed
More informationA combinatorial proof for the enumeration of alternating permutations with given peak set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 293 300 A combinatorial proof for the enumeration of alternating permutations with given peak set Alina F.Y. Zhao School of Mathematical Sciences
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 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 informationPrimitive Roots. Chapter Orders and Primitive Roots
Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are therefore generators in that sense,
More informationAlgebra. Recap: Elements of Set Theory.
January 14, 2018 Arrangements and Derangements. Algebra. Recap: Elements of Set Theory. Arrangements of a subset of distinct objects chosen from a set of distinct objects are permutations [order matters]
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 informationDistribution of Primes
Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we
More informationThe 99th Fibonacci Identity
The 99th Fibonacci Identity Arthur T. Benjamin, Alex K. Eustis, and Sean S. Plott Department of Mathematics Harvey Mudd College, Claremont, CA, USA benjamin@hmc.edu Submitted: Feb 7, 2007; Accepted: Jan
More informationCounting Things. Tom Davis November 14, 2002
Counting Things Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November 14, 2002 Abstract We present here various strategies for counting things. Usually, the things are patterns,
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 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 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 informationTeacher s Notes. Problem of the Month: Courtney s Collection
Teacher s Notes Problem of the Month: Courtney s Collection Overview: In the Problem of the Month, Courtney s Collection, students use number theory, number operations, organized lists and counting methods
More informationm-partition Boards and Poly-Stirling Numbers
47 6 Journal of Integer Sequences, Vol. (00), Article 0.. m-partition Boards and Poly-Stirling Numbers Brian K. Miceli Department of Mathematics Trinity University One Trinity Place San Antonio, T 78-700
More informationThree Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.
Three Pile Nim with Move Blocking Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@emailunccedu
More informationResearch Article n-digit Benford Converges to Benford
International Mathematics and Mathematical Sciences Volume 2015, Article ID 123816, 4 pages http://dx.doi.org/10.1155/2015/123816 Research Article n-digit Benford Converges to Benford Azar Khosravani and
More information7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count
7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count Probability deals with predicting the outcome of future experiments in a quantitative way. The experiments
More informationIMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.
IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital
More informationLower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
ÂÓÙÖÒÐ Ó ÖÔ ÐÓÖØÑ Ò ÔÔÐØÓÒ ØØÔ»»ÛÛÛº ºÖÓÛÒºÙ»ÔÙÐØÓÒ»» vol.?, no.?, pp. 1 44 (????) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings David R. Wood School of Computer Science
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 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 information132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers
132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers arxiv:math/0205206v1 [math.co] 19 May 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA 17325
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
More informationSTRATEGY AND COMPLEXITY OF THE GAME OF SQUARES
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white
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 informationMathematical Foundations of Computer Science Lecture Outline August 30, 2018
Mathematical Foundations of omputer Science Lecture Outline ugust 30, 2018 ounting ounting is a part of combinatorics, an area of mathematics which is concerned with the arrangement of objects of a set
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 informationCMath 55 PROFESSOR KENNETH A. RIBET. Final Examination May 11, :30AM 2:30PM, 100 Lewis Hall
CMath 55 PROFESSOR KENNETH A. RIBET Final Examination May 11, 015 11:30AM :30PM, 100 Lewis Hall Please put away all books, calculators, cell phones and other devices. You may consult a single two-sided
More informationSolution: This is sampling without repetition and order matters. Therefore
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
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 informationChapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
1 Relations This book starts with one of its most abstract topics, so don't let the abstract nature deter you. Relations are quite simple but like virtually all simple mathematical concepts they have their
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 6 Lecture Notes Discrete Probability Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. Introduction and
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 informationINDIAN STATISTICAL INSTITUTE
INDIAN STATISTICAL INSTITUTE B1/BVR Probability Home Assignment 1 20-07-07 1. A poker hand means a set of five cards selected at random from usual deck of playing cards. (a) Find the probability that it
More informationCardinality and Bijections
Countable and Cardinality and Bijections Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 13, 2012 Countable and Countable and Countable and How to count elements in a set? How
More informationMA10103: Foundation Mathematics I. Lecture Notes Week 3
MA10103: Foundation Mathematics I Lecture Notes Week 3 Indices/Powers In an expression a n, a is called the base and n is called the index or power or exponent. Multiplication/Division of Powers a 3 a
More informationDistribution of the Number of Corners in Tree-like and Permutation Tableaux
Distribution of the Number of Corners in Tree-like and Permutation Tableaux Paweł Hitczenko Department of Mathematics, Drexel University, Philadelphia, PA 94, USA phitczenko@math.drexel.edu Aleksandr Yaroslavskiy
More informationProblem Set 8 Solutions R Y G R R G
6.04/18.06J Mathematics for Computer Science April 5, 005 Srini Devadas and Eric Lehman Problem Set 8 Solutions Due: Monday, April 11 at 9 PM in Room 3-044 Problem 1. An electronic toy displays a 4 4 grid
More informationSection Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning
Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon
More informationHonors Precalculus Chapter 9 Summary Basic Combinatorics
Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
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 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 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 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 informationSolutions to Problem Set 7
Massachusetts Institute of Technology 6.4J/8.6J, Fall 5: Mathematics for Computer Science November 9 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 3, 5, 3 minutes Solutions to Problem
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not
More informationGraphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA
Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department
More information2. Nine points are distributed around a circle in such a way that when all ( )
1. How many circles in the plane contain at least three of the points (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)? Solution: There are ( ) 9 3 = 8 three element subsets, all
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationCSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions)
CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions Review: Main Theorems and Concepts Combinations (number of ways to choose k objects out of n distinct objects,
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 informationStrings. A string is a list of symbols in a particular order.
Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More information