Counting Peaks and Valleys in a Partition of a Set
|
|
- Mildred McDaniel
- 5 years ago
- Views:
Transcription
1 Journal of Integer Sequences Vol Article Counting Peas and Valleys in a Partition of a Set Toufi Mansour Department of Mathematics University of Haifa 1905 Haifa Israel toufi@math.haifa.ac.il Mar Shattuc Department of Mathematics University of Tennessee Knoxville TN 7996 USA shattuc@math.ut.edu Abstract A partition π of the set [n] {1...n} is a collection {B 1 B...B } of nonempty disjoint subsets of [n] called blocs whose union equals [n]. In this paper we find an explicit formula for the generating function for the number of partitions of [n] with exactly blocs according to the number of peas valleys in terms of Chebyshev polynomials of the second ind. Furthermore we calculate explicit formulas for the total number of peas and valleys in all the partitions of [n] with exactly blocs providing both algebraic and combinatorial proofs. 1 Introduction A partition Π of the set [n] {1...n} is a collection {B 1 B...B } of nonempty disjoint subsets of [n] called blocs whose union equals [n]. We assume that blocs are listed in increasing order of their minimal elements that is minb 1 < min B < < min B. The 1
2 set of all partitions of [n] with blocs is denoted by Pn. The cardinality of Pn is the well-nown Stirling number of the second ind [1] which is usually denoted by S n. Any partition Π can be written in the canonical sequential form π 1 π π n where i B πi for all i see e.g. [7]. Throughout we will identify each partition with its canonical sequential form. For example if Π {1 4} { 5 7} {} {6} is a partition of [7] then its canonical sequential form is π 114 and in such a case we write Π π. Several authors have studied different subword patterns on the set of partitions of [n]. For example Mansour and Munagi [9] studied the number of partitions of [n] according to the number levels rises and descents. Recall that a level respectively rise descent of a word π π 1 π π n is an index i such that π i π i+1 respectively π i < π i+1 π i > π i+1. A general question concerns counting the elements in a subset of Pn which have no occurrences of a particular pattern. On this subject the reader is referred to the wors of Sagan [1] Mansour and Severini [10] Chen et al. [1] and Jelíne and Mansour [4] as well as to the references therein. Let [] n denote the set of all words of length n over the alphabet []. Given π π 1 π π n [] n a pea respectively valley is an entry π j 1 j n of π such that π j < π j+1 > π j+ respectively π j > π j+1 < π j+ ; that is a pea is a rise followed immediately by a descent and a valley is a descent followed immediately by a rise. In this case we say that a pea or valley occurs at j in π. We denote the number of peas respectively valleys in π by peaπ respectively valleyπ. That there are n 1 permutations of [n] without peas valleys was shown [5] and later extended [6] by Kitaev. Comparable results on words are given by Heubach and Mansour [] where they find an explicit formula for the generating function for the number of elements of [] n according to the number of peas valleys see [] for further results. See also the paper by Mansour [8] for analogous results on Dyc paths. The aim of this paper is to find an explicit formula for the generating function for the number of partitions of [n] with exactly blocs expressed canonically according to the number of peas valleys where is fixed. The case of peas respectively valleys is treated in Section respectively Section. Our main approach is to first compute the generating functions for the number of peas or valleys for words over [] of length n and then relate this to the corresponding generating functions for partitions of [n] with exactly blocs via the restricted growth function of the partition. All the explicit solutions obtained in Sections and involve Chebyshev polynomials of the second ind see [11]. We also derive explicit formulas for the total number of peas and valleys in all the partitions of [n] with exactly blocs providing both algebraic and combinatorial proofs. Counting peas Let W xq be the generating function for the number of words of length n over the alphabet [] according to the number of peas that is W xq x n. n 0 π [] n q peaπ
3 Lemma.1. The generating function W xq satisfies the recurrence relation W xq with the initial condition W 0 xq 1. xq xq 1W 1 xq 1 x1 q1 x xx + q1 xw 1 xq Proof. Let us write an equation for W xq. Since each word in [] n may or may not contain the letter we have W xq W 1 xq + W xq where W xq is the generating function for the number of words π of length n over the alphabet [] according to the number of peas such that π contains the letter. Such words π may be decomposed as either π π π π or π π where π is a nonempty word over the alphabet [ 1] π is a nonempty word over the alphabet [] π is a nonempty word over the alphabet [] which starts with a letter a < and π is a word over the alphabet []. The corresponding generating functions for the number of words of these forms are given by x xw 1 xq 1 xw xq 1 x W 1 xq 1W xq and xqw 1 xq 1W xq xw xq 1 respectively. Summing these five generating functions we obtain which implies which is equivalent to as claimed. W xq xq 1 xq 1W 1 xq + x1 q1 x + x + q1 xw 1 xqw xq W xq xq xq 1W 1 xq + x1 q1 x W xq + x + q1 xw 1 xqw xq xq xq 1W 1 xq 1 x1 q1 x xx + q1 xw 1 xq In order to write the explicit formula for the generating function W xq we need the following lemma. Lemma.. Let a n be any sequence defined by the recurrence relation a n A+Ba n 1 C+Da n 1 with the initial condition a 0 1 such that α BC AD 0. Then for all n 0 A+B A α U n 1 B+C U α n B+C α a n α A+B α U n B+C α U n 1 B+C α B where U m is the m-th Chebyshev polynomial of the second ind. A+B α U n 1 B+C U α n B+C α
4 Proof. We proceed by induction on n. Since U 0 t 1 U 1 t 0 and U t 1 the lemma holds for n 0. Let g n A + B α U n 1 B + C α U n B + C α. Assume the lemma holds for n and let us prove it for n + 1: a n+1 A + Ba n A + B C + Da n C + D Ag n αgn+1 Bg n αgn+1 Ag n Bg n A αg n+1 C αg n+1 BC DAg n Ag n+1 Cg n+1 αg n. Using the fact that the Chebyshev polynomials of the second ind satisfy the recurrence relation U m t tu m 1 t U m t 1 we get g n B+C α g n+1 g n+ which implies a n+1 and completes the induction step. Ag n+1 Cg n+1 B + Cg n+1 + αg n+ Ag n+1 αgn+ Bg n+1 Combining Lemmas.1 and. we obtain the following result. Theorem.. The generating function W xq for the number of words of length n over the alphabet [] according to the number of peas is given by W xq xq 1 U 1 t U t U t U 1 t 1 xq 1 U 1 t U t where t 1 + x 1 q and U m is the m-th Chebyshev polynomial of the second ind. Remar.4. The mapping on [] n given by π 1 π π n + 1 π π + 1 π n implies that the generating function for the number of words of length n over the alphabet [] according to the number of valleys is also given by W xq. Theorem. for q 0 gives W x 0 which by 1 implies the following corollary. x U 1 t U t U t U 1 t 1 + x U 1 t U t 4
5 Corollary.5. The generating function W x 0 for the number of words of length n over the alphabet [] without peas is given by W x 0 U 1 t U t 1 xu 1 t U t where t 1 + x and U m is the m-th Chebyshev polynomial of the second ind. Now we consider the number of peas valleys in all the words of length n over the alphabet []. Theorem. gives lim W x U 1 1 U 1 xq lim q 1 q 1 d U dq t U 1 t + U t q1 +x U 1 1 U 1. Since U and d U dq 1 + x1 q q1 x + we get lim W x xq lim q 1 q 1 x + x 1 1 x which agrees with the generating function for the number of words of length n over the alphabet []. To find the q-partial derivative of W xq at q 1 using Theorem. first let fq xq 1U 1 t U t and gq U t U 1 t 1 xq 1U 1 t U t where t 1+ x1 q. It is readily verified that f1 g1 0 f 1 x g 1 x x f 1 x and g 1 x 4 +1 x where primes denote differentiation with respect to q. Then applying L Hôpital s rule twice to f qgq fqg q yields lim q 1 d dq W xq q1 which implies the following result. g q +1 x 1 x + x 1 x Corollary.6. The number of peas valleys in all the words of length n over the alphabet [] is given by n n +. Now we turn our attention to finding an explicit formula for the generating function PP xq for the number of partitions of [n] with exactly blocs according to the number of peas that is PP xq x n q peaπ. n 0 π Pn 5
6 Lemma.7. For all 1 PP xq x 1 + x1 qw j xq + qw j xq 1. Proof. If π is any partition of [n] with exactly blocs then π may be written as π π π where π is a partition of [n ] with exactly 1 blocs and π is a word of length n over the alphabet [] such that n + n + 1 n. Since π is either empty starts with the letter or starts with a letter less than we get PP xq xpp 1 xq1 + xw xq + qw xq xw xq 1. The desired result now follows by induction on upon noting the initial condition PP 0 xq 1. Combining Lemma.7 and Theorem. yields the following result. Theorem.8. For all 1 the generating function for the number of partitions of [n] with exactly blocs according to the number of peas is given by PP xq x 1 q 1 + x + x 1 q U jt U j 1 t U j 1 t U j t 1 + x1 q U jt U j 1 t U j 1 t U j t where t 1 + x 1 q and U m is the m-th Chebyshev polynomial of the second ind. The above theorem for q 0 implies that the generating function for the number of partitions of [n] with exactly blocs without peas is given by PP x 0 x x x U jt U j 1 t U j 1 t U j t which by 1 is equivalent to PP x 0 x U j 1 t 1 + xu j t 1 xu j 1 t U j t where t 1 + x and U m is the m-th Chebyshev polynomial of the second ind. Table 1 below presents the number of partitions of [n] with exactly blocs without peas. Corollary.9. The generating function for the number of partitions of [n] without peas is given by 1 + PP x 0 x U j 1 t 1 + xu j t 1 xu 1 0 j 1 t U j t where t 1 + x and U m is the m-th Chebyshev polynomial of the second ind. 6
7 \n Table 1: The number of partitions of [n] with exactly blocs without peas for n and Now we turn our attention to finding a formula for the total number of peas in all the partitions of [n] with exactly blocs. Theorem.8 gives 1 q 1 + x + x 1 q U jt U j 1 t PP x 1 x U j 1 t U j t lim q x1 q U jt U j 1 t U j 1 t U j t 1 + x U j1 U j 1 1 x U j 1 1 U j 1. x d Uj t U j 1 t dq U j 1 t U j t q1 Using U and d U dq 1 + x1 q q1 x + we obtain PP x 1 x x x + jx x 1 jx which is in accord with the generating function for the number of partitions of [n] with exactly blocs; see e.g. [1]. Also Theorem.8 gives d dq PP xq q1 PP x 1 lim q 1 d h dq jq h j q where h j q 1 q1+x+x 1 q u j 1+x1 q u j and u j U jt U j 1 t x U j 1 t U j with t 1+ 1 q. Let t u jq d u dq jq and u jq d u dq j q. Since u j 1 1 lim q 1 h j q 1 and lim 1 jx q 1 u jq jx we have lim q 1 d dq h jq xj 1 1 jx x lim 1 u j q 1 qu jq q x1 q u j q xj 1 1 jx 1 1 jx lim q 1 xj 1 1 jx 1 1 jx 1 qu jq 1 + x1 q u j q u j1 x jx. 7
8 It is not hard to chec that lim q 1 u jq j+1 x 4 j x 4 which implies j+1 d lim q 1 dq h xj 1 jq 1 jx + x + x j. 1 jx Hence we have d dq PP xq q1 PP x 1 x j+1 + x j 1 jx + xj 1 Since PP x 1 n 1 Snxn and xj 1 x we get the following result upon writing j+1 + j as j j j+1. Corollary.10. The number of peas in all the partitions of [n] with blocs is given by S n 1 + j j j j + 1 f nj where f nj n i ji S n i and S ij is the Stirling number of the second ind. Counting valleys In this section we find an explicit formula for the generating function V P xq for the number of partitions of [n] with exactly blocs according to the number of valleys that is V P xq x n q valleyπ. n 0 π Pn In order to achieve this let W xq respectively W xq be the generating function for the number of words π of length n over the alphabet [] respectively [ 1] according to the number of valleys in π + 1 respectively π. Lemma.1. For all and with W 1xq 1 1 x W xq W xq 1 xw xq W xq W 1xq + xw 1xqW 1xq 1 + xq and W 1 xq 1.. 8
9 Proof. The initial conditions W 1xq 1 and W 1 x 1 xq 1 hold directly from the definitions. Each word π + 1 such that π is a word over the alphabet [] can be written as either π + 1 where π is a word over the alphabet [ 1] or as π π + 1 where π is a word over the alphabet [ 1] and π is a word over the alphabet []. Note that the number of valleys in the word π + 1 equals the number of valleys in π for any word π over the alphabet [ 1]. Therefore for all which implies W xq W xq + xw xqw xq W xq W xq 1 xw xq. Similarly each word π such that π is a word over the alphabet [ 1] can be written either as π such that π is a word over the alphabet [ ] or as π 1π such that π is a word over the alphabet [ ] and π is a word over the alphabet [ 1]. Note that the number of valleys in the word π 1 equals the number of valleys in 1π 1 for any word π over the alphabet [ ]. Therefore for all W xq W 1xq + xw 1xqW 1xq 1 + xq where xq accounts for the word 1 which yields the result above. Lemma.. For all 1 W xq xq 1A A +1 1 x q 1A where A 1 + x1 xq 1U t U t t 1 + x 1 q and U m is the m-th Chebyshev polynomial of the second ind. Proof. Lemma.1 gives W xq xq 1 + W 1 xq 1 xw 1 xq with initial condition W 1 xq 1. Assume that W xq A B A B A 1 xq 1 + B 1 xa 1 for all 1. Then we have which implies A xq 1B x q 1A 1 and B B 1 xa 1 with A 1 B 1 1 A 1 + x1 xq 1 and B 1 x. Therefore A ta 1 A A 1 1 A 1 + x1 xq 1. Hence by 1 and induction on we have A A. From the recurrence A xq 1B x q 1A 1 we get B which completes the proof. 1 A xq x q 1A 9
10 Lemma.1 and imply W xq W +1 xq xq 1. Thus by Lemma. we get which by implies the following result. Lemma.. For all 1 W xq xq 1tA +1 A + A + 1 x q 1A +1 W xq xq 1A A + 1 x q 1A +1 where A 1 + x1 xq 1U t U t t 1 + x 1 q and U m is the m-th Chebyshev polynomial of the second ind. From the fact that each partition π of [n] with exactly blocs may be expressed uniquely as π 1π 1 π π such that π j is a word over the alphabet [j] it follows that the generating function V P xq is given by 1 V P xq x V xq W jxq 4 where V xq is the generating function for the number of words π over the alphabet [] according to the number of valleys in π. Lemma.4. For all 1 V xq 1 1 xw j xq. Proof. Since each word π where π is a word over the alphabet [] can be written either as π where π is a word over the alphabet [ 1] or as π π where π is a word over the alphabet [ 1] and π is a word over the alphabet [] we get V xq V xq + xw xqv xq 5 where V xq is the generating function for the number of words π over the alphabet [ 1] according to the number of valleys in π. Similarly each word π where π is a word over the alphabet [ 1] can be written either as π where π is a word over the alphabet [ ] or as π 1π where π is a word over the alphabet [ ] and π is a word over the alphabet [ 1]. Also the number of valleys in π π 1 equals the number of valleys in 1π 1π 1 for any word π over the alphabet [ ]. Therefore V xq V 1xq + xw 1xqV 1 xq. 6 Hence by 5 and 6 we get V xq V 1 xq xw xqv xq for all 1. Applying this recurrence relation times we have V xq 1 xq as claimed xw j
11 Now we can state the main result of this section. Theorem.5. The generating function V P xq for the number of partitions of [n] with exactly blocs is given by V P xq x 1 1 xu 1 t U t U j 1 t 1 xq 1U j t 1 xu j 1 t U j t where t 1 + x 1 q and U m is the m-th Chebyshev polynomial of the second ind. Proof. Lemma.4 and 4 yield V P xq x Thus by Lemmas. and. we have xw j xq W jxq. V P xq x A +1 1 x q 1A A +1 A 1 xq 1Aj A j+1 1 x q 1A j A j+1 A j A j+ 1 x q 1A j+1 x A 1 x q 1A 1 A +1 A 1 xq 1A j A j+1 A j where A 1 + x1 xq 1U t U t. Using the initial conditions A 1 1 A 1 + x1 xq 1 and the fact that we get V P xq x+1 q 1 A +1 A A j+1 A j xq 11 xu j 1 t U j t 1 xq 1A j A j+1 A j x 1 1 xu 1 t U t 1 + x1 xq 1U j t U j t 1 xu j 1 t U j t which by the recurrence U m t tu m 1 t U m t is equivalent to as claimed. V P xq x 1 1 xu 1 t U t 11 U j 1 t 1 xq 1U j t 1 xu j 1 t U j t
12 \n Table : The number of partitions of [n] with exactly blocs without valleys for n and The generating function for the number of partitions of [n] without valleys is given by V P x 0 0 x 1 xu 1 t U t 1 U j 1 t 1 + xu j t 1 xu j 1 t U j t where t 1 + x and U m is the m-th Chebyshev polynomial of the second ind. Table presents the number of partitions of [n] with exactly blocs without valleys. Theorem.5 together with the fact U j 1 j + 1 yields V P x 1 x 1 U j 1 1 U j 1 1 xu 1 1 U 1 1 xu j 1 1 U j 1 x 1 jx which is the generating function for the number of partitions of [n] with exactly blocs; see e.g. [1]. Also Theorem.5 gives d dq V P xq q1 V P x d U lim j 1 t 1 xq 1U j t q 1 dq 1 xu j 1 t U j t 1 1 jx 1 xu 1 1 U 1 1 x U j 11 + xu j 1 U j 11 jx 1 xu j 11 U j 1 1 jx 1 xu 1 1 U 1 1 x 1
13 which by the fact that U j1 : d U dq jt q1 x j+ implies that the generating function for the number of valleys in all the partitions of [n] with exactly blocs is given by d dq V P xq q1 x 1 1 jx x 1 x 1 jx This yields the following explicit formula. j xj 1 x + x + x j x j x j+1 1 jx x j+1 1 jx Corollary.6. The number of valleys in all the partitions of [n] with exactly blocs is given by 1 j j + 1 S n 1 S n + f nj f nj where f nj n i ji S n i f nj n i ji S n i and S ij is the Stirling number of the second ind. 4 Combinatorial proofs In this section we provide direct combinatorial proofs of Corollaries.6.6 and.10. We start with Corollary.6. Proof of Corollary.6. Proof. To show that there are n n + total peas valleys it is enough to show for each i 1 i n that there are a total of n + peas at i within all the words w 1 w w n in [] n. There are n such peas at i for which w i w i+ within all the members of [] n. To see this note that for any three distinct numbers a < b < c in [] there are n words of length n in the alphabet [] whose i + 1 st letter is c and whose i th and i + nd letters comprise the set {ab}. Upon letting a b in the preceding one sees that there are a total of n peas at i for which w i w i+. Let π π 1 π π n be any partition represented by its canonical sequence. Recall that a rise descent is said to occur at i if π i < π i+1 π i > π i+1. We will call a rise or a descent at i non-trivial if neither i nor i + 1 are the smallest elements of their respective blocs. The following lemma provides an explicit formula for the total number of non-trivial rises in all of the members of Pn. Lemma 4.1. The number of non-trivial rises descents in all of the partitions of [n] with exactly blocs is given by j f nj j 1 j.
14 where f nj n i ji S n i. Proof. Given i and j where i n and j consider all the members of Pn which may be decomposed uniquely as π π jαβ 7 where π is a partition with j 1 blocs α is a word of length i in the alphabet [j] whose last two letters form a rise and β is possibly empty. For example if i 5 j and π 1114 P1 4 then π 1 α 11 and β 4. The total number of non-trivial rises can then be obtained by finding the number of partitions which may be expressed as in 7 for each i and j and then summing over all possible values of i and j. And there are j j i S n i members of Pn which may be expressed as in 7 since there are j i choices for the first i letters of α j choices for the final two letters in α as the last letter must exceed its predecessor and S n i choices for the remaining letters π jβ which necessarily constitute a partition of an n i-set into blocs. If π is a partition of [n] and i [n] then we will say that i is minimal if i is the smallest element of a bloc within π i.e. if the i th slot of the canonical representation of π corresponds to the left-most occurrence of a letter. We now provide direct combinatorial proofs of Corollaries.6 and.10. Proof of Corollary.6. Proof. By Lemma 4.1 the first sum j j f nj counts the total number of non-trivial rises within all of the members of Pn. From these we subtract all non-trivial rises at r r where r 1 either goes in the same bloc as r j j fnj total such rises or goes in a bloc to the left of r j j fnj total such rises. Thus the second sum j+1 j fnj counts all non-trivial rises at r in which r 1 fails to appear in a bloc to the right of r upon noting j + j j+1. Therefore the difference between the two sums counts all valleys at m in which m + is not minimal. We ll call valleys at m where m+ is minimal trivial. So to complete the proof we must show that the total number of trivial valleys at m m 1 is given by 1 Sn 1 which we rewrite as Sn + 1 Sn Sn 1 using the fact that S n 1 S n +S n 1. First there are Sn trivial valleys at m where m is not minimal. To see this pic three numbers a < b < c in [] and let t denote the smallest element of the c th bloc of λ Pn. Increase all members of [tn ] {tt+1...n } by two within λ leaving all numbers within their current blocs. Then add t to bloc b and t+1 to bloc a to obtain a member of Pn in which a trivial valley occurs at t where t is not minimal. For example if n 10 5a 1b and c 4 with λ {1 4} { } {5} {6 8} {7} belonging to P8 5 then t 6 and the resulting member λ {1 4 7} { } {5 6} {8 10} {9} of P10 5 has a trivial valley at 6. There are also Sn trivial valleys at m where m is minimal and not occurring as a singleton bloc. To see this pic numbers a < b < c in [] and let t denote the smallest element of the b th bloc of λ Pn. Increase all members of [tn ] by two within λ and add t to bloc c and t+1 to bloc a. The resulting member of Pn will have a trivial 14
15 valley at t with the singleton bloc {t} not occurring. Finally there are 1 Sn 1 trivial valleys at m in which the bloc {m} occurs. To see this pic a < b in [ 1] and let t denote the smallest element of the b th bloc of λ Pn 1. Increase all members of [tn ] by two within λ. Then add t + 1 to bloc a as well as the singleton bloc {t}. The resulting member of Pn will have a trivial valley at t with the singleton bloc {t} occurring. For example if n 9 4a 1 and b with λ {1 4} { 6} {5 7} P7 then t 5 and the resulting member λ {1 4 6} { 8} {5} {7 9} of P9 4 has a trivial valley at 5. Proof of Corollary.10. Proof. By reasoning similar to that used in the proof of Lemma 4.1 there are a total of j j j fnj non-trivial descents at r + 1 in which r is not minimal in all the members of Pn. Reasoning as in the proof of Corollary.6 above we see that there are a total of j+1 j fnj non-trivial descents at r + 1 in which either r either goes in the same bloc as r + 1 or goes in a bloc to the right of r + 1 where r itself is not minimal. Thus the difference between the two sums counts all peas at r where r + 1 is not minimal. So to complete the proof we ll show that the total number of peas at r where r + 1 is minimal is given by Sn 1. To see this we first observe that peas at r where r + 1 is minimal are synonymous with descents at r + 1 where r + 1 is minimal. To show that Sn 1 counts all descents at i for some i where i is the smallest member of its bloc in some member of Pn first choose two numbers a < b in []. Given λ Pn 1 let t denote the smallest member of bloc b. Increase all members of [t + 1n 1] in λ by one leaving them within their blocs and then add t + 1 to bloc a. This produces a descent between the first element of bloc b and an element of bloc a within some member of Pn. For example if n 7 4a 1 and b then λ {1 5} {} { 4} {6} P6 4 would give rise to the descent between and 4 in {1 4 6} {} { 5} {7} P7 4. References [1] W. C. Chen E. P. Deng R. X. Du R. P. Stanley and C. H. Yan Crossings and nestings of matchings and partitions Trans. Amer. Math. Soc [] S. Heubach and T. Mansour Enumeration of -letter patterns in compositions Integers Conference Celebration of the 70th Birthday of Ron Graham University of West Georgia Carrollton 005. [] S. Heubach and T. Mansour Combinatorics of Compositions and Words CRC Press Boca Raton 009. [4] V. Jelíne and T. Mansour On pattern-avoiding partitions Electron. J. Combin #R9. [5] S. Kitaev Multi-avoidance of generalized patterns Discrete Math
16 [6] S. Kitaev Partially ordered generalized patterns Discrete Math [7] M. Klazar On abab-free and abba-free set partitions European J. Combin [8] T. Mansour Counting peas at height in a Dyc path J. Integer Seq Article.1.1. [9] T. Mansour and A. Munagi Enumeration of partitions by long rises levels and descents J. Integer Seq Article [10] T. Mansour and S. Severini Enumeration of -noncrossing partitions Discrete Math [11] T. Rivlin Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory John Wiley New Yor [1] B. E. Sagan Pattern avoidance in set partitions to appear in Ars Combin. [1] R. P. Stanley Enumerative Combinatorics Vol. 1 Cambridge University Press Cambridge UK Mathematics Subject Classification: 05A18 05A15 4C05 Keywords: set partition generating function recurrence relation pea valley Concerned with sequences A A Received April ; revised version received June Published in Journal of Integer Sequences June 010. Return to Journal of Integer Sequences home page. 16
Counting permutations by cyclic peaks and valleys
Annales Mathematicae et Informaticae 43 (2014) pp. 43 54 http://ami.ektf.hu Counting permutations by cyclic peaks and valleys Chak-On Chow a, Shi-Mei Ma b, Toufik Mansour c Mark Shattuck d a Division of
More informationA Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.3 A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! Ira M. Gessel 1 and Guoce Xin Department of Mathematics Brandeis
More informationTILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX
#A05 INTEGERS 9 (2009), 53-64 TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300 shattuck@math.utk.edu
More informationExtensions of the linear bound in the Füredi Hajnal conjecture
Extensions of the linear bound in the Füredi Hajnal conjecture Martin Klazar Adam Marcus May 17, 2006 Abstract We present two extensions of the linear bound, due to Marcus and Tardos, on the number of
More information1. Introduction
Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence
More informationMATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2
MATH 80: ENUMERATIVE COMBINATORICS ASSIGNMENT KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(, n of the second ind is defined as the number of partitions of a [] into n non-empty blocs. We
More informationExcluded permutation matrices and the Stanley Wilf conjecture
Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that
More informationd-regular SET PARTITIONS AND ROOK PLACEMENTS
Séminaire Lotharingien de Combinatoire 62 (2009), Article B62a d-egula SET PATITIONS AND OOK PLACEMENTS ANISSE KASAOUI Université de Lyon; Université Claude Bernard Lyon 1 Institut Camille Jordan CNS UM
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationRook Polynomials In Higher Dimensions
Grand Valley State University ScholarWors@GVSU Student Summer Scholars Undergraduate Research and Creative Practice 2009 Roo Polynomials In Higher Dimensions Nicholas Krzywonos Grand Valley State University
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationCongruence successions in compositions
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:, 014, 37 338 Congruence successions in compositions Toufik Mansour 1 Mark Shattuck Mark C. Wilson 3 1 Department of Mathematics, University
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationCOUNTING STAIRCASES IN INTEGER COMPOSITIONS
COUNTING STAIRCASES IN INTEGER COMPOSITIONS AUBREY BLECHER AND TOUFIK MANSOUR Abstract The main theorem establishes the generating function F which counts the number of times the staircase 1 + 2 + 3 +
More informationGENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES
Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationASYMPTOTIC ENUMERATION OF PERMUTATIONS AVOIDING GENERALIZED PATTERNS
ASYMPTOTIC ENUMERATION OF PERMUTATIONS AVOIDING GENERALIZED PATTERNS SERGI ELIZALDE Abstract. Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number
More informationThe initial involution patterns of permutations
The initial involution patterns of permutations Dongsu Kim Department of Mathematics Korea Advanced Institute of Science and Technology Daejeon 305-701, Korea dskim@math.kaist.ac.kr and Jang Soo Kim Department
More informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationOn Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000
On Descents in Standard Young Tableaux arxiv:math/0007016v1 [math.co] 3 Jul 000 Peter A. Hästö Department of Mathematics, University of Helsinki, P.O. Box 4, 00014, Helsinki, Finland, E-mail: peter.hasto@helsinki.fi.
More informationarxiv:math/ v1 [math.co] 10 Nov 1998
A self-dual poset on objects counted by the Catalan numbers arxiv:math/9811067v1 [math.co] 10 Nov 1998 Miklós Bóna School of Mathematics Institute for Advanced Study Princeton, NJ 08540 April 11, 2017
More informationarxiv: v3 [math.ac] 29 Aug 2018
ON THE LOCAL K-ELASTICITIES OF PUISEUX MONOIDS MARLY GOTTI arxiv:1712.00837v3 [math.ac] 29 Aug 2018 Abstract. If M is an atomic monoid and x is a nonzero non-unit element of M, then the set of lengths
More informationSet partition statistics and q-fibonacci numbers
Set partition statistics and q-fibonacci numbers Adam M. Goyt Department of Mathematics Michigan State University East Lansing, Michigan 48824-1027 goytadam@msu.edu www.math.msu.edu/ goytadam Bruce E.
More informationPattern Avoidance in Ordered Set Partitions
Pattern Avoidance in Ordered Set Partitions arxiv:1212.2530v2 [math.co] 24 Mar 2013 Anant Godbole 1 Department of Mathematics and Statistics East Tennessee State University Johnson City, TN 37614, USA
More informationParity Theorems for Statistics on Domino Arrangements
Parity Theorems for Statistics on Domino Arrangements Mar A Shattuc Mathematics Department University of Tennessee Knoxville, TN 37996-1300 shattuc@mathutedu Carl G Wagner Mathematics Department University
More informationPermutation Statistics and q-fibonacci Numbers
Permutation Statistics and q-fibonacci Numbers Adam M Goyt and David Mathisen Mathematics Department Minnesota State University Moorhead Moorhead, MN 56562 Submitted: April 2, 2009; Accepted: August 2,
More informationZero-sum square matrices
Zero-sum square matrices Paul Balister Yair Caro Cecil Rousseau Raphael Yuster Abstract Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the
More informationA New Shuffle Convolution for Multiple Zeta Values
January 19, 2004 A New Shuffle Convolution for Multiple Zeta Values Ae Ja Yee 1 yee@math.psu.edu The Pennsylvania State University, Department of Mathematics, University Park, PA 16802 1 Introduction As
More informationActions and Identities on Set Partitions
Actions and Identities on Set Partitions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Marberg,
More informationA New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009, Article 09.3. A New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan Sadek Bouroubi University of Science and Technology
More informationCombinatorial Unification of Binomial-Like Arrays
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 5-2010 Combinatorial Unification of Binomial-Lie Arrays James Stephen Lindsay University
More informationPermutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials arxiv:math/0208046v1 [math.co] 6 Aug 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationRECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES. Arthur T. Benjamin Department of Mathematics, Harvey Mudd College, Claremont, CA 91711
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A55 RECOUNTING DETERMINANTS FOR A CLASS OF HESSENBERG MATRICES Arthur T. Benjamin Department of Mathematics, Harvey Mudd College,
More informationSHI-MEI MA AND YEONG-NAN YEH
ENUMERATION OF PERMUTATIONS BY NUMBER OF ALTERNATING DESCENTS SHI-MEI MA AND YEONG-NAN YEH Abstract. In this paper we present an explicit formula for the number of permutations with a given number of alternating
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationThis paper was published in Connections in Discrete Mathematics, S. Butler, J. Cooper, and G. Hurlbert, editors, Cambridge University Press,
This paper was published in Connections in Discrete Mathematics, S Butler, J Cooper, and G Hurlbert, editors, Cambridge University Press, Cambridge, 2018, 200-213 To the best of my knowledge, this is the
More informationSelf-dual interval orders and row-fishburn matrices
Self-dual interval orders and row-fishburn matrices Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yuexiao Xu Department of Mathematics
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationPattern avoidance in ascent sequences
Pattern avoidance in ascent sequences Paul Duncan 25 Vega Court Irvine, CA 92617, USA pauldncn@gmail.com Einar Steingrímsson Department of Computer and Information Sciences University of Strathclyde, Glasgow
More informationRestricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials
Discrete Mathematics 305 (2005) 70 89 wwwelseviercom/locate/disc Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polynomials Sergi Elizalde a, Toufik Mansour b a Department
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationSmall Group Divisible Steiner Quadruple Systems
Small Group Divisible Steiner Quadruple Systems Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher Department of Mathematical Sciences, Michigan Technological University Houghton, MI 49913-0402,
More informationDiscrete Mathematics. Kishore Kothapalli
Discrete Mathematics Kishore Kothapalli 2 Chapter 4 Advanced Counting Techniques In the previous chapter we studied various techniques for counting and enumeration. However, there are several interesting
More informationLinear transformations preserving the strong q-log-convexity of polynomials
Linear transformations preserving the strong q-log-convexity of polynomials Bao-Xuan Zhu School of Mathematics and Statistics Jiangsu Normal University Xuzhou, PR China bxzhu@jsnueducn Hua Sun College
More informationA combinatorial bijection on k-noncrossing partitions
A combinatorial bijection on k-noncrossing partitions KAIST Korea Advanced Institute of Science and Technology 2018 JMM Special Session in honor of Dennis Stanton January 10, 09:30 09:50 I would like to
More informationGeneralized Akiyama-Tanigawa Algorithm for Hypersums of Powers of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 16 (2013, Article 1332 Generalized Aiyama-Tanigawa Algorithm for Hypersums of Powers of Integers José Luis Cereceda Distrito Telefónica, Edificio Este
More informationOn certain combinatorial expansions of the Legendre-Stirling numbers
On certain combinatorial expansions of the Legendre-Stirling numbers Shi-Mei Ma School of Mathematics and Statistics Northeastern University at Qinhuangdao Hebei, P.R. China shimeimapapers@163.com Yeong-Nan
More informationarxiv: v1 [math.co] 5 Oct 2007
SOME BIJECTIONS ON SET PARTITIONS ROBERT PARVIAINEN Abstract We study three similar bijections on set partitions The first is an involution defined by Kasraoui and Zeng which proves the symmetry of the
More informationEQUIDISTRIBUTION AND SIGN-BALANCE ON 132-AVOIDING PERMUTATIONS. Toufik Mansour 1,2
Séminaire Lotharingien de Combinatoire 5 (2004), Article B5e EQUIDISTRIBUTION AND SIGN-BALANCE ON 32-AVOIDING PERMUTATIONS Toufik Mansour,2 Department of Mathematics, Chalmers University of Technology
More informationLINEAR RECURRENCES AND CHEBYSHEV POLYNOMIALS
LINEAR RECURRENCES AND CHEBYSHEV POLYNOMIALS Sergey Kitaev Matematik Chalmers tekniska högskola och Göteborgs universitet S-412 96 Göteborg Sweden e-mail: kitaev@math.chalmers.se Toufik Mansour Matematik
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationGeneralized Near-Bell Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 2009, Article 09.5.7 Generalized Near-Bell Numbers Martin Griffiths Department of Mathematical Sciences University of Esse Wivenhoe Par Colchester
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
More information2 Generating Functions
2 Generating Functions In this part of the course, we re going to introduce algebraic methods for counting and proving combinatorial identities. This is often greatly advantageous over the method of finding
More informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationWords with the Smallest Number of Closed Factors
Words with the Smallest Number of Closed Factors Gabriele Fici Zsuzsanna Lipták Abstract A word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationChapter 5: Integer Compositions and Partitions and Set Partitions
Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Fall 2017 1 / 46 5.1. Compositions A strict
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationNote On Parikh slender context-free languages
Theoretical Computer Science 255 (2001) 667 677 www.elsevier.com/locate/tcs Note On Parikh slender context-free languages a; b; ; 1 Juha Honkala a Department of Mathematics, University of Turku, FIN-20014
More informationBOUNDS ON ZIMIN WORD AVOIDANCE
BOUNDS ON ZIMIN WORD AVOIDANCE JOSHUA COOPER* AND DANNY RORABAUGH* Abstract. How long can a word be that avoids the unavoidable? Word W encounters word V provided there is a homomorphism φ defined by mapping
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationA Major Index for Matchings and Set Partitions
A Major Index for Matchings and Set Partitions William Y.C. Chen,5, Ira Gessel, Catherine H. Yan,6 and Arthur L.B. Yang,5,, Center for Combinatorics, LPMC Nankai University, Tianjin 0007, P. R. China Department
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationarxiv:math/ v1 [math.co] 11 Oct 2002
COUNTING THE OCCURRENCES OF GENERALIZED PATTERNS IN WORDS GENERATED BY A MORPHISM arxiv:math/0210170v1 [math.co] 11 Oct 2002 Sergey Kitaev and Toufik Mansour 1 Matematik, Chalmers tekniska högskola och
More informationarxiv:math/ v1 [math.co] 2 Oct 2002
PARTIALLY ORDERED GENERALIZED PATTERNS AND k-ary WORDS SERGEY KITAEV AND TOUFIK MANSOUR arxiv:math/020023v [math.co] 2 Oct 2002 Matematik, Chalmers tekniska högskola och Göteborgs universitet, S-42 96
More informationOn the symmetry of the distribution of k-crossings and k-nestings in graphs
On the symmetry of the distribution of k-crossings and k-nestings in graphs Anna de Mier Submitted: Oct 11, 2006; Accepted: Nov 7, 2006; Published: Nov 23, 2006 Mathematics Subject Classification: 05A19
More informationDIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO
DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO Abstract. In this paper, we give a sampling of the theory of differential posets, including various topics that excited me. Most of the material is taken from
More informationEnumeration Schemes for Words Avoiding Permutations
Enumeration Schemes for Words Avoiding Permutations Lara Pudwell November 27, 2007 Abstract The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching
More informationToufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden
COUNTING OCCURRENCES OF 32 IN AN EVEN PERMUTATION Toufik Mansour Department of Mathematics, Chalmers University of Technology, S-4296 Göteborg, Sweden toufik@mathchalmersse Abstract We study the generating
More informationPLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK
PLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK Abstract. Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular,
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationCyclic Derangements. Sami H. Assaf. Department of Mathematics MIT, Cambridge, MA 02139, USA
Cyclic Derangements Sami H. Assaf Department of Mathematics MIT, Cambridge, MA 02139, USA sassaf@math.mit.edu Submitted: Apr 16, 2010; Accepted: Oct 26, 2010; Published: Dec 3, 2010 Mathematics Subject
More informationTransformations Preserving the Hankel Transform
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 10 (2007), Article 0773 Transformations Preserving the Hankel Transform Christopher French Department of Mathematics and Statistics Grinnell College Grinnell,
More informationBP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS. 1. Introduction and results
BP -HOMOLOGY AND AN IMPLICATION FOR SYMMETRIC POLYNOMIALS DONALD M. DAVIS Abstract. We determine the BP -module structure, mod higher filtration, of the main part of the BP -homology of elementary 2- groups.
More informationPolynomial functions on subsets of non-commutative rings a link between ringsets and null-ideal sets
Polynomial functions on subsets of non-commutative rings a lin between ringsets and null-ideal sets Sophie Frisch 1, 1 Institut für Analysis und Zahlentheorie, Technische Universität Graz, Koperniusgasse
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationChapter 5: Integer Compositions and Partitions and Set Partitions
Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Winter 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Winter 2017 1 / 32 5.1. Compositions A strict
More informationLinked partitions and linked cycles
European Journal of Combinatorics 29 (2008) 1408 1426 www.elsevier.com/locate/ejc Linked partitions and linked cycles William Y.C. Chen a, Susan Y.J. Wu a, Catherine H. Yan a,b a Center for Combinatorics,
More informationPattern Avoidance in Set Partitions
Pattern Avoidance in Set Partitions Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 48824-1027 USA sagan@math.msu.edu May 19, 2006 Key Words: D-finite, enumeration,
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationGap Embedding for Well-Quasi-Orderings 1
WoLLIC 2003 Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 Nachum Dershowitz 2 and Iddo Tzameret 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract Given a
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationHomework 1 (revised) Solutions
Homework 1 (revised) Solutions 1. Textbook, 1.1.1, # 1.1.2 (p. 24) Let S be an ordered set. Let A be a non-empty finite subset. Then A is bounded and sup A, inf A A Solution. The hint was: Use induction,
More information