Counting Permutations with Even Valleys and Odd Peaks
|
|
- Jemimah Pitts
- 5 years ago
- Views:
Transcription
1 Counting Permutations with Even Valleys and Odd Peaks Ira M. Gessel Department of Mathematics Brandeis University IMA Workshop Geometric and Enumerative Combinatorics University of Minnesota, Twin Cities November 13, 2014
2 Based on the paper Counting permutations by alternating descents, by Ira M. Gessel and Yan Zhuang, Electronic Journal of Combinatorics 21 (4), 2014, Paper #P4.23
3 Introduction Let = 1 2 n be a permutation of [n] ={1, 2,...,n}. Then i is a peak if i 1 < i > i+1 j is a valley of if j 1 > j < j+1.
4 Introduction Let = 1 2 n be a permutation of [n] ={1, 2,...,n}. Then i is a peak if i 1 < i > i+1 j is a valley of if j 1 > j < j+1. Example (peaks in blue, valleys in red):
5 On Math Overflow Liviu Nicolaescu, motivated by discrete Morse functions, asked the following question: How many permutations of [n] are there are in which every valley is even and every peak is odd?
6 On Math Overflow Liviu Nicolaescu, motivated by discrete Morse functions, asked the following question: How many permutations of [n] are there are in which every valley is even and every peak is odd? Let f (n) be the number of such permutations of [n]. We can compute the first values by brute force:
7 On Math Overflow Liviu Nicolaescu, motivated by discrete Morse functions, asked the following question: How many permutations of [n] are there are in which every valley is even and every peak is odd? Let f (n) be the number of such permutations of [n]. We can compute the first values by brute force: n f(n) For example, with n = 3 the 4 permutations are (all except 132 and 231) 123, 213, 312, 321
8 Sometimes exponential generating functions for certain classes of permutations defined by restrictions on descents have nice reciprocals. So let s look at the reciprocal of P 1 n=0 f (n)x n /n!. We find that 1 X n=0 f (n)x n /n! 1 = 1 x + 2 x 3 3! 5 x 4 6 4! + 61x 6! 272 x 7 9 7! x 9!
9 Sometimes exponential generating functions for certain classes of permutations defined by restrictions on descents have nice reciprocals. So let s look at the reciprocal of P 1 n=0 f (n)x n /n!. We find that 1 X n=0 f (n)x n /n! 1 = 1 x + 2 x 3 3! 5 x 4 6 4! + 61x 6! 272 x 7 9 7! x 9! The coefficients are Euler numbers: 1X x n E n = sec x + tan x n! n=0 = 1 + x + x ! + 2x 3! + 5x 4! + 16x 5! + 61x 6! x 7 8 7! x 8! +
10 So it seems that 1X n=0 f (n) x n n! = 1 E 1 x + E 3 x 3 3! x 4 E 4 4! + E x 6 6 6! x 7 1 E 7 7! +.
11 So it seems that 1X n=0 f (n) x n n! = 1 E 1 x + E 3 x 3 3! x 4 E 4 4! + E x 6 6 6! x 7 1 E 7 7! +. This is reminiscent of the generating function 1 x + x 3 3! x 4 4! + x 6 6! x 7 1 7! + for permutations with no increasing runs of length 3 or more, due to David and Barton (1962).
12 So it seems that 1X n=0 f (n) x n n! = 1 E 1 x + E 3 x 3 3! x 4 E 4 4! + E x 6 6 6! x 7 1 E 7 7! +. This is reminiscent of the generating function 1 x + x 3 3! x 4 4! + x 6 6! x 7 1 7! + for permutations with no increasing runs of length 3 or more, due to David and Barton (1962). Is this just a coincidence?
13 Another form of the generating function is 1 E 1 x + E 3 x 3 3! x 4 E 4 4! + E x 6 6 6! x 7 1 E 7 7! + 3 sin 1 2 x + 3 cosh 1 p 2 3x = 3 cos 1 2 x p 3 sinh 1 p. 2 3x
14 Descents of permutations Let = 1 n be a permutation of [n]. Adescent of is an i such that i > i+1. The descents of a permutation split it into increasing runs, which are maximal consecutive increasing subsequences.
15 Descents of permutations Let = 1 n be a permutation of [n]. Adescent of is an i such that i > i+1. The descents of a permutation split it into increasing runs, which are maximal consecutive increasing subsequences. For example the permutation has descent set {3, 5, 6}: The increasing runs have lengths 3, 2, 1, 2.
16 Descents of permutations Let = 1 n be a permutation of [n]. Adescent of is an i such that i > i+1. The descents of a permutation split it into increasing runs, which are maximal consecutive increasing subsequences. For example the permutation has descent set {3, 5, 6}: The increasing runs have lengths 3, 2, 1, 2. We call the sequence of increasing run lengths the descent composition of. (It is a composition of n.) The descent composition has the same information as the descent set.
17 Descents of permutations Let = 1 n be a permutation of [n]. Adescent of is an i such that i > i+1. The descents of a permutation split it into increasing runs, which are maximal consecutive increasing subsequences. For example the permutation has descent set {3, 5, 6}: The increasing runs have lengths 3, 2, 1, 2. We call the sequence of increasing run lengths the descent composition of. (It is a composition of n.) The descent composition has the same information as the descent set. We ll write D(L) for the descent set corresponding to L.
18 Let L =(L 1,...,L k ) be a composition of n. Then we write n L for the multinomial coefficient n! L 1! L k! Lemma. The number of permutations of n with descent set contained in D(L) is n L.
19 Let L =(L 1,...,L k ) be a composition of n. Then we write n L for the multinomial coefficient n! L 1! L k! Lemma. The number of permutations of n with descent set contained in D(L) is n L. Proof by example. Take L =(3, 1, 2), so n = 6 and D(L) ={3, 4}. We take 1,2,..., 6 and put them into 3 boxes with three in the first, one in the second, and two in the third:
20 Let L =(L 1,...,L k ) be a composition of n. Then we write n L for the multinomial coefficient n! L 1! L k! Lemma. The number of permutations of n with descent set contained in D(L) is n L. Proof by example. Take L =(3, 1, 2), so n = 6 and D(L) ={3, 4}. We take 1,2,..., 6 and put them into 3 boxes with three in the first, one in the second, and two in the third: We arrange the numbers in each box in increasing order and then remove the bars to get which has descent set contained in {3, 4}.
21 We can find the number of permutations of n with a given descent set by inclusion-exclusion. Let us partial order compositions of n by reverse refinement, corresponding to ordering descent sets by inclusion. So the compositions of 3 are ordered as (1,1,1) (1, 2) (2,1) (3)
22 Let (L) be the number of permutations of [n] with descent composition L, where L is a composition of n.
23 Let (L) be the number of permutations of [n] with descent composition L, where L is a composition of n. Then n L = P K applel (K ), so by inclusion-exclusion (L) = X n ( 1) l(l) l(k ), K K applel where l(l) is the number of parts of L.
24 Let (L) be the number of permutations of [n] with descent composition L, where L is a composition of n. Then n L = P K applel (K ), so by inclusion-exclusion (L) = X n ( 1) l(l) l(k ), K K applel where l(l) is the number of parts of L. We can count all sorts of sets of permutations defined by descent sets by added up (L) for appropriate L. We get exponential generating functions since n L is the coefficient of x n /n! in x L L1 Lk x := x L! L 1! L k!.
25 Alternating descents Following Denis Chebikin (2008), we define an alternating descent of a permutation to be an odd descent or an even ascent. For example the alternating descents of are 3 and 6:
26 Alternating descents Following Denis Chebikin (2008), we define an alternating descent of a permutation to be an odd descent or an even ascent. For example the alternating descents of are 3 and 6: The alternating descents of a permutation split it up into alternating runs. Each alternating run is either an up-down" permutation if it starts in an odd position or a down-up" permutation if it starts in an even position.
27 Alternating descents Following Denis Chebikin (2008), we define an alternating descent of a permutation to be an odd descent or an even ascent. For example the alternating descents of are 3 and 6: The alternating descents of a permutation split it up into alternating runs. Each alternating run is either an up-down" permutation if it starts in an odd position or a down-up" permutation if it starts in an even position. Nicolaescu s question is closely connected to alternating runs of permutations, because a permutation has all valleys even and all peaks odd if and only if all of its alternating runs have length less than 3.
28 This is because an odd valley or an even peak corresponds to an alternating run of length at least 3:
29 As Chebikin observed, the number of permutations of [n] with alternating descent set contained in D(L) is n n! := L L 1! L k! E L 1 E Lk E We prove this by putting the numbers 1,..., n into boxes with L i in the ith box, and then arranging the numbers in each box into either an up-down or down-up permutation, depending on the parity of the starting position.
30 Now let ˆ(L) be the number of permutations of [n] with alternating descent composition L, where L is a composition of n n. Then just as before, L E = P ˆ(K K applel ), so by inclusion-exclusion ˆ(L) = X n ( 1) l(l) l(k ). K K applel E
31 Now let ˆ(L) be the number of permutations of [n] with alternating descent composition L, where L is a composition of n n. Then just as before, L E = P ˆ(K K applel ), so by inclusion-exclusion ˆ(L) = X n ( 1) l(l) l(k ). K K applel E Note that n L E is the coefficient of x n /n! in E L1 x L 1 L 1! E L k x Lk L k!.
32 Therefore, if we can find an exponential generating function for some class of permutations determined by descent sets, obtained by adding up (L)x L /L! for appropriate L, then by changing x n /n! to E n x n /n! we should get the corresponding result for alternating descent sets. This will explain the connection between 1 x + x 3 3! x 4 4! + x 6 6! x 7 1 7! + and 1 E 1 x + E 3 x 3 3! x 4 E 4 4! + E x 6 6 6! x 7 1 E 7 7! +.
33 Unfortunately, just changing to x n /n! with E n x n /n! doesn t really work:
34 Unfortunately, just changing to x n /n! with E n x n /n! doesn t really work: we would like a linear map that takes to x L 1 Lk x L 1! L k!. E L1 x L 1 L 1! E L k x Lk L k!. but we can t do this since these products aren t linearly independent.
35 For example, but x 2 2! x 3 5 3! = 10x 5!, x 2 E 2 2! E x 3 3 3! 6= 10E x 5 5 5!
36 To make this work, and to compute the generating functions more efficiently, we use noncommutatative symmetric functions, which were studied extensively by Gelfand, Krob, Lascoux, Leclerc, Retakh, and Thibon in 1995 and further studied by Thibon and others since then. But we will need only some very simple properties of the noncommutative symmetric functions most of which were known earlier.
37 We work with formal power series in noncommuting variables X 1, X 2,... We define the complete noncommutative symmetric functions h n = X X i1 X i2 X in. i 1 apple applei n For any composition L =(L 1,...,L k ) of n we define which can be written as h L = h L1 h Lk h L = X L X i1 X i2 X in where the sum is over all (i 1,...,i n ) satisfying i 1 apple apple i L1, i L1+1 apple apple i L1+L {z } 2,, i L1+ +L {z } k 1+1 apple apple i n {z } L 1 L 2 L k.
38 We define the ribbon noncommutative symmetric functions r L = X L X i1 X i2 X in where the sum is over all (i 1,...,i n ) satisfying i 1 apple apple i L1 > i L1+1 apple apple i L1+L {z } 2 > > i L1+ +L {z } k 1+1 apple apple i n {z } L 1 L 2 L k. Then h L = X K applel r K, so by inclusion-exclusion, r L = X K applel( 1) l(l) l(k ) h K
39 The algebra of noncommutative symmetric functions is generated by the h L.
40 The algebra of noncommutative symmetric functions is generated by the h L. When we make the X i commute, we get ordinary symmetric functions: h L becomes the ordinary complete symmetric function h L, and r L becomes the ribbon (skew-hook, zigzag) skew Schur function.
41 We can define a homomorphism from noncommutative symmetric functions to exponential generating functions by so (h n )= x n n! (h L )= x L 1 Lk x L 1! L k! = n x n L n!. Note that for a noncommutative symmetric function f, (f ) is the coefficient of x 1 x 2 x n in the result of replacing X 1, X 2,... with commuting variables x 1, x 2,... Then by inclusion-exclusion, (r L )= (L) x n n!.
42 Similarly, we can define another homomorphism from noncommutative symmetric functions to exponential generating functions by ˆ(h n )=E n x n n! so by the inclusion-exclusion formula for ˆ we have ˆ(rL )= ˆ(L) x n n!.
43 This means that if we can find the noncommutative symmetric function generating function for some class of words determined by their descent sets (i.e., we can express it in terms of the r L ), then by applying and ˆ we can get the corresponding exponential generating functions for permutations with the corresponding descent sets or alternating descent sets.
44 This means that if we can find the noncommutative symmetric function generating function for some class of words determined by their descent sets (i.e., we can express it in terms of the r L ), then by applying and ˆ we can get the corresponding exponential generating functions for permutations with the corresponding descent sets or alternating descent sets. There are many formulas to which we can apply and ˆ, but one that gives us what we need for Nicolaescu s problem is the following:
45 Theorem 1. (G, Jackson and Aleliunas; 1977) Let w 1, w 2,... be arbitrary commuting weights. Then X X 1 1 w L r L = a n h n L n=0 where the sum on the left is over all compositions L =(L 1,...,L k ), and w L = w L1 w Lk. Here a 0, a 1,... are defined by where w 0 = 1. 1X X 1 1 a n z n = w n z n, n=0 n=0
46 If we take w i = 1 for i < m and w i = 0 for i m in Theorem 1 then we get X X 1 1 r L = (h mn h mn+1 ), L n=0 where the sum on the left is over compositions L with all parts less than m.
47 If we take w i = 1 for i < m and w i = 0 for i m in Theorem 1 then we get X X 1 1 r L = (h mn h mn+1 ), L n=0 where the sum on the left is over compositions L with all parts less than m. Applying gives David and Barton s result that the exponential generating function for permutations in which every increasing run has length less than m is 1 x + x m m! x m+1 (m + 1)! + x 2m (2m)! x 2m+1 1 (2m + 1)! +,
48 Applying ˆ gives " X 1 x E mn mn n=0 (mn)! E mn+1 x mn+1 (mn + 1)! # 1 as the exponential generating function for permutations in which every alternating run has length less than m; the case m = 3 is the solution to Nicolaescu s problem.
49 Two more special cases of Theorem 1 If we set w m = 1 and w n = 0 for n 6= m then we find that 1X X 1 1 r (m n ) = ( 1) n h mn, n=0 n=0 Applying gives Carlitz s 1973 result that X 1 ( 1) n x mn (mn)! n=0 1 is the exponential generating function for permutations in which every increasing run has length m.
50 Applying ˆ shows that X 1 ( 1) n x mn E mn (mn)! n=0 1 counts permutations in which every alternating run has length m.
51 Applying ˆ shows that X 1 ( 1) n x mn E mn (mn)! n=0 1 counts permutations in which every alternating run has length m. For m = 4, these are permutations of [4n] with descent set {2, 6, 10,...,4n 2}.
52 If we set w n = t for all n 1 in Theorem 1, then we are counting words by the number of increasing runs (which is one more than the number of descents), and we get X L apple t l(l) r L =(1 t) 1 t 1X (1 t) n h n 1, n=0 where the first sum is over all compositions L.
53 If we set w n = t for all n 1 in Theorem 1, then we are counting words by the number of increasing runs (which is one more than the number of descents), and we get X L apple t l(l) r L =(1 t) 1 t 1X (1 t) n h n 1, n=0 where the first sum is over all compositions L. Applying gives the well-known generating function for the Eulerian polynomials, where 1 + 1X A n (t) x n n! = 1 t, 1 te (1 t)x n=1 A n (t) = X 2S n t des( )+1, and des( ) is the number of descents of.
54 Applying ˆ gives where 1 + 1X n=1 Â n (t) x n n! = 1 t 1 t sec(1 t)x + tan(1 t)x, Â n (t) = X 2S n t altdes( )+1 and altdes( ) is the number of alternating descents of, a result due to Chebikin.
55 The major index and alternating major index We define the major index maj( ) of a permutation to be the sum of the descents of, and we define the alternating major index altmaj( ) to be the sum of the alternating descents of. Then there is an analogue of Theorem 1 that allows us to count permutations by major index and alternating major index. I ll just state the results:
56 1X x n P 2S n t des( ) q maj( ) 1 n! (1 t)(1 tq) (1 tq n ) = X n=0 k=0 t k ky j=0 e xqj (MacMahon/Riordan 1954/Carlitz 1975) 1X n=0 x n n! P 2S n t altdes( ) q altmaj( ) (1 t)(1 tq) (1 tq n ) = 1X k=0 t k ky j=0 sec(xq j )+tan(xq j ) (Remmel)
57 The remaining material was not presented during my talk.
58 More homomorphisms There are other homomorphisms from the ring of noncommutative symmetric functions that enable us to count permutations by other parameters.
59 More homomorphisms There are other homomorphisms from the ring of noncommutative symmetric functions that enable us to count permutations by other parameters. The simplest one allows us to count permutations by inversions. An inversion of a permutation is a pair (i, j) with i < j such that i > j. We define a homomorphism 1 on noncommutative symmetric function by 1(h n )= x n (q) n, where (q) n =(1 q)(1 q 2 ) (1 q n ). Then if L is a composition of n, we have 1(r L )= X C( )=L q inv( ) x n (q) n.
60 We define the inverse major index imaj( ) to be maj( 1 ). Then it s also true that 1(r L )= X C( )=L q imaj( ) x n (q) n.
61 We define the inverse major index imaj( ) to be maj( 1 ). Then it s also true that 1(r L )= X C( )=L q imaj( ) x n (q) n. Thus, for example, 1 x + x 3 x 4 + x 6 x (q) 3 (q) 4 (q) 6 (q) 7 is the Eulerian generating function for permutations with no increasing runs of length 3 by inversions or by inverse major index.
62 More generally, if we make the variables X i commute, we get the quasi-symmetric generating function for counting permutations by their inverse descent set, from which we can count by the number of inverse descents, or the number of inverse peaks, etc.
63 These homomorphisms may be defined more naturally on a larger algebra than the noncommutative symmetric functions, the Malvenuto-Reutenauer algebra (also called the algebra of free quasi-symmetric functions).
64 These homomorphisms may be defined more naturally on a larger algebra than the noncommutative symmetric functions, the Malvenuto-Reutenauer algebra (also called the algebra of free quasi-symmetric functions). To define it, we first define the standardization st(w) of the word w to be the permutation obtained by replacing the smallest entry by 1, the next smallest by 2, and so on, where repeated letters are ordered from left to right, so for example st(115212)=
65 Then for each 2 S n we define a series [ ] in the noncommuting variables X 1, X 2,... by [ ] = X X i1 X in st(i 1 i n)= For example, and [132] = X X a X c X b aappleb<c [12 n] =h n.
66 The Malvenuto-Reutenauer algebra is spanned by the [ ] with 2 S n for some n.
67 The Malvenuto-Reutenauer algebra is spanned by the [ ] with 2 S n for some n. It s easy to describe how these basis elements multiply: if 2 S m and 2 S n then [ ][ ]= X [ ] where the sum is over all = 1 m+n 2 S m+n for which st( 1 m )= and st( m+1 m+n )=.
68 Then the algebra of noncommutative symmetric functions is the subalgebra of the Malvenuto-Reutenauer algebra generating by the h n =[1 n]. Then the homomorphism MR, we can define either 1 extends in two different ways to or where 2 S n. x n 1a([ ]) = q inv( ) (q) n x n 1b([ ]) = q imaj( ), (q) n
69 We have the following relations between the algebras that we ve discussed: NCSF! MR?? y y SF! QSF
Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration
Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration Ira M. Gessel Department of Mathematics Brandeis University Sapienza Università di Roma July 10, 2013 Exponential generating functions
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 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 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 informationCounting Permutations by Putting Balls into Boxes
Counting Permutations by Putting Balls into Boxes Ira M. Gessel Brandeis University C&O@40 Conference June 19, 2007 I will tell you shamelessly what my bottom line is: It is placing balls into boxes. Gian-Carlo
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 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 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 informationPRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma
PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement
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 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 informationTHE TAYLOR EXPANSIONS OF tan x AND sec x
THE TAYLOR EXPANSIONS OF tan x AND sec x TAM PHAM AND RYAN CROMPTON Abstract. The report clarifies the relationships among the completely ordered leveled binary trees, the coefficients of the Taylor expansion
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 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 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 informationAlternating Permutations
Alternating Permutations p. Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic definitions A sequence a 1, a 2,..., a k of distinct integers is alternating if a 1 > a
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 informationInversions on Permutations Avoiding Consecutive Patterns
Inversions on Permutations Avoiding Consecutive Patterns Naiomi Cameron* 1 Kendra Killpatrick 2 12th International Permutation Patterns Conference 1 Lewis & Clark College 2 Pepperdine University July 11,
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 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 informationLaunchpad Maths. Arithmetic II
Launchpad Maths. Arithmetic II LAW OF DISTRIBUTION The Law of Distribution exploits the symmetries 1 of addition and multiplication to tell of how those operations behave when working together. Consider
More informationThe mathematics of the flip and horseshoe shuffles
The mathematics of the flip and horseshoe shuffles Steve Butler Persi Diaconis Ron Graham Abstract We consider new types of perfect shuffles wherein a deck is split in half, one half of the deck is reversed,
More informationCounting in Algorithms
Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different
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 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 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 informationStacking Blocks and Counting Permutations
Stacking Blocks and Counting Permutations Lara K. Pudwell Valparaiso University Valparaiso, Indiana 46383 Lara.Pudwell@valpo.edu In this paper we will explore two seemingly unrelated counting questions,
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 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 informationA NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA
A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied
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 informationTHE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LXI, 2015, f.2 THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m BY FLORIAN LUCA and AUGUSTINE O.
More informationAsymptotic behaviour of permutations avoiding generalized patterns
Asymptotic behaviour of permutations avoiding generalized patterns Ashok Rajaraman 311176 arajaram@sfu.ca February 19, 1 Abstract Visualizing permutations as labelled trees allows us to to specify restricted
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 information#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS
#A INTEGERS 8 (08) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS Alice L.L. Gao Department of Applied Mathematics, Northwestern Polytechnical University, Xi an, Shaani, P.R. China llgao@nwpu.edu.cn Sergey
More informationQuarter Turn Baxter Permutations
Quarter Turn Baxter Permutations Kevin Dilks May 29, 2017 Abstract Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these
More informationarxiv: v1 [math.co] 31 Dec 2018
arxiv:1901.00026v1 [math.co] 31 Dec 2018 PATTERN AVOIDANCE IN PERMUTATIONS AND THEIR 1. INTRODUCTION SQUARES Miklós Bóna Department of Mathematics University of Florida Gainesville, Florida Rebecca Smith
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 informationSorting with Pop Stacks
faculty.valpo.edu/lpudwell joint work with Rebecca Smith (SUNY - Brockport) Special Session on Algebraic and Enumerative Combinatorics with Applications AMS Spring Central Sectional Meeting Indiana University
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 informationThree of these grids share a property that the other three do not. Can you find such a property? + mod
PPMTC 22 Session 6: Mad Vet Puzzles Session 6: Mad Veterinarian Puzzles There is a collection of problems that have come to be known as "Mad Veterinarian Puzzles", for reasons which will soon become obvious.
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 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 informationSimple permutations and pattern restricted permutations
Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that
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 informationOn joint distribution of adjacencies, descents and some Mahonian statistics
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 469 480 On joint distriution of adjacencies, descents and some Mahonian statistics Alexander Burstein 1 1 Department of Mathematics, Howard University,
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 informationConnected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008
1 Connected Permutations, Hypermaps and Weighted Dyck Words 2 Why? Graph embeddings Nice bijection by Patrice Ossona de Mendez and Pierre Rosenstiehl. Deduce enumerative results. Extensions? 3 Cycles (or
More informationA Graph Theory of Rook Placements
A Graph Theory of Rook Placements Kenneth Barrese December 4, 2018 arxiv:1812.00533v1 [math.co] 3 Dec 2018 Abstract Two boards are rook equivalent if they have the same number of non-attacking rook placements
More informationThe mathematics of the flip and horseshoe shuffles
The mathematics of the flip and horseshoe shuffles Steve Butler Persi Diaconis Ron Graham Abstract We consider new types of perfect shuffles wherein a deck is split in half, one half of the deck is reversed,
More informationYet Another Triangle for the Genocchi Numbers
Europ. J. Combinatorics (2000) 21, 593 600 Article No. 10.1006/eujc.1999.0370 Available online at http://www.idealibrary.com on Yet Another Triangle for the Genocchi Numbers RICHARD EHRENBORG AND EINAR
More informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
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 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 informationHonors Algebra 2 Assignment Sheet - Chapter 1
Assignment Sheet - Chapter 1 #01: Read the text and the examples in your book for the following sections: 1.1, 1., and 1.4. Be sure you read and understand the handshake problem. Also make sure you copy
More informationarxiv: v1 [math.co] 8 Oct 2012
Flashcard games Joel Brewster Lewis and Nan Li November 9, 2018 arxiv:1210.2419v1 [math.co] 8 Oct 2012 Abstract We study a certain family of discrete dynamical processes introduced by Novikoff, Kleinberg
More informationRandom permutations avoiding some patterns
Random permutations avoiding some patterns Svante Janson Knuth80 Piteå, 8 January, 2018 Patterns in a permutation Let S n be the set of permutations of [n] := {1,..., n}. If σ = σ 1 σ k S k and π = π 1
More informationBounds for Cut-and-Paste Sorting of Permutations
Bounds for Cut-and-Paste Sorting of Permutations Daniel Cranston Hal Sudborough Douglas B. West March 3, 2005 Abstract We consider the problem of determining the maximum number of moves required to sort
More informationInternational Journal of Combinatorial Optimization Problems and Informatics. E-ISSN:
International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Karim,
More informationAn old pastime.
Ringing the Changes An old pastime http://www.youtube.com/watch?v=dk8umrt01wa The mechanics of change ringing http://www.cathedral.org/wrs/animation/rounds_on_five.htm Some Terminology Since you can not
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 informationRemember that represents the set of all permutations of {1, 2,... n}
20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.
More informationLAMC Junior Circle February 3, Oleg Gleizer. Warm-up
LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator
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 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 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 informationNotes for Recitation 3
6.042/18.062J Mathematics for Computer Science September 17, 2010 Tom Leighton, Marten van Dijk Notes for Recitation 3 1 State Machines Recall from Lecture 3 (9/16) that an invariant is a property of a
More informationGame Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games
Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations
More informationNOT QUITE NUMBER THEORY
NOT QUITE NUMBER THEORY EMILY BARGAR Abstract. Explorations in a system given to me by László Babai, and conclusions about the importance of base and divisibility in that system. Contents. Getting started
More informationCOMBINATORICS ON BIGRASSMANNIAN PERMUTATIONS AND ESSENTIAL SETS
COMBINATORICS ON BIGRASSMANNIAN PERMUTATIONS AND ESSENTIAL SETS MASATO KOBAYASHI Contents 1. Symmetric groups 2 Introduction 2 S n as a Coxeter group 3 Bigrassmannian permutations? 4 Bigrassmannian statistics
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
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 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 informationFast Sorting and Pattern-Avoiding Permutations
Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in
More informationIdeas beyond Number. Activity worksheets
Ideas beyond Number Activity sheet 1 Task 1 Some students started to solve this equation in different ways: For each statement tick True or False: = = = = Task 2: Counter-examples The exception disproves
More informationConsecutive Numbers. Madhav Kaushish. November 23, Learning Outcomes: 1. Coming up with conjectures. 2. Coming up with proofs
Consecutive Numbers Madhav Kaushish November 23, 2017 Learning Outcomes: 1. Coming up with conjectures 2. Coming up with proofs 3. Generalising theorems The following is a dialogue between a teacher and
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 informationA Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs
Journal of Combinatorial Theory, Series A 90, 293303 (2000) doi:10.1006jcta.1999.3040, available online at http:www.idealibrary.com on A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations
More informationInstructor Notes for Chapter 4
Section 4.1 One to One Functions (Day 1) Instructor Notes for Chapter 4 Understand that an inverse relation undoes the original Understand why the line y = xis a line of symmetry for the graphs of relations
More informationCycle-up-down permutations
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 5 (211, Pages 187 199 Cycle-up-down permutations Emeric Deutsch Polytechnic Institute of New York University Brooklyn, NY 1121 U.S.A. Sergi Elizalde Department
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 informationEvacuation and a Geometric Construction for Fibonacci Tableaux
Evacuation and a Geometric Construction for Fibonacci Tableaux Kendra Killpatrick Pepperdine University 24255 Pacific Coast Highway Malibu, CA 90263-4321 Kendra.Killpatrick@pepperdine.edu August 25, 2004
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 informationMath 3338: Probability (Fall 2006)
Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/7 2.3 Counting Techniques (III) - Partitions Probability p.2/7 Partitioned
More informationMathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170
2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag
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 informationYou ve seen them played in coffee shops, on planes, and
Every Sudoku variation you can think of comes with its own set of interesting open questions There is math to be had here. So get working! Taking Sudoku Seriously Laura Taalman James Madison University
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 informationPartitions and Permutations
Chapter 5 Partitions and Permutations 5.1 Stirling Subset Numbers 5.2 Stirling Cycle Numbers 5.3 Inversions and Ascents 5.4 Derangements 5.5 Exponential Generating Functions 5.6 Posets and Lattices 1 2
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 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 informationPart I: The Swap Puzzle
Part I: The Swap Puzzle Game Play: Randomly arrange the tiles in the boxes then try to put them in proper order using only legal moves. A variety of legal moves are: Legal Moves (variation 1): Swap the
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
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 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 informationFinite homomorphism-homogeneous permutations via edge colourings of chains
Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.
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 information