International Journal of Combinatorial Optimization Problems and Informatics. E-ISSN:
|
|
- Audrey Walker
- 5 years ago
- Views:
Transcription
1 International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: International Journal of Combinatorial Optimization Problems and Informatics México Karim, Lutful; Khan, Nargis Simple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth International Journal of Combinatorial Optimization Problems and Informatics, vol. 2, núm. 2, mayoagosto, 2011, pp International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: How to cite Complete issue More information about this article Journal's homepage in redalyc.org Scientific Information System Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Non-profit academic project, developed under the open access initiative
2 International Journal of Combinatorial Optimization Problems and Informatics, Vol. 2, No. 2, May-Aug 2011, pp ISSN: Simple permutations of the classes Av(321, 3412) and Av(321, 4123) have polynomial growth Lutful Karim and Nargis Khan* Department of Computing and Information Science University of Guelph, Canada *Department of Computer Science Ryerson University, Canada Abstract. A permutation is called simple if its only blocks i.e. subsets of the permutation consist of singleton and the permutation itself. For example, 2134 is not a simple permutation since it consists of a block 213 but 3142 is a simple permutation. The basis of a class of permutations is a set of patterns, which is minimal under involvement and do not belong to the permutation. In this paper we prove that the number of simple permutations a n of the pattern class Av(321, 3412) follows the recurrence a n = a n 1 +a n 2 for n 4 and the pattern class Av(321, 4123) follows the recurrence a n = a n 2 +a n 3 for n 7. Thus, these pattern classes have polynomial growth. 1 Introduction Permutation is a bijection f : [n] [n] of the set [n]. Total number of permutations of length n = n!. For example, 312 is permutation of length 3. Here, f:[3] [3] is defined by f(1)=3, f(2)=1, f(3)=2. Sn= set of all permutations of length n. For example, S2 = 12, 21 Let α and β be two permutations. β is involved in α (denoted by β α) if β is order isomorphic to a subsequence of α. For example, the permutation is involved in as is order isomorphic to the subsequence of the permutation A set of permutations A is called a pattern class or simply a class if, whenever α is a permutation in A and β is involved in α then β A. For example, the class of all increasing permutations is a pattern class. The basis of a class A is the set of permutations which are minimal under involvement and do not belong to A. For example, the pattern class whose basis is 21 consists of only the increasing permutations I = 1, 12, 123, 1234 etc. Thus, I is the class of permutations restricted by 21 and is also denoted I = Av(21). Enumerating the permutations of a pattern class with a finite basis is one of the major research issues in this area. A block of a permutation is a set of consecutive positions that also has consecutive values. A permutation is simple if its only blocks are singletons and the permutation itself. For example, the permutation is not simple as it has a nontrivial block On the other hand, 2413, 3142 and are simple permutations. A pattern class Av(α) has polynomial growth if the number of permutations a n of this class follows bound: a n (α) An m where A and m are some constants. Simple permutations play an important role in the study of permutation pattern classes where, permutation classes are used in pattern recognition, machine learning, search and optimization. Hence, studying the structure of simple permutations has a great importance. Albert and Atkinson have shown that a pattern class containing only finitely many simple permutations have algebraic generating function. [2,8,9].The work done by Brignall et al [10] prove that a sufficiently long simple permutation in fact contains two nearly disjoint simple sub-permutations. The work done by Robert Brignall [7] presents properties such as enumeration, partially well-ordered pattern classes containing finitely many simple permutations. In this paper, we investigated the structures of the pattern classes Av(α, β) with two basis α and β of length 3 and 4 where, α = 321 and β= 3412 or 4123 and it is found that simple permutations of Av(321, 3412) and Av(321, 4123) have polynomial growth. The remainder of this paper is organized as follows.
3 Section 2 present and proves different lemmas to show that the generating function of Av(321, 3412) is polynomial. Similarly, Section 3 proves with lemmas, conjectures and diagrams that the number of simple permutations Av(321, 4123) has polynomial growth. Finally, section 4 concludes the paper with some future research directions. 2 Av(321, 3412) Let σ Av(321, 3412), σ = n. Consider the position where n lies in σ. The elements to the right of n are increasing (to avoid 321). The structure of the permutations avoiding 321 and 3412 is shown in figure 17. When at least 2 elements x 1, x 2 exist to the right of n the shaded region Z would be empty otherwise, ynx 1 x 2 would form 3412 where, y Z. Lemma 1. When 2 elements x 1, x 2 exist to the right of a simple permutation of Av(321, 3412) then the region X is empty. Proof. Assume the region X is not empty. Therefore, n 1 X. Then n 1 must be separated by position from x 2 by an element y and y < x 2. Thus, n, x 2, y would form a subsequence order isomorphic to 321 (see figure 2). Fig. 1. Av(321, 3412) Fig. 2. Fig. 3. Therefore, n 1 cannot exist in the region X. So, X is empty (see figure 3). Thus, there are maximum 2 increasing elements x 1, x 2 to the right of n. But there should be at least one element to the right of n as n cannot be the last element of a simple permutation (see Figure 3). First, we consider only one element x 1 exists to the right of n. The elements in the region Z must be increasing as in the figure 4 otherwise, y 1, y 2, x 1 forms a subsequence order isomorphic to 321 for two decreasing elements y 1, y 2 Z (see Figure 5). x 1 n 1 (to be simple). Now assume that x 1 < n 2. To satisfy the simplicity y separates n 1 and n by position and y < x 1. Therefore, n 2n 1yx 1 (black circles) would form a subsequence order isomorphic to 3412 (see Figure 6). For example, let x 1 = n 3. Then n 2, n 1, y, n 3 forms a subsequence order isomorphic to 3412 (see Figure 7). Hence x 1 = n 2. Therefore, when n is at the (n 1)th position the element at nth position is n 2. When x 1 = n 2, the element y that separates n 1 and n cannot be n 6. Otherwise, n 5, n 4, z, y would form a subsequence order isomorphic to 3412 where, z separates n 4 and n 3 (see figure 8). Therefore, y = n 5 (see figure 9), y = n 4 (see figure 10) or y = n 3. When y = n 3 (see figure 11), to avoid block composition (with n 1, n 3, n, n 2), n 1 and y should be separated by z. If z n 7 then a subsequence order isomorphic to 321 or 3412 would form (can be checked using a similar structure). Therefore, z = n 5 or n 6. Now, we consider 2 increasing elements x 1, x 2 exist to the right of n (see figure 12).
4 Fig. 4. Fig. 5. Fig. 6. Fig. 7. Fig. 8. Fig. 9. Fig. 10. Fig. 11. Fig. 12.
5 x 1 n 1 otherwise, n, x 1 would form a block. Hence, x 2 = n 1 and x 1 n 2. Let x 1 n 5. Elements in the region Y cannot be decreasing otherwise, y 1, y 2, x 1 would form a subsequence order isomorphic to 321 where, y 1, y 2 are 2 decreasing elements of Y (See Figure 13). Fig. 13. Fig. 14. Fig. 15. In figure 14, the element y separates n 3 and n 2 by position. As y < x 1 (otherwise would form 321), n 4, n 3, y, x 1 (black circles) would form a subsequence order isomorphic to Hence, at most two elements n 3 and n 2 exist in the area Y. Therefore, x 1 = n 4 (when Y contains n 3 and n 2) or x 1 = n 3 (when Y contains n 2). When x 1 = n 3, the element y that immediately precedes n cannot be n 7 otherwise, n 6, n 5, z 2, y would form a subsequence order isomorphic to 3412 where, z 2 separates n 5 and n 4 and y n 7 (see figure 15). Therefore, y = n 4, n 5 or n 6 when x 1 = n 3. When x 1 = n 4, the element y just to the left of n cannot be n 5 otherwise, n 3, n 2, y, n 4 would form a subsequence order isomorphic to 3412 (see figure 16). Therefore, y = n 2 when x 1 = n 4. Let a n counts the simple permutations that have n in the position n 1 or n 2. Suppose, type A is the simple permutations where n is in the position n 2 and type B is the simple permutations where n is in the position n 1. These two types are inverse of one another and so there are 1 2 a n of each type. Put b n = 1 2 a n and consider b n counts the type A permutations (in this case, the position n 1 contains either n 3 or n 4). b n 1 of these permutations with positions n 1 containing n 3 and b n 2 of these permutations with positions n 1 containing n 4. Summary 1. n lies in the position n 1 or n b n counts the type A simple permutations α 1 α 2 nα n 2 α n 1 where α n 2 = n 3 or n 4 and α n 1 = n Type B simple permutations are the inverse of type A simple permutations. Thus, b n = 1 2 a n counts both type of simple permutations. Conjecture There are b n 1 simple permutations of the form α 1, α 2, n, n 3, n 1 and there are b n 2 simple permutations of the form α 1, α 2, n, n 4, n 1. Lemma 2. If βnxn 1 is simple of length n and belongs to Av(321, 3412) then βn 1x is also simple of length n 1 and belongs to Av(321, 3412) (Here x = n 3) Proof. Let βn 1x is not simple and thus, there exists a block δ in βn 1x. As βnxn 1 is simple β does not have any block. Let δ contains x = n 3 and so also n 1. Then δ x (n 1) must also be a block of β and so, δ x (n 1) = 1 and δ = 3. Thus, δ includes the last element y of β and y should be equal to n 2. But y n 2 otherwise, ynxn 1 would be a block of βnxn 1. Therefore, no block exists in βn 1x and hence, βn 1x is simple of length n 1 and belongs to Av(321, 3412).
6 Lemma 3. If βn 1x is simple of length n 1 and belongs to Av(321, 3412) then βnxn 1 is also simple of length n and belongs to Av(321, 3412) (Here x = n 3) Proof. Suppose βnxn 1 is not simple. Therefore, βnxn 1 contains a block δ. Let δ includes n 1 and x = n 3. As βn 1x is simple, n 1x is not a block. So, δ also includes n and z where, z is the last element of β. δ to be a block, z should be equal to n 2. But δ n 2 (figure 15). As δ includes three elements n 1, x and z of βn 1x and βn 1x is simple, δ should include all the elements of βn 1x (If a block X contains two or more elements of a simple permutation π then X contains all the elements of π). Therefore, βnxn 1 is simple and belongs to the class Av(321, 3412). From Lemma 8 and 9, we see that there is a one-one correspondence between the simple permutation βn 1n 3 of length n 1 and simple permutations βnn 3n 1 of length n. Corollary 1. The number of simple permutations in Av(321, 3412) of the form βnn 3n 1 is b n 1. Lemma 4. If βnyn 1 is simple of length n and belongs to Av(321, 3412) then βy is also simple of length n 2 and belongs to Av(321, 3412) (y = n 4) Proof. Let βy is not simple and thus, there exists a block in βy. As βnyn 1 is simple β does not have any block. Let contains y = n 4. Then y must also be a block of β and so, y = 1 and = 2. Thus, includes the last element z of β and z should be equal to n 3 or n 5. But we have already shown that when y = n 4 then z = n 2 (see figure 16). Therefore, no block exists in βy and hence, βy is simple of length n 2 and belongs to Av(321, 3412). Lemma 5. If βy is simple of length n 2 and belongs to Av(321, 3412) then βnyn 1 is also simple of length n and belongs to Av(321, 3412) (Here y = n 4) Proof. Suppose βnyn 1 is not simple. Therefore, βnyn 1 contains a block. Let includes n 1 and y = n 4. y, n 1 is not a block and so, also includes n and z where, z is the last element of β. z = n 2 (figure 16). As includes two elements x and z of βy and βy is simple, should include all the elements of βy (If a block X contains two elements of a simple permutation π then X contains all the elements of π). Therefore, βnyn 1 is simple and belongs to the class Av(321, 3412). From Lemma 10 and 5, we see that there is a one-one correspondence between the simple permutation βn 4 of length n 2 and simple permutations βnn 4n 1 of length n. Corollary 2. The number of simple permutations in Av(321, 3412) of the form βnn 4n 1 is b n 2. From corollary 3 and 4, we can conclude that b n = b n 1 + b n 2 where, b n counts the type A simple permutations and b n = 1 2 a n (as type A is the inverse of type B simple permutations). Considering the same number of simple permutations of type B as of type A, we get the following recurrence for the number of simple permutations a n of Av(321, 3412): a n = a n 1 + a n 2 a n a n 1 a n 2 = 0 f(x) xf(x) x 2 f(x) = a 0 + (a 1 a 0 x + (a 2 a 1 a 0 )x 2 + (a 3 a 2 a 1 )x 3 + α n=4 (a n a n 1 a n 2 )x n f(x)(1 x x 2 ) = (x + x 2 3x 3 ) f(x) = x+x2 3x 3 1 x x 2 3 Av(321, 4123) Let σ Av(321, 4123), σ = n. Consider the position where n lies in σ. The elements to the right of n are increasing (to avoid 321). The structure of the permutations avoiding 321 and 4123 is shown in figure 17.
7 Fig. 16. Fig. 17. Fig. 18. The shaded region X is empty otherwise, nx 1 x 2 y would form 4123 where, y X. Thus, there are maximum 2 increasing elements x 1, x 2 to the right of n. But there should be at least one element to the right of n as n cannot be the last element of a simple permutation. First, we consider only one element x 1 exists to the right of n. The elements in the region Z must be increasing otherwise, y 1, y 2, x 1 forms a subsequence order isomorphic to 321 for two decreasing elements y 1, y 2 Z (see Figure 18). x 1 n 1 (to be simple). Now assume that x 1 < n 2. Fig. 19. Fig. 20. Fig. 21. To satisfy the simplicity z 1 separates n 2 and n 1 by position and z 2 separates n 1 and n by position. If z 1 > z 2 then n 2, z 1, z 2 (black circles) would form a subsequence order isomorphic to 321 (see Figure 19). If z 1 < z 2 then n 2, z 1, z 2, x 1 (black circles) would form a subsequence order isomorphic to 4123 (see Figure 20). Hence x 1 = n 2. Therefore, when n is at the (n 1)th position the element at nth position is n 2. Now, we consider 2 increasing elements x 1, x 2 exist to the right of n (See Figure 21). Lemma 6. If 2 increasing elements x 1, x 2 exist to the right of n then the region Z is empty (Figure 24). Proof. Assume the region Z is not empty. Therefore, n 1 Z. Then n 1 must be separated by position from n by an element y. If y lies below x 1 then n 1yx 1 x 2 forms a subsequence order isomorphic to If y lies above x 1 then n 1yx 1 forms a subsequence order isomorphic to 321 (see Figure 22, 23). Therefore, no element lies in the region Z (see Figure 24). x 1 n 1 otherwise, n, x 1 would form a block. Hence, x 2 = n 1 and x 1 n 2. Let x 1 n 5. Elements in the region Y cannot be decreasing otherwise, y 1, y 2, x would form a subsequence order isomorphic to 321 where, y 1, y 2 are 2 decreasing elements of Y. In figures 25 and 26, the element z 1 separates n 4 and n 3 by position and z 2 separates n 3 and n 2 by position. If z 1 > z 2 then n 4, z 1, z 2 (black circles) would form a subsequence order isomorphic to 321 (see Figure 25).
8 Fig. 22. Fig. 23. Fig. 24. Fig. 25. Fig. 26. Fig. 27. If z 1 < z 2 then n 4, z 1, z 2, x 1 (black circles) would form a subsequence order isomorphic to 4123 ( see Figure 26). Hence, there at most two elements n 3 and n 2 exist in the area Y. Therefore, x 1 = n 4 (when Y contains n 3 and n 2) or x 1 = n 3 (when Y contains n 2). Fig. 28. Fig. 29. Fig. 30. Similarly, we can show that when only one element x 1 = n 2 is to the right of n then z 1 = n 4 or n 5 (by considering n 1 as n and two elements z 1, x 1 to the right of n 1, see Figure 27). Let a n counts the simple permutations that have n in the position n 1 or n 2. a n 2 of these permutations are with positions n 2 containing n and a n 3 of these permutations are with positions n 1 containing n. Summary 1. n lies in the position n 1 or n a n counts the simple permutations α 1 α 2 nα n 2 α n 1 where α n 2 = n 3 or n 4 and α n 1 = n a n counts the simple permutations α 1 α 2 α n 2 nα n 1 where α n 2 = n 4 or n 5 and α n 1 = n 2. Conjecture
9 There are a n 2 simple permutations of the form α 1, α 2, n, n 3, n 1 and there are a n 3 simple permutations of the form α 1, α 2, n, n 4, n 1. Lemma 7. If βnxn 1 is simple and belongs to the class Av(321,4123) then βx is also simple and belongs to the class. Proof. There is no nontrivial block contained entirely in β since such a block would be a block of βnxn 1. Suppose βx contains a nontrivial block δ. Then δ x is a block of β. So δ x =1 and δ = 2. We have already shown that if a simple permutation of the form βnxn 1 belongs to Av(321, 4123) then x = n 3 or n 4. First, we consider x = n 4. As δ contains x, the other element of δ should be y = n 3 or n 5. From the figure 28, we see that a subsequence order isomorphic to 321 is formed when y = n 3. From the figures 29 and 30, we see that a subsequence order isomorphic to 4123 is formed when y = n 5. Therefore, y n 3 or y n 5. Therefore, βx does not have any nontrivial block and so, βx is simple and belongs to Av(321, 4123). Now, we consider x = n 3 then the other element of δ should be y = n 2 or n 4. If y = n 2 then y, n, n 3, n 1 would form a block of βnxn 1, a contradiction as βnxn 1 is simple. If y = n 4 then n 2 is to the left of n 4 but n 2 cannot be adjacent to y otherwise, n 2, y, n, x, n 1 would form a block of βnxn 1. Thus n 2 and y = n 4 must be separated by position by an element z and n 2zyx forms a subsequence order isomorphic to 4123 (see Figure 31). Therefore y n 2 or y n 4. Therefore, βx does not have any nontrivial block δ. Lemma 8. If βx is simple of length n 2 and belongs to the class Av(321,4123) then βnxn 1 is also simple of length n and belongs to Av(321,4123). Proof. Suppose βnxn 1 is not simple. Therefore, βnxn 1 contains a block δ. For βnxn 1 to be in Av(321, 4123), there are at most 2 increasing elements to the right of n. Therefore, x (< n 1) is a single element otherwise, there will be more that 2 elements to the right of n. Let δ includes n 1 and x. As βx is simple of length n 2 and belongs to Av(321, 4123), x = n 3 or n 4 (we already have shown). Therefore, x, n 1 is not a block and so, δ also includes n and y where, y is the last element of β. y = n 5 or n 6 when two elements y and x lie to the right of n 2 (figure 32) and y = n 2 when one element x lies to the right of n 2 (figure 33). Fig. 31. Fig. 32. As δ includes two elements x and y of βx and βx is simple, δ should include all the elements of βx (If a block X contains two elements of a simple permutation π then X contains all the elements of π). Therefore, βnxn 1 is simple and belongs to the class Av(321, 4123).
10 From Lemma 7 and 8, we see that there is a one-one correspondence between the simple permutation βx of length n 2 and simple permutations βnxn 1 of length n. Corollary 3. The number of simple permutations in Av(321, 4123) of the form βnxn 1 is a n 2. Lemma 9. If βn 1ynn 2 is simple and belongs to the class Av(321, 4123) then βy is also simple and belongs to the class. Proof. There is no nontrivial block contained entirely in β since such a block would be a block of βn 1ynn 2. Suppose βy contains a block. Then y would also be a block of β. So x =1 and = 2. Fig. 33. Fig. 34. Fig. 35. y n 3 otherwise, n 1ynn 2 would form a block and so, βn 1ynn 2 cannot be simple. If y n 6 then a subsequence order isomorphic to 321 or 4123 would form (see Figure 34 35). Therefore, y = n 4 or n 5. First, we consider y = n 5. As contains y, the other element of should be z = n 4 or n 6. If z = n 4 or n 6 then a subsequence order isomorphic to 321 or 4123 would form (Similar to Lemma 7). Therefore, z n 4 or z n 6. Therefore, βy does not have any nontrivial block and so, βx is simple and belongs to Av(321, 4123). Now, we consider y = n 4 then the other element of should be z = n 3 or n 5. If z = n 3 then z, n 1, n 4, n, n 2 would form a block of βn 1ynn 2, a contradiction as βn 1ynn 2 is simple. If z = n 5 then a subsequence order isomorphic to 4123 is formed (Similar to Lemma 7). Therefore, z n 3 or z n 5. Therefore, βy does not have any nontrivial block. Lemma 10. If βx is simple of length n 3 and belongs to the class Av(321,4123) then β, n 1, y, n, n 2 is also simple of length n and belongs to Av(321,4123). Proof. Suppose β, n 1, y, n, n 2 is not simple. Therefore, β, n 1, y, n, n 2 contains a block. Let includes n 2. Then must include n, y, n 1. As βy is simple and belongs to Av(321, 4123), y n 3 (it was shown that y = n 4 or n 5). Therefore, n 1, y, n, n 2 is not a block and so, also includes z where, z is the last element of β. As includes two elements y and z of βy and βy is simple, should include all the elements of βy. Therefore, β, n 1, y, n, n 2 is simple and belongs to the class Av(321, 4123). From Lemma 9 and 10, we see that there is a one-one correspondence between the simple permutation βy of length n 3 and simple permutations β, n 1, y, n, n 2 of length n. Corollary 4. The number of simple permutations in Av(321, 4123) of the form βn 1ynn 2 is a n 3. From Corollary 3 and 4, we can conclude that the enumeration of simple permutations of Av(321, 4123) follows the recurrence: a n = a n 2 + a n 3 a n a n 2 a n 3 = 0
11 4 Conclusion and Future Works Permutation pattern classes are used in machine learning, pattern recognition, search and optimizations. Hence, it is very important to study the structure of simple permutations and identify their properties. In this paper we prove that Av(321, 3412) and Av(321, 4123) have polynomial growth. More research can be done in this area to see whether any more non-isomorphic pattern classes with two basis of length 3 and 4 or both of length 4 with polynomial growth exists and to generalize the criteria of a pattern class to have polynomial growth. References 1. M. H. Albert and M. D. Atkinson. Simple permutations and pattern restricted permutations. Discrete Math., 300(1-3):1 15, M. H. Albert, M. D. Atkinson, and M. Klazar. The enumeration of simple permutations. J. Integer Seq., 6(4):Article , 18 pp. (electronic), M. Atkinson, M. Murphy, and N. Ruskuc. Partially well-ordered closed sets of permutations, M. D. Atkinson. Restricted permutations. Discrete Math., 195(1-3):27 38, M. D. Atkinson and T. Stitt. Restricted permutations and the wreath product. Discrete Math., 259(1-3):19 36, Miklos Bona. Combinatorics of Permutations. CHAPMAN HALL/CRC, Robert Brignall. A survey of simple permutations, Robert Brignall, Sophie Huczynska, and Vince Vatter. Decomposing simple permutations, with enumerative consequences, Jun Robert Brignall, Sophie Huczynska, and Vince Vatter. Simple permutations and algebraic generating functions, August Robert Brignall, Sophie Huczynska, and Vincent Vatter. Decomposing simple permutations, with enumerative consequences. Combinatorica, 28(4): , Adam Marcus and Gábor Tardos. Excluded permutation matrices and the Stanley-Wilf conjecture. J. Combin. Theory Ser. A, 107(1): , M.M Murphy. Restricted Permutations, Antichains, Atomic Classes and Stack Sorting. PhD thesis, University of St. Andrews, Daniel A. Spielman and Miklós Bóna. An infinite antichain of permutations. Electron. J. Combin., 7:Note 2, 4 pp. (electronic), 2000.
Simple 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 informationClasses of permutations avoiding 231 or 321
Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern
More informationSome algorithmic and combinatorial problems on permutation classes
Some algorithmic and combinatorial problems on permutation classes The point of view of decomposition trees PhD Defense, 2009 December the 4th Outline 1 Objects studied : Permutations, Patterns and Classes
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 informationGrid classes and the Fibonacci dichotomy for restricted permutations
Grid classes and the Fibonacci dichotomy for restricted permutations Sophie Huczynska and Vincent Vatter School of Mathematics and Statistics University of St Andrews St Andrews, Fife, Scotland {sophieh,
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 informationSimple permutations: decidability and unavoidable substructures
Simple permutations: decidability and unavoidable substructures Robert Brignall a Nik Ruškuc a Vincent Vatter a,,1 a University of St Andrews, School of Mathematics and Statistics, St Andrews, Fife, KY16
More informationPin-Permutations and Structure in Permutation Classes
and Structure in Permutation Classes Frédérique Bassino Dominique Rossin Journées de Combinatoire de Bordeaux, feb. 2009 liafa Main result of the talk Conjecture[Brignall, Ruškuc, Vatter]: The pin-permutation
More informationStruct: Finding Structure in Permutation Sets
Michael Albert, Christian Bean, Anders Claesson, Bjarki Ágúst Guðmundsson, Tómas Ken Magnússon and Henning Ulfarsson April 26th, 2016 Classical Patterns What is a permutation? π = 431265 = Classical Patterns
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 informationTHE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL
THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL REBECCA SMITH Department of Mathematics SUNY Brockport Brockport, NY 14420 VINCENT VATTER Department of Mathematics Dartmouth College
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 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 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 informationDecomposing simple permutations, with enumerative consequences
Decomposing simple permutations, with enumerative consequences arxiv:math/0606186v1 [math.co] 8 Jun 2006 Robert Brignall, Sophie Huczynska, and Vincent Vatter School of Mathematics and Statistics University
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 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 informationarxiv:math/ v2 [math.co] 25 Apr 2006
arxiv:math/050v [math.co] 5 pr 006 PERMUTTIONS GENERTED Y STCK OF DEPTH ND N INFINITE STCK IN SERIES MURRY ELDER bstract. We prove that the set of permutations generated by a stack of depth two and an
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 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 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 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 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 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 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 informationWhat Does the Future Hold for Restricted Patterns? 1
What Does the Future Hold for Restricted Patterns? 1 by Zvezdelina Stankova Berkeley Math Circle Advanced Group November 26, 2013 1. Basics on Restricted Patterns 1.1. The primary object of study. We agree
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 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 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 informationPermutation classes and infinite antichains
Permutation classes and infinite antichains Robert Brignall Based on joint work with David Bevan and Nik Ruškuc Dartmouth College, 12th July 2018 Typical questions in PP For a permutation class C: What
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 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 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 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 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 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 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 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 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 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 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 informationLecture 3 Presentations and more Great Groups
Lecture Presentations and more Great Groups From last time: A subset of elements S G with the property that every element of G can be written as a finite product of elements of S and their inverses is
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More 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 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 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 informationAutomatic Enumeration and Random Generation for pattern-avoiding Permutation Classes
Automatic Enumeration and Random Generation for pattern-avoiding Permutation Classes Adeline Pierrot Institute of Discrete Mathematics and Geometry, TU Wien (Vienna) Permutation Patterns 2014 Joint work
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 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 informationGEOMETRIC GRID CLASSES OF PERMUTATIONS
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 365, Number 11, November 2013, Pages 5859 5881 S 0002-9947(2013)05804-7 Article electronically published on April 25, 2013 GEOMETRIC GRID CLASSES
More informationFrom permutations to graphs
From permutations to graphs well-quasi-ordering and infinite antichains Robert Brignall Joint work with Atminas, Korpelainen, Lozin and Vatter 28th November 2014 Orderings on Structures Pick your favourite
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 informationON THE INVERSE IMAGE OF PATTERN CLASSES UNDER BUBBLE SORT. 1. Introduction
ON THE INVERSE IMAGE OF PATTERN CLASSES UNDER BUBBLE SORT MICHAEL H. ALBERT, M. D. ATKINSON, MATHILDE BOUVEL, ANDERS CLAESSON, AND MARK DUKES Abstract. Let B be the operation of re-ordering a sequence
More informationCombinatorial specification of permutation classes
FPSAC 2012, Nagoya, Japan DMTCS proc. (subm.), by the authors, 1 12 Combinatorial specification of permutation classes arxiv:1204.0797v1 [math.co] 3 Apr 2012 Frédérique Bassino 1 and Mathilde Bouvel 2
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 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 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 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 informationPattern Avoidance in Poset Permutations
Pattern Avoidance in Poset Permutations Sam Hopkins and Morgan Weiler Massachusetts Institute of Technology and University of California, Berkeley Permutation Patterns, Paris; July 5th, 2013 1 Definitions
More informationHomogeneous permutations
Homogeneous permutations Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, U.K. p.j.cameron@qmul.ac.uk Submitted: May 10, 2002; Accepted: 18
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 informationREU 2006 Discrete Math Lecture 3
REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4
More informationarxiv: v2 [math.co] 27 Apr 2015
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique arxiv:1312.5907v2 [math.co] 27 Apr 2015 Aistis Atminas 1 DIMAP and Mathematics Institute University of Warwick, Coventry, UK a.atminas@warwick.ac.uk
More informationarxiv: v4 [math.co] 29 Jan 2018
arxiv:1510.00269v4 [math.co] 29 Jan 2018 Generating Permutations With Restricted Containers Michael Albert Department of Computer Science University of Otago Dunedin, New Zealand Jay Pantone Department
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 informationarxiv: v1 [math.co] 13 May 2016
arxiv:1605.04289v1 [math.co] 13 May 2016 Growth Rates of Permutation Classes: Categorization up to the Uncountability Threshold 1. Introduction Jay Pantone Department of Mathematics Dartmouth College Hanover,
More informationA survey of stack-sorting disciplines
A survey of stack-sorting disciplines Miklós Bóna Department of Mathematics, University of Florida Gainesville FL 32611-8105 bona@math.ufl.edu Submitted: May 19, 2003; Accepted: Jun 18, 2003; Published:
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 informationarxiv: v2 [math.co] 4 Dec 2017
arxiv:1602.00672v2 [math.co] 4 Dec 2017 Rationality For Subclasses of 321-Avoiding Permutations Michael H. Albert Department of Computer Science University of Otago Dunedin, New Zealand Robert Brignall
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 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 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 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 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 informationMa/CS 6a Class 16: Permutations
Ma/CS 6a Class 6: Permutations By Adam Sheffer The 5 Puzzle Problem. Start with the configuration on the left and move the tiles to obtain the configuration on the right. The 5 Puzzle (cont.) The game
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More 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 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 informationarxiv: v1 [math.co] 14 Oct 2014
Intervals of permutation class growth rates David Bevan arxiv:1410.3679v1 [math.co] 14 Oct 2014 Abstract We prove that the set of growth rates of permutation classes includes an infinite sequence of intervals
More informationσ-coloring of the Monohedral Tiling
International J.Math. Combin. Vol.2 (2009), 46-52 σ-coloring of the Monohedral Tiling M. E. Basher (Department of Mathematics, Faculty of Science (Suez), Suez-Canal University, Egypt) E-mail: m e basher@@yahoo.com
More informationEnumeration of simple permutations in Av(52341,53241,52431,35142
Enumeration of simple permutations in Av(52341, 53241, 52431, 35142, 42513, 351624) University of Idaho Permutation Patterns 2014 July 10, 2014 Relation to Algebraic Geometry Enumeration of Each Class
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationON THE PERMUTATIONAL POWER OF TOKEN PASSING NETWORKS.
ON THE PERMUTATIONAL POWER OF TOKEN PASSING NETWORKS. M. H. ALBERT, N. RUŠKUC, AND S. LINTON Abstract. A token passing network is a directed graph with one or more specified input vertices and one or more
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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationSorting classes. H. van Ditmarsch. Department of Computer Science. University of Otago.
M. H. Albert Department of Computer Science University of Otago malbert@cs.otago.ac.nz M. D. Atkinson Department of Computer Science University of Otago mike@cs.otago.ac.nz D. A. Holton Department of Mathematics
More informationarxiv: v1 [math.co] 7 Aug 2012
arxiv:1208.1532v1 [math.co] 7 Aug 2012 Methods of computing deque sortable permutations given complete and incomplete information Dan Denton Version 1.04 dated 3 June 2012 (with additional figures dated
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 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 informationCircular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo
Circular Nim Games S. Heubach 1 M. Dufour 2 1 Dept. of Mathematics, California State University Los Angeles 2 Dept. of Mathematics, University of Quebeq, Montreal May 7, 2010 Math Colloquium, Cal Poly
More informationCharacterising inflations of monotone grid classes of permutations
Characterising inflations of monotone grid classes of permutations Robert Brignall Nicolasson Joint work wið Michæl Albert and Aistis Atminas Reykjavik, 29þ June 2017 Two concepts of structure Enumeration
More informationENUMERATION SCHEMES FOR PATTERN-AVOIDING WORDS AND PERMUTATIONS
ENUMERATION SCHEMES FOR PATTERN-AVOIDING WORDS AND PERMUTATIONS BY LARA KRISTIN PUDWELL A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial
More informationA FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 6 No. 1 (2017), pp. 39-46. c 2017 University of Isfahan www.combinatorics.ir www.ui.ac.ir A FAMILY OF t-regular SELF-COMPLEMENTARY
More informationSets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set
Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) Gazihan Alankuş (Based on original slides by Brahim Hnich
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 informationarxiv: v2 [math.co] 29 Sep 2017
arxiv:1709.10042v2 [math.co] 29 Sep 2017 A Counterexample Regarding Labelled Well-Quasi-Ordering Robert Brignall Michael Engen and Vincent Vatter School of Mathematics and Statistics The Open University
More informationWhat Does the Future Hold for Restricted Patterns? 1
What Does the Future Hold for Restricted Patterns? by Zvezdelina Stankova Berkeley Math Circle Advanced Group November 26, 203. An Exhaustive Survey versus Paths for Further Research Restricted patterns
More informationDomino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations
Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations Benjamin Caffrey 212 N. Blount St. Madison, WI 53703 bjc.caffrey@gmail.com Eric S. Egge Department of Mathematics and
More informationSome t-homogeneous sets of permutations
Some t-homogeneous sets of permutations Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931 (USA) Stephen Black IBM Heidelberg (Germany) Yves Edel
More information5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.
A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English
More information