#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS
|
|
- Branden Colin Rodgers
- 5 years ago
- Views:
Transcription
1 #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 Kitaev Department of Computer and Information Sciences, University of Strathclyde, Glasgow, United Kingdom sergey.kitaev@cis.strath.ac.uk Philip B. Zhang College of Mathematical Science, Tianjin Normal University, Tianjin, P. R. China zhangbiaonk@63.com Received: 5//6, Revised: 8/3/7, Accepted: /6/7, Published: /6/8 Abstract Comtet introduced the notion of indecomposable permutations in 97. A permutation is indecomposable if and only if it has no proper prefi which is itself a permutation. Indecomposable permutations were studied in the literature in various contets. In particular, this notion has been proven to be useful in obtaining non-trivial enumeration and equidistribution results on permutations. In this paper, we give a complete classification of indecomposable permutations avoiding a classical pattern of length 3 or 4, and of indecomposable permutations avoiding a non-consecutive vincular pattern of length 3. Further, we provide a recursive formula for enumerating... k-avoiding indecomposable permutations for k 3. Several of our results involve the descent statistic. We also provide a bijective proof of a fact relevant to our studies.. Introduction Let [n] = {,..., n} and S n be the set of permutations of [n]. Given = n S n, let i denote the smallest inde such that i is a permutation of [i ]. If i = n then is indecomposable; otherwise, is decomposable. For eample, 354 is indecomposable, while 354 is decomposable. Supported by the Fundamental Research Funds for the Central Universities(30070QD0). Supported by the National Science Foundation of China (Nos. 667, 7044).
2 INTEGERS: 8 (08) For a permutation of a set {a,..., a n }, the reduced form of, denoted red( ), is the permutation of [n] obtained from by replacing the i-th smallest element with i. For eample, red(537) = 34. For any permutation, we have = () () (k) for some k, where (i) is a permutation such that red( (i) ) is indecomposable for all apple i apple k. We say that a (i) is a component of. For eample, the permutation 3465 has components 3, 4 and 65. A (permutation) pattern is a permutation = k. We say that a permutation = n contains an occurrence of if there are apple i < < i k apple n such that i ik is order-isomorphic to, that is, if the reduced form of i ik is. If does not contain an occurrence of, we say that avoids. These patterns are referred to as classical patterns. For instance, the permutation 3567 contains several occurrences of the pattern 3, for eample, the subsequences 356 and 57, while this permutation avoids the pattern 3. A comprehensive introduction to the theory of patterns in permutations can be found in [9]. Other patterns of interest to us are vincular patterns, also known as generalized patterns [, 3], where some of the elements may be required to be adjacent in the permutation. We underline elements of a given pattern to indicate the elements that must be adjacent in any occurrence of the pattern. For eample, the permutation = 3654 contains four occurrences of the pattern 3, namely, the subsequences 6, 54, 354 and 54 (in each of these occurrences, the elements in corresponding to and 3 in the pattern stay net to each other). On the other hand, contains only one occurrence of the pattern 3, namely, 54. If all elements in an occurrence of a pattern are required to stay net to each other, which is indicated by underlying all elements in the pattern, such a pattern is called a consecutive pattern [5]. A classical statistic descent is just an occurrence of the pattern. Vincular patterns play an important role in the theory of patterns in permutations and words (see Sections 3.3 and 3.4 in [9] for details). The notion of indecomposable permutations (also known as irreducible permutations or connected permutations) was introduced by Comtet [9, 0]. Comtet was the first one to show the ordinary generating function for the number I n of indecomposable permutations of length n is X I n n = n= Pk 0 k!k. These numbers begin with,, 3, 3, 7, 46, 3447, 9093,... for n, and appear as the sequence A00339 in the On-Line Encyclopedia of Integer Sequences (OEIS) []. Indecomposable permutations appear in various contets in the literature, for eample, see [7, 8,, 3, 8]. In particular, in [7, Section 4], indecomposable permutations are used to define a bijection between 3- and 3-avoiding permutations (finding various bijections essentially between these sets was the subject of
3 INTEGERS: 8 (08) 3 several papers in the literature). Also, indecomposable pattern avoiding permutations are a key object in [8] to find a bijection between permutations in question and (, 0)-trees. Corollaries of this result include a number of equidistribution results on permutations, (, 0)-trees and certain types of planar maps. Finally, we note that indecomposable pattern avoiding permutations were first studied by Bóna in [3], where essentially 43-avoiding indecomposable permutations are enumerated (indecomposable permutations are defined up to reverse in [3]) and linked in a bijective way to (0, )-trees. In this paper, we study interrelations (taking into account the descent statistic, which comes for free ) between pattern avoiding permutations and their indecomposable counterparts for classical patterns of length 3 and 4, vincular nonconsecutive patterns of length 3, and the increasing classical pattern of arbitrary length (patterns of length are trivial). We use our results and known enumeration formulas for pattern avoiding permutations to enumerate indecomposable pattern avoiding permutations. Some of the obtained numbers appear in the OEIS, suggesting a number of bijective questions. The paper is organized as follows. In Section, we introduce generating functions to be studied in this paper and state known pattern avoiding results to be used. In Section 3, we study indecomposable permutations avoiding classical patterns of length 3 and 4, as well as the classical pattern... k for k 3. In Section 4, we study indecomposable permutations avoiding a vincular non-consecutive pattern of length 3, in particular, presenting a bijective result in Theorem 4.4. Finally, in Section 5, we summarize our enumerative results (see Table ) and discuss directions of further research.. Preliminaries Let A n and I n be the number of -avoiding permutations of [n] and -avoiding indecomposable permutations of [n], respectively. For 0 apple i apple n, let A n,i and I n,i be the number of -avoiding permutations of [n] and -avoiding indecomposable permutations of [n] with i descents, respectively. Thus, for n, we have A n = A n,i and I n = I n,i. i=0 Let A (), A (, q), I () and I (, q) be the generating functions for A n, A n,i, I n and I n,i, respectively. That is, n=0 i=0 i=0 X X A (, q) = A n,i n q i, I (, q) = I n,i n q i, n= i=0
4 INTEGERS: 8 (08) 4 X X A () = A (, ) = A n n and I () = I (, ) = I n n. n=0 If for patterns and, An = An for all n 0 then and are Wilf-equivalent. For a permutation = n, its reverse is the permutation r( ) = n n and its complement is the permutation c( ) = (n+ )(n+ ) (n+ n ). For eample, if = 345 then r( ) = 543 and c( ) = 345. The reverse and complement operations are called trivial bijections. It is easy to see that for any pattern, this pattern is Wilf-equivalent to r( ) and c( ). Another useful property of trivial bijections is that their composition preserves the property of being decomposable (and thus the property of being indecomposable), which is easy to see. One of concerns in this paper is to find interrelations between I (, q) and A (, q) for certain s. We note that throughout this paper we implicitly use the fact that an occurrence of a descent cannot start in one component of a permutation and end in another one. In the rest of this section we review a number of permutation pattern avoidance results relevant to this paper. Lemma. ([0]). For S 3 and n 0, A n = C n = n+ number. Thus, A () = C() = p 4, n n n=, the n-th Catalan the generating function for the Catalan numbers satisfying C() C() + = 0. For n 0, the Catalan numbers begin with,,, 5, 4, 4,..., which is the sequence A00008 in the OEIS []. The net result links the well-known Bell numbers to pattern avoiding permutations. The Bell numbers begin with,,, 5, 5, 5, 03,... for n 0, and this is the sequence A0000 in the OEIS []. Lemma. ([6]). When {3, 3, 3, 3}, for n 0, we have A n = B n, where B n is the n-th Bell number, which is the number of set partitions of [n]. When {3, 3}, for n 0, we have A n = C n. We net turn our attention to classical patterns of length 4. Table presents three Wilf-equivalence classes in this case. A 34 n for n 0 begins with,,, 6, 3, 03,... (this is sequence [, A00580]), and we have the following lemma.
5 INTEGERS: 8 (08) 5 34,43, 43,34,34,43, 43,34,34,43, 43,34 34,43,34,43, 43,34,34,43, 43, ,43 Table : The three Wilf-equivalence classes for pattern avoidance of length 4. Spaces on a line are used to group patterns equivalent via trivial bijections. Lemma.3 ([6]). For {34, 43, 43, 34, 34, 43, 43, 34, 34, 43, 43, 34}, we have E() := A () = + 5 ( 9) ( ) 4 F 4, 3 4 ; ; 64. ( )( 9) 3 Moreover, for n, we have E n := A n = k=0 k k n k 3k + k kn n + (k + ) (k + )(n k + ). An eact enumeration for 34-avoiding permutations and the corresponding generating function are given by Bóna [3]. The corresponding sequence for n 0 begins with,,, 6, 3, 03, 5,... (A0558 in []) and the following lemma holds. Lemma.4 ([3]). For {34, 43, 34, 43, 43, 34, 34, 43, 43, 34}, we have F () := A () = Moreover, for n ( 8)3/ = ( 8) 3/ ( + ) 3 + ( + ) 3., we have F n := A n = 7n 3n ( ) n + 3 ( ) n i i+ (i 4)! n i +. i!(i )! However, no formula for A 34 n is known, only a recurrence relation is discovered [], and an algorithm for counting the number of 34-avoiding permutations was given in [, 7]. For recent developments on the bounds, see [, 4]. The corresponding sequence for n 0 begins with,,, 6, 3, 03, 53, 76,...; see A0655 in []. i= 3. Indecomposable Permutations Avoiding Classical Patterns Patterns are permutations, and we distinguish two cases according to whether or not they are decomposable. We start with an easier case.
6 INTEGERS: 8 (08) Indecomposable Patterns Here we deal with the following patterns: 3, 3, 3, 34, 43, 43, 34, 34, 34, 34, 43, 43, 43, 43, 43, 43. We first establish a property holding for any indecomposable pattern. Lemma 3.. If is an indecomposable pattern, then I (, q) satisfies I (, q) = A (, q). Proof. For any permutation, an occurrence of cannot start in one component and end in another one, which would contradict being irreducible. Similarly, a descent cannot start in one component and end in another one. Hence, the generating function for -avoiding permutations with k components is [I (, q)] k and X A (, q) = + (I (, q)) k = I (, q), k= where + corresponds to the empty permutation. This gives the desired result. Combining Lemma 3. (q = ) and Lemma. we obtain the following theorem, which can also be derived, e.g. from considerations in [7]. Theorem 3.. For {3, 3, 3}, we have I () = p 4. () Thus, for n, I n = C n, the (n )-th Catalan number. Combining Lemma 3. (q = ) and Lemma.4 we obtain the following theorem established in [3]. Theorem 3.3. For {43, 43, 34, 43, 43, 34}, we have I () = ( 8) 3/. 3 The initial values for I n in this case are,, 3,, 56, 88, 584, 95,... for n, and this is the sequence A00057 in the OEIS []. Similarly, one can combine Lemma 3. (q = ) and Lemma.3 to obtain a formula for I (), where {43, 34, 43, 34, 43, 34}. The initial values for I n in this case are,, 3,, 56, 89, 603, 939,... for n, and this sequence is not in the OEIS [].
7 INTEGERS: 8 (08) 7 However, we cannot obtain a formula for I 43 () using Lemma 3. because no formula is known for A 43 (). The initial values for In 43 are,, 3,, 56, 89, 604, 945,... for n, and this sequence is not in the OEIS []. 3.. Decomposable Patterns The patterns here we deal with are 3, 3, 3 and 34, 43, 34, 34, 43, 43, 34, 43, 34, 34, Decomposable Patterns of Length 3 Pattern 3. We first give a description of 3-avoiding decomposable permutations. Lemma 3.4. Let = () 0 S n, where () is the component in formed by the elements in {,..., i }. Then is a 3-avoiding decomposable permutation if and only if () = i (i ), 0 = n(n ) (i + ) and apple i apple n. Proof. The backward direction is straightforward to see since no occurrence of the pattern 3 can start in (). For the forward direction, since = n is decomposable, one must have apple i apple n. If i < j for some apple i < j apple i then i j n is an occurrence of the pattern 3; contradiction. If i < j for some i + apple i < j apple n then i j is an occurrence of the pattern 3; contradiction. Thus, we obtain the desired result. Net we derive a relation between I 3 (, q) and A 3 (, q), which will give formulas for I 3 () and In 3. The initial values for In 3 for n begin with,, 3,, 38, 7, 43,.... This sequence does not appear in the OEIS []. Theorem 3.5. We have that A 3 (, q) = I 3 (, q) + +, () ( q) and for n, I 3 () = p 4 ( ), (3) I 3 n = C n (n ). (4)
8 INTEGERS: 8 (08) 8 Proof. By Lemma 3.4, the generating function for all 3-avoiding decomposable permutations is P i i q i P j j q j = ( q). Since any 3-avoiding permutation is either indecomposable, or decomposable, or the empty permutation, we obtain the relation given by (). Letting q = in () and using Lemma., we obtain (3). Finally, by Lemma. and the fact that ( ) = P n (n )n, we obtain (4). This completes the proof. We note that (4) appears in Proposition 9 in [4]. Patterns 3 and 3. We begin with a description of 3-avoiding decomposable permutations. Lemma 3.6. Let = () 0 S n, where () is the component in formed by the elements in {,..., i }. Then is a 3-avoiding decomposable permutation if and only if () is a 3-avoiding decomposable permutation, apple i apple n, and 0 = (i + )(i + ) n. Proof. The backward direction is easy to see since an occurrence of the pattern 3 cannot start in () in this case. For the forward direction, since is decomposable, we have apple i apple n. Moreover, since is 3-avoiding, () must be 3-avoiding. Finally, if i > j for i + apple i < j apple n then i j is an occurrence of the pattern 3, which is a contradiction. This completes the proof. Net we find a relation between A (, q) and I (, q) for {3, 3}, which will give us formulas for I () and I n. The initial values for In 3 = In 3 for n begin with,, 3, 9, 8, 90, 97, 00,..., which is the sequence A00045 in []. Theorem 3.7. For I =, and for n, {3, 3}, we have that A (, q) = + I (, q), (5) p 4 I () = ( ), (6) I n = C n C n. (7) Proof. Let = 3. By Lemma 3.6, the generating function for all 3-avoiding decomposable permutations is I 3 (, q) P j j = I3 (, q). Similarly to the proof of Theorem 3.5, we have A 3 (, q) = + I 3 () + I3 (, q) = + I3 (, q)
9 INTEGERS: 8 (08) 9 giving (5) for = 3. Letting q = in (5) and using Lemma., we obtain I 3 () = ( )(A 3 () ) p 4 = ( ) giving (6) for = 3. From (6), I 3 = and, for n (7) follows for = 3. Finally, since the composition of reverse and complement preserves the property of being irreducible, and this composition applied to 3 gives 3, we have that (5), (6) and (7) hold for = 3. This completes the proof. Note that (7) follows directly from Lemma 3.6. Indeed, in a decomposable 3- avoiding permutation, the largest element n must be the rightmost element, and the number of such permutations is C n, while the number of all 3-avoiding permutations of length n is C n. Also, note that (7) appears in Proposition 9 in [4] Decomposable Patterns of Length 4 Recall that when applying the composition of reverse and complement, the property of being decomposable is retained. Applying that composition to 43, 34 and 34 yields the original pattern. For the remaining eight decomposable patterns this operation gives I 34 (, q) = I 43 (, q), I 34 (, q) = I 34 (, q), I 34 (, q) = I 43 (, q), and I 34 (, q) = I 43 (, q). Thus, we only need to consider seven decomposable patterns of length 4. Patterns 34 and 34. We start with a description of 34-avoiding and 34- avoiding decomposable permutations. Lemma 3.8. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 34-avoiding (resp., 34-avoiding) decomposable permutation if and only if () is 3-avoiding (resp., 3-avoiding) and 0 is 34-avoiding (resp., 34-avoiding). Proof. For the backward direction, because () is 3-avoiding (resp., 3-avoiding), at most two elements in a possible occurrence of the pattern 34 (resp., 34) can be in (). But then 0 contains an element smaller than an element in (), which is impossible, and thus is 34-avoiding (resp., 34-avoiding). For the forward direction, since = n is decomposable, we have apple i apple n. Also, clearly 0 is 34-avoiding (resp., 34-avoiding). Now, if () would contain an occurrence of the pattern 3 (resp., 3) then together with n it would form an occurrence of the pattern 34 (resp., 34); contradiction. Thus () is 3-avoiding (resp., 3-avoiding). This completes the proof.
10 INTEGERS: 8 (08) 0 The sequence for I 34 n and I 34 n for n begin with,, 3, 3, 65, 350, 979, 6,..., which does not appear in the OEIS []. Theorem 3.9. We have and A 34 (, q) = + I 34 (, q) + I 3 (, q) A 34 (, q) (8) A 34 (, q) = + I 34 (, q) + I 3 (, q) A 34 (, q). (9) Further, for {34, 34}, we have that I () = p 3 4 +, ( 8) 3/ with I =, and for n, where F n is defined in Lemma.4. I n = F n C i F n i, i=0 Proof. By Lemma 3.8, the generating function for 34-avoiding decomposable permutations is I 3 (, q)(a 34 (, q) ), where corresponds to ecluding the empty permutation as a possibility for 0. Similarly, the generating function for 34-avoiding decomposable permutations is I 3 (, q)(a 34 (, q) ). Note that each -avoiding permutation is either the empty permutation, or an indecomposable permutation or a decomposable one. This observation shows (8) and (9). Let q = in (8). Combing this with Lemma.4 and (), we obtain I 34 () = I 3 () A 34 () (0) = ( C()) (F () ) () = p () ( 8) 3/ Hence, by (), we have that I 34 = and for n, I 34 n = F n + C n C i F n i i=0 = F n C i F n i. i=0 It is straightforward to provide essentially the same derivations for the case of 34- avoiding indecomposable permutations, which completes the proof.
11 INTEGERS: 8 (08) Pattern 34. We begin with a description of 34-avoiding decomposable permutations. Our proof of the net lemma is similar to the proof of Lemma 3.8 and thus is omitted. Lemma 3.0. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 34-avoiding decomposable permutation if and only if () is 3- avoiding and 0 is a 34-avoiding. The initial values I 34 n for n begin,, 3, 3, 65, 35, 999, 87,... and this sequence is not in the OEIS []. Theorem 3.. We have A 34 (, q) = + I 34 (, q) + I 3 (, q) A 34 (, q). (3) Moreover, for E() and E n defined in Lemma.3, we have I 34 () = p 4 + (E() ), I 34 = and for n I 34 n = E n C i E n i. i=0 Proof. We can proceed similarly to the proof of Theorem 3.9 to prove (3). Further, assuming that q = in (3), one can apply Lemma.3 and (), to obtain I 34 () = I 3 () A 34 () = ( C()) (E() ) = p 4 + (E() ). From the last derivation, the formula for I 34 n holds. Pattern 43. We begin with a description of 43-avoiding decomposable permutations. Lemma 3.. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 43-avoiding decomposable permutation if and only if one of the following two conditions holds:
12 INTEGERS: 8 (08) () = and 0 is 43-avoiding. apple i apple n, () is 43-avoiding and 0 = (i + )(i + ) n. Proof. For the forward direction, since is decomposable, we have apple i apple n. There are two cases to consider: i =. It is clear that () = in this case does not a ect 0, so 0 must be a 43-avoiding permutation of {,..., n}. apple i apple n. Since () is indecomposable of length at least, there eist apple j < j apple i such that j > j. But then to avoid an occurrence of the pattern 43 involving j and j, 0 must be the increasing permutation (i + )(i + ) n. The backward direction is easy to see using similar considerations as above. The initial values I 43 n for n are,, 3, 3, 63, 330, 838, 0758,..., and this sequence is not in the OEIS []. Theorem 3.3. We have A 43 (, q) = + I 43 (, q) + A 43 (, q) + I43 (, q). (4) Moreover, for E() and E n defined in Lemma.3, we have I 43 n = and for n, I 43 () = ( ) E() +, I 43 n = E n E n + E n. Proof. By Lemma 3., (4) follows. Lemma.3, it follows that Further, letting q = in (4) and using from which the formula for I 43 n I 43 () = ( ) A 43 () + = ( ) E() +, follows. Pattern 34. We first give a description of 34-avoiding decomposable permutations. Lemma 3.4. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 34-avoiding decomposable permutation if and only if one of the following two conditions holds:
13 INTEGERS: 8 (08) 3 () = and 0 is 34-avoiding. apple i apple n, () is 3-avoiding, and 0 = n(n ) (i + ). Proof. For the forward direction, since = n apple i apple n. There are two cases to consider: is decomposable, we have i =. It is clear that () does not a ect the rest of the permutation, and 0 must be a 34-avoiding permutation of {,..., n}. apple i apple n. Then () must be a 3-avoiding permutation, or else it would form an occurrence of the pattern 34 with n. Moreover, since () is indecomposable, there eist apple j < j apple i such that j > j. But then to avoid an occurrence of the pattern 34 involving j and j, 0 must be the decreasing permutation n(n ) (i + ). The backward direction is not di cult to see using the considerations above. Initial values for I 34 n are,, 3, 3, 67, 369, 7, 578,... for n, and this sequence is not in the OEIS []. Theorem 3.5. We have A 34 (, q) = + I 34 (, q) + A 34 (, q) + q I3 (, q). (5) Moreover, for E() and E n defined in Lemma.3, we have I 34 = and for n, I 34 () = ( )E() C() + +, I 34 n = E n E n C n +. Proof. The identity (5) follows from Lemma 3.4. Further, setting q = in (5), and applying Theorem 3.7 and Lemma.3, one has I 34 () = ( )A 34 () ( ) I3 () + = ( )A 34 () ( ) (C() ) + = ( )E() C() + + From this, we have the desired formula for I 34 n..
14 INTEGERS: 8 (08) 4 Pattern 34. We first give a description of 34-avoiding decomposable permutations. Lemma 3.6. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 34-avoiding decomposable permutation if and only if () is 3- avoiding and 0 is 3-avoiding. Proof. For the forward direction, since = n is decomposable, we have apple i apple n. Moreover, () is 3-avoiding, or else, along with n an occurrence of the pattern 34 would be formed. Also, 0 is 3-avoiding or else, along with an occurrence of the pattern 34 would be formed. The backward direction is not di cult to see. Initial values for In 34 not in the OEIS []. Theorem 3.7. We have Also, are,, 3, 3, 69, 396, 355, 4363,..., and this sequence is A 34 (, q) = + I 34 (, q) + I 3 (, q) A 3 (, q). (6) Moreover, I 34 = and for n, I 34 () = A 34 () ( ) (C() ). I 34 n = A 34 n C n+ + 3C n C n. Proof. The identity (6) follows from Lemma 3.6. Further, setting q = in (6) and applying Lemma. and Theorem 3.7, we obtain I 34 () = A 34 () I 3 () A 3 () = A 34 () ( ) (C() ) apple C() = A 34 () ( ) C() +. Hence, I 34 = and for n, This completes the proof. I 34 n = A 34 n (C n+ C n ) + (C n C n ) = A 34 n C n+ + 3C n C n.
15 INTEGERS: 8 (08) 5 Pattern 34. follows. Decomposable 34-avoiding permutations can be described as Lemma 3.8. Let = () 0 S n, where () is a permutation of {,..., i }. Then is a 34-avoiding decomposable permutation if and only if one of the following two conditions holds: () = i (i ), 0 is 3-avoiding and apple i apple n, or () 6= i (i ) is 3-avoiding, 0 = n(n ) (i + ), and 3 apple i apple n. Proof. Since is 34-avoiding, then () must be 3-avoiding, or else there would be an occurrence of the pattern 34 involving an element in 0. Thus, the longest increasing sequence in () is at most of length. There are two cases to consider. () = i (i ). Then, clearly, 0 must be 3-avoiding. The longest increasing subsequence in () is eactly of length. But then, since () is indecomposable, we have i > and 0 must be -avoiding, that is, 0 = n(n ) (i + ). This completes the proof. Initial values for I 34 n are,, 3, 3, 69, 400, 390, 4545,... for n, and this sequence is not in the OEIS []. Theorem 3.9. We have A 34 (, q) = + I 34 (, q) + q A3 (, q) + q I 3 (, q). (7) q Also, for E() defined in Lemma.3, I 34 () = E() C() + 3 ( ) 3 + ( ) +. Moreover, I 34 = and for n and for E n defined in Lemma.3, n = E n C i + n n 4. I 34 i=0
16 INTEGERS: 8 (08) 6 Proof. The identity (7) follows from Lemma 3.8. Further, setting q = in (7), and applying Lemmas. and.3 and Theorem 3.5, we have I 34 () = A 34 () A3 () I 3 () = E() = E() C() ( ) C() + 3 ( ) 3 + ( ) + Hence, it follows that I 34 = and for n n = E n C i + n n + 4 I 34 This completes the proof. i=0 = E n C i Pattern... k with k 3 i= n(n ). Here we consider patterns of the form... k, where k 3, which generalizes our considerations for patterns 3 and 34. First, we give a description of... k- avoiding decomposable permutations in the following lemma, whose proof is trivial and thus is omitted. Lemma 3.0. If = () 0 is a... k-avoiding decomposable permutation of length n, where () is a permutation of {,..., i }. Then there eists m, apple m apple k, such that the longest increasing subsequence in () is eactly of length m and 0 is... (k m)-avoiding. Now we can enumerate... k-avoiding indecomposable permutations. Corollary 3.. We have I...k (, q) =A...k (, q) kx m= Proof. By Lemma 3.0, we have A...k (, q) = + I...k (, q) + kx m= from which the result follows. I...(m+) (, q) I...m (, q) A...(k m) (, q) I...(m+) (, q) I...m (, q) A...(k m) (, q),..
17 INTEGERS: 8 (08) 7 For eample, when k = 3, we have and hence A 3 () = + I 3 () + I () I () A () = + I 3 () +, I 3 () = A 3 () ( ) = p 4 ( ), which coincides with Theorem 3.5. Note that we used the facts that I () () = 0 and A () = I () () = + + =. When k = 4, we have A 34 () = +I 34 ()+ I () I () A 3 () + I 3 () I () A (), and hence I 34 () = E() C() ( ), which coincides with Theorem 3.9. Note that we used the fact that A 3 () = C(). 4. Indecomposable Permutations Avoiding Vincular Non-consecutive Patterns of Length 3 For a pattern of the form abc, its reverse complement gives a pattern of the form yz. Thus, since the composition of reverse and complement preserves the property of being indecomposable, we only need to consider si cases of vincular patterns of length 3, which are 3, 3, 3, 3, 3, and 3. Two of these cases can be reduced to classical pattern-avoidance. Indeed, it was shown in [6] that a permutation avoids the pattern 3 if and only if it avoids the pattern 3. Applying the complement operation, this implies that a permutation avoids 3 if and only if it avoids 3. Thus, In 3 = In 3 and In 3 = In 3 and Theorems 3.7 and 3. can be applied, respectively. Pattern 3. We first give a description of 3-avoiding decomposable permutations. Lemma 4.. Let = () 0 S n, where () is a permutation of {,..., i }. Then = n is a 3-avoiding decomposable permutation if and only if () = i and 0 = n(n ) (i + ) for apple i apple n, where i is a 3-avoiding permutation of {, 3,..., i }.
18 INTEGERS: 8 (08) 8 Proof. Since is decomposable, we have apple i apple n. It is clear that () is a 3- avoiding indecomposable permutation. We claim that i =, since otherwise, i and i + will form the pattern 3. Further, clearly i + > i + > > n, or else there would be an occurrence of the pattern 3 involving. On the other hand, it is easy to see that if () and 0 satisfy the conditions then is 3-avoiding. This completes the proof. Initial values for I 3 n for n are,, 3,, 43, 79, 80,... and this sequence is not in the OEIS []. Theorem 4.. We have Also, A 3 (, q) = + I 3 (, q) + A 3 (, q) q +. (8) q I 3 () = B(), where B() is the generating function for the Bell numbers. Moreover, I 3 = and for n, I 3 n = B n B i. Proof. By Lemma 4., the generating function for 3-avoiding decomposable permutations is q A 3 (, q) q +, hence (8) follows. Letting q = in (8), we have I 3 () = A 3 (). Combining with Lemma., we obtain that i=0 I 3 () = B(). Together with the fact that = P i 0 i, we have I 3 = and for n, This completes the proof. I 3 n = B n B i. i=0 Pattern 3. We first give a description of 3-avoiding decomposable permutations.
19 INTEGERS: 8 (08) 9 Lemma 4.3. Let = () 0 S n, where () is a permutation of {,..., i }. Then = n is a 3-avoiding decomposable permutation if and only if () is 3-avoiding and 0 = i (i + ) n for apple i apple n. Proof. If is 3-avoiding, then clearly () and 0 are both 3-avoiding. Moreover, we must have i + < i + < < n, or else there would be an occurrence of the pattern 3 involving. On the other hand, it is clear that if () and 0 satisfy the given conditions then is 3-avoiding, which completes the proof. Initial values for I 3 n for n are,, 3, 0, 37, 5, 674,..., which are essentially the sequences A and A38378 in the OEIS [] that have several combinatorial interpretations. In particular, this sequence counts 3-avoiding permutations that end with a rise, that is, with an occurrence of the pattern, which leads us to the following theorem. Theorem 4.4. For n, the number of 3-avoiding indecomposable permutations in S n is equal to that of 3-avoiding permutations in S n that end with a rise. Proof. Let I and R be the first and the second sets, respectively, in the statement of the theorem. We provide a recursive bijection f from I to R proving the theorem with the base case f() =. The set of 3-avoiding permutations can be subdivided into three disjoint subsets: S, all 3-avoiding permutations ending with ; S, all 3-avoiding permutations ending with n; S 3, all other 3-avoiding permutations. It is straightforward to see that the elements to the right of in a 3-avoiding permutation must be in increasing order. But then in S 3, n must be to the left of. Thus, a permutation in S 3 belongs to both I and R and we map it to itself. Further, it is easy to see that S is a subset of I but it is disjoint from R, while S is a subset of R but it is disjoint from I. For a permutation = n S we define its image recursively as f( ) = f(( ) ( n ))n. The map f described by us is easy to see to be a bijection. This completes the proof. Net we enumerate 3-avoiding indecomposable permutations. Theorem 4.5. We have A 3 (, q) = + I 3 (, q) + I3 (, q). (9) Also, I 3 () = ( )B(), where B() is the generating function for the Bell numbers. Moreover, In 3 = and for n In 3 = B n B n.
20 INTEGERS: 8 (08) 0 Proof. By Lemma 4.3, the generating function for 3-avoiding decomposable permutations is I3 (, q) from which (9) follows. Letting q = in (9) and combining with Lemma., we obtain that Hence, it follows that for n I 3 () = ( )A 3 () = ( )B().. This completes the proof. I 3 n = B n B n Patterns 3 and 3. We first give a description of 3-avoiding and 3-avoiding decomposable permutations. Lemma 4.6. Let = () 0 S n, where () is a permutation of {,..., i }. Then is 3- (resp., 3-)avoiding if and only if () and 0 are both 3- (resp., 3-)avoiding. Initial values for I 3 n = I 3 n for n are,,, 6,, 9, 46,..., and this is the sequence A in the OEIS [] that has several combinatorial interpretations. In particular, this sequence counts the number of irreducible set partitions of [n], which can be easily seen from the bijections in [6]. For more information on irreducible set partitions, see [5]. Theorem 4.7. We have I 3 () = I 3 () = B(). Proof. Since 3 is an irreducible pattern, Lemma 3. can be applied to obtain A 3 () = I 3 (). The desired result now follows from Lemma.. 5. Concluding Remarks The notion of indecomposable permutations proved to be useful in various contets, e.g. in obtaining non-trivial enumeration and equidistribution results on permutations [8]. In this paper, we gave a compete classification of indecomposable permutations avoiding a classical pattern of length 3 or 4, and of indecomposable permutations avoiding a non-consecutive vincular pattern of length 3; see Table for a summary of these results. Also, we provided a recursive formula for enumerating... k- avoiding indecomposable permutations for k 3 (see Corollary 3.). The descent statistic is taken into account in several of our results.
21 INTEGERS: 8 (08) I () p 4 OEIS 3, 3, 3 A00008 p 3, 3 ( ) 4 A , 43, 34, 43, 43, 34 34, 34 p 34 p 4 ( ) ++8 +( 8) 3/ ( 8) 3/ A00057 p 4 + (E() ) 43 ( ) E() + 34 ( )E() C() A 34 () ( ) (C() ) 3 34 E() C() + ( ) + 3 ( ) + 3 B() 3 ( )B() 3, 3 B() A A38378 A Table : A summary of the avoidance results in this paper. The definitions of the functions E(), C(), B() and A 34 () can be found in Section and Theorem 4.. A natural direction of further research is in etending our studies of indecomposable permutations to other patterns, e.g. vincular patterns of length 4. Also, one can look at avoiding more than one pattern at the same time. Other statistics can be included in enumerative results. Finally, one can establish a number of bijective results linking pattern avoiding indecomposable permutations to other structures (Theorem 4.4 is one such eample). For instance, the sequence A in the OEIS [] has many interesting combinatorial interpretations that one could try to link in a bijective way to 3- avoiding indecomposable permutations. Acknowledgments. The second author is grateful to the administration of the Center for Combinatorics at Nankai University for their hospitality during the author s stay in November December 05. Also, the authors are grateful to Filippo
22 INTEGERS: 8 (08) Disanto for brining to our attention the paper [4], and to the anonymous referee for many useful suggestions on how to improve our paper. References [] E. Babson and E. Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, Sém. Lothar. Combin. 44.B44b(000), [] D. Bevan, Permutations avoiding 34 and patterns in lukasiewicz paths, J. Lond. Math. Soc. () 9(05), 05. [3] M. Bóna, Eact enumeration of 34-avoiding permutations: a close link with labelfed trees and planar maps, J. Combin. Theory Ser. A 80(997), [4] M. Bóna, A new record for 34-avoiding permutations, Eur. J. Math. (05), [5] W. Y. C. Chen, T. X. S. Li, and D. G. L. Wang, A bijection between atomic partitions and unsplitable partitions, Electron. J. Combin. 8(0),.7. [6] A. Claesson, Generalized pattern avoidance, European J. Combin. (00), [7] A. Claesson and S. Kitaev, Classification of bijections between 3- and 3-avoiding permutations, Séminaire Lotharingien de Combinatoire B60d(008), 30. [8] A. Claesson, S. Kitaev, and E. Steingrímsson, Decompositions and statistics for beta(,0)- trees and nonseparable permutations, Adv. Appl. Math. 4(009), [9] L. Comtet, Sur les coe cients de l inverse de la série formelle P n!t n, C. R. Acad. Sci. Paris Sér. A-B 75(97), A569 A57. [0] L. Comtet, Advanced combinatorics, D. Reidel Publishing Co., Dordrecht, enlarged edition, 974. [] A. R. Conway and A. J. Guttmann, On 34-avoiding permutations, Adv. Appl. Math. 64(05), [] R. Cori, Hypermaps and indecomposable permutations, European J. Combin. 30(009), [3] R. Cori, Indecomposable permutations, hypermaps and labeled Dyck paths, J. Combin. Theory Ser. A 6(009), [4] F. Disanto, Some statistics on the hypercubes of Catalan permutations, J. Integer Sequences 8(05), 5... [5] S. Elizalde and M. Noy, Consecutive patterns in permutations, Adv. Appl. Math. 30(003), 0 5. [6] I. M. Gessel, Symmetric functions and P-recursiveness, J. Combin. Theory Ser. A 53(990), [7] F. Johansson and B. Nakamura, Using functional equations to enumerate 34-avoiding permutations, Adv. Appl. Math. 56(04), [8] A. King, Generating indecomposable permutations, Discrete Math. 306(006),
23 INTEGERS: 8 (08) 3 [9] S. Kitaev, Patterns in permutations and words, Monographs in Theoretical Computer Science, An EATCS Series, Springer, Heidelberg, 0. With a foreword by Je rey B. Remmel. [0] P. A. MacMahon, Combinatory analysis, Vol. I, II (bound in one volume), Dover Phoeni Editions, Dover, Mineola, 004. Reprint of An introduction to combinatory analysis (90) and Combinatory analysis. Vol. I, II (95, 96). [] D. Marinov and R. Radoičić, Counting 34-avoiding permutations, Electron. J. Combin. 9(00/03),.3. Permutation patterns (Otago, 003). [] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, published electronically at [3] E. Steingrímsson, Generalized permutation patterns a short survey, In Permutation patterns, volume 376 of London Math. Soc. Lecture Note Ser., pages 37 5, Cambridge Univ. Press, Cambridge, 00.
Permutation 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 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 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 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 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 informationHarmonic numbers, Catalan s triangle and mesh patterns
Harmonic numbers, Catalan s triangle and mesh patterns arxiv:1209.6423v1 [math.co] 28 Sep 2012 Sergey Kitaev Department of Computer and Information Sciences University of Strathclyde Glasgow G1 1XH, United
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 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 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 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 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 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 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 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 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 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 informationGenerating indecomposable permutations
Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received
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 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 informationON SOME PROPERTIES OF PERMUTATION TABLEAUX
ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions
More informationON SOME PROPERTIES OF PERMUTATION TABLEAUX
ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the open
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 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 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 informationOn shortening u-cycles and u-words for permutations
On shortening u-cycles and u-words for permutations Sergey Kitaev, Vladimir N. Potapov, and Vincent Vajnovszki October 22, 2018 Abstract This paper initiates the study of shortening universal cycles (ucycles)
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 informationBIJECTIONS FOR PERMUTATION TABLEAUX
BIJECTIONS FOR PERMUTATION TABLEAUX SYLVIE CORTEEL AND PHILIPPE NADEAU Authors affiliations: LRI, CNRS et Université Paris-Sud, 945 Orsay, France Corresponding author: Sylvie Corteel Sylvie. Corteel@lri.fr
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 information1 Introduction and preliminaries
Generalized permutation patterns and a classification of the Mahonian statistics Eric Babson and Einar Steingrímsson Abstract We introduce generalized permutation patterns, where we allow the requirement
More informationEQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS
EQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS Michael Albert, Cheyne Homberger, and Jay Pantone Abstract When two patterns occur equally often in a set of permutations, we say that these patterns
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 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 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 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 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 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 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 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 informationCompletion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees Mark Lipson Harvard University Department of Mathematics Cambridge, MA 02138 mark.lipson@gmail.com Submitted: Jan 31, 2006; Accepted:
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 informationOn the isomorphism problem of Coxeter groups and related topics
On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives
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 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 informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationUNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun
UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic
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 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 informationEnumeration of Pin-Permutations
Enumeration of Pin-Permutations Frédérique Bassino, athilde Bouvel, Dominique Rossin To cite this version: Frédérique Bassino, athilde Bouvel, Dominique Rossin. Enumeration of Pin-Permutations. 2008.
More informationBijections for Permutation Tableaux
FPSAC 2008, Valparaiso-Viña del Mar, Chile DMTCS proc. AJ, 2008, 13 24 Bijections for Permutation Tableaux Sylvie Corteel 1 and Philippe Nadeau 2 1 LRI,Université Paris-Sud, 91405 Orsay, France 2 Fakultät
More informationUniversal graphs and universal permutations
Universal graphs and universal permutations arxiv:1307.6192v1 [math.co] 23 Jul 2013 Aistis Atminas Sergey Kitaev Vadim V. Lozin Alexandr Valyuzhenich Abstract Let X be a family of graphs and X n the set
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 informationPATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE
PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE SAM HOPKINS AND MORGAN WEILER Abstract. We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance
More informationSquare Involutions. Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini Siena, Italy
3 47 6 3 Journal of Integer Sequences, Vol. 4 (0), Article.3.5 Square Involutions Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini 44 5300 Siena,
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 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 informationOn k-crossings and k-nestings of permutations
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 461 468 On k-crossings and k-nestings of permutations Sophie Burrill 1 and Marni Mishna 1 and Jacob Post 2 1 Department of Mathematics, Simon Fraser
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 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 informationGray code for permutations with a fixed number of cycles
Discrete Mathematics ( ) www.elsevier.com/locate/disc Gray code for permutations with a fixed number of cycles Jean-Luc Baril LE2I UMR-CNRS 5158, Université de Bourgogne, B.P. 47 870, 21078 DIJON-Cedex,
More informationThe Möbius function of separable permutations (extended abstract)
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 641 652 The Möbius function of separable permutations (extended abstract) Vít Jelínek 1 and Eva Jelínková 2 and Einar Steingrímsson 1 1 The Mathematics
More informationOn the number of indecomposable permutations with a given number of cycles
On the number of indecomposable permutations with a given number of cycles Robert Cori LaBRI, Université Bordeaux 1, F33405 Talence Cedex, France robert.cori@labri.fr Claire Mathieu Department of Computer
More informationFrom Fibonacci to Catalan permutations
PUMA Vol 7 (2006), No 2, pp 7 From Fibonacci to Catalan permutations E Barcucci Dipartimento di Sistemi e Informatica, Università di Firenze, Viale G B Morgagni 65, 5034 Firenze - Italy e-mail: barcucci@dsiunifiit
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 informationEquivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns
Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns Vahid Fazel-Rezai Phillips Exeter Academy Exeter, New Hampshire, U.S.A. vahid fazel@yahoo.com Submitted: Sep
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 informationLossy Compression of Permutations
204 IEEE International Symposium on Information Theory Lossy Compression of Permutations Da Wang EECS Dept., MIT Cambridge, MA, USA Email: dawang@mit.edu Arya Mazumdar ECE Dept., Univ. of Minnesota Twin
More informationFermat s little theorem. RSA.
.. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:
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 informationStaircases, dominoes, and the growth rate of Av(1324)
Staircases, dominoes, and the growth rate of Av(1324) Robert Brignall Joint work with David Bevan, Andrew Elvey Price and Jay Pantone TU Wien, 28th August 2017 Permutation containment 101 1 3 5 2 4 4 1
More informationarxiv: v1 [math.co] 11 Jul 2016
OCCURRENCE GRAPHS OF PATTERNS IN PERMUTATIONS arxiv:160703018v1 [mathco] 11 Jul 2016 BJARNI JENS KRISTINSSON AND HENNING ULFARSSON Abstract We define the occurrence graph G p (π) of a pattern p in a permutation
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 informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
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 informationPostprint.
http://www.diva-portal.org Postprint This is the accepted version of a paper presented at 2th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC', Valparaiso, Chile, 23-2
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 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 informationOn Hultman Numbers. 1 Introduction
47 6 Journal of Integer Sequences, Vol 0 (007, Article 076 On Hultman Numbers Jean-Paul Doignon and Anthony Labarre Université Libre de Bruxelles Département de Mathématique, cp 6 Bd du Triomphe B-050
More informationTHE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS
THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master
More informationSOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique
More informationGray code and loopless algorithm for the reflection group D n
PU.M.A. Vol. 17 (2006), No. 1 2, pp. 135 146 Gray code and loopless algorithm for the reflection group D n James Korsh Department of Computer Science Temple University and Seymour Lipschutz Department
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 informationA stack and a pop stack in series
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8(1) (2014), Pages 17 171 A stack and a pop stack in series Rebecca Smith Department of Mathematics SUNY Brockport, New York U.S.A. Vincent Vatter Department
More informationON THE EQUATION a x x (mod b) Jam Germain
ON THE EQUATION a (mod b) Jam Germain Abstract. Recently Jimenez and Yebra [3] constructed, for any given a and b, solutions to the title equation. Moreover they showed how these can be lifted to higher
More informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More 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 informationQuotients 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 informationAsymptotic and exact enumeration of permutation classes
Asymptotic and exact enumeration of permutation classes Michael Albert Department of Computer Science, University of Otago Nov-Dec 2011 Example 21 Question How many permutations of length n contain no
More informationarxiv: v1 [math.co] 30 Nov 2017
A NOTE ON 3-FREE PERMUTATIONS arxiv:1712.00105v1 [math.co] 30 Nov 2017 Bill Correll, Jr. MDA Information Systems LLC, Ann Arbor, MI, USA william.correll@mdaus.com Randy W. Ho Garmin International, Chandler,
More informationCrossings and patterns in signed permutations
Crossings and patterns in signed permutations Sylvie Corteel, Matthieu Josuat-Vergès, Jang-Soo Kim Université Paris-sud 11, Université Paris 7 Permutation Patterns 1/28 Introduction A crossing of a permutation
More informationDomination game and minimal edge cuts
Domination game and minimal edge cuts Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
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 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 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 informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
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 informationGenerating Trees of (Reducible) 1324-avoiding Permutations
Generating Trees of (Reducible) 1324-avoiding Permutations Darko Marinov Radoš Radoičić October 9, 2003 Abstract We consider permutations that avoid the pattern 1324. We give exact formulas for the number
More informationarxiv: v1 [math.co] 16 Aug 2018
Two first-order logics of permutations arxiv:1808.05459v1 [math.co] 16 Aug 2018 Michael Albert, Mathilde Bouvel, Valentin Féray August 17, 2018 Abstract We consider two orthogonal points of view on finite
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
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 information5 Symmetric and alternating groups
MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple
More information