A BIJECTION BETWEEN WELL-LABELLED POSITIVE PATHS AND MATCHINGS
|
|
- Stephanie Harper
- 5 years ago
- Views:
Transcription
1 Séminaire Lotharingien de Combinatoire 63 (0), Article B63e A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS OLVER BERNARD, BERTRAND DUPLANTER, AND PHLPPE NADEAU Abstract. A well-labelled positive path of size n is a pair (p,σ) made of a word p = p 1 p...p n 1 on the alphabet { 1,0,+1} such that j i=1 p i 0 for all j = 1...n 1, together with a permutation σ = σ 1 σ...σ n of {1,...,n} such that p i = 1 implies σ i < σ i+1, while p i = 1 implies σ i > σ i+1. We establish a bijection between welllabelled positive paths of size n and matchings (i.e., fixed-point free involutions) on {1,...,n}. This proves that the number of well-labelled positive paths is (n 1)!! (n 1) (n 3) 3 1. Well-labelled positive paths appeared recently in the author s article Partition function of a freely-jointed chain in a half-space [in preparation] as a useful tool for studying a polytope Π n related to the space of configurations of the freely-jointed chain (of length n) in a half-space. The polytope Π n consists of points (x 1,...,x n ) [ 1,1] n such that j i=1 x i 0 for all j = 1...n, and it was shown that well-labelled positive paths of size n are in bijection with a collection of subpolytopes partitioning Π n. Given that the volume of each subpolytope is 1/n!, our results prove combinatorially that the volume of Π n is (n 1)!!/n!. Our bijection has other enumerative corollaries in terms of up-down sequences of permutations. ndeed, by specialising our bijection, we prove that the number of permutations of size n such that each prefix has no more ascents than descents is [(n 1)!!] if n is even and n!!(n )!! if n is odd. 1. ntroduction A well-labelled path of size n is a pair (p,σ) made of a word p = p 1 p...p n 1 on the alphabet { 1, 0, +1}, together with a permutation σ = σ 1 σ...σ n of [n] {1,...,n} such that p i = 1 implies σ i < σ i+1, while p i = 1 implies σ i > σ i+1. We shall represent a path (p,σ) as a lattice path on Z starting at (0,0) and made of steps (1,p i ) for i = 1...n 1 together with the label σ i on the ith lattice point of the path for i = 1...n. For instance, two well-labelled paths of size 10 are represented in Figure 1. A well-labelled path (p,σ) is said Motzkin (respectively positive) if j i=1 p i 0 for all j = 1...n and n 1 i=1 p i = 1 (respectively j i=1 p i 0 for all j = 1...n 1). n this paper, we define a bijection between well-labelled Motzkin paths of size n + 1 and matchings (fixed-point free involutions) on [n]. We then define a closely related bijection between well-labelled positive paths of size n, and matchings on [n]. Our bijections are defined recursively and involve a bijection by Chen [3] between labelled binary trees and matchings. The first enumerative consequence of our bijection is that well-labelled Motzkin paths of size n + 1 and well-labelled positive paths of size n are both counted by (n 1)!! (n 1) (n 3) 3 1. n fact, our bijections also have enumerative corollaries Date: April 6, 0.
2 O. BERNARD, B. DUPLANTER, AND P. NADEAU (a) (b) 3 Figure 1. (a) A well-labelled Motzkin path. (b) A well-labelled positive path. in terms of up-down sequences (sequences of ascents and descents) of permutations. n order to obtain these results, we perform a refined enumeration of well-labelled paths (p,σ) according to the number of horizontal steps (the number of letters 0 in p). More precisely, we show that the number of well-labelled positive paths of size n with k horizontal steps is ( )( n n 1 ) k k k! [(n k 1)!!] if n k is even and ( )( n n 1 ) k k k! (n k)!! (n k )!! otherwise. Similarly, the number of well-labelled Motzkin paths of size n with k horizontal steps is ( )( n n ) k k k!(n k 1)!!(n k 3)!! if n k is even (and 0 otherwise). Observe that well-labelled paths (p, σ) without horizontal steps are completely determined by the permutation σ. ndeed, in this case the word p encodes the up-down sequence of the permutation σ. Hence, by specialising our results to paths with no horizontal steps (i.e., k = 0), we enumerate permutations whose updown sequence belong to a certain family. For instance, we prove that the number of permutations of size n such that each prefix has no more ascents than descents is [(n 1)!!] if n is even and n!! (n )!! otherwise. We also prove that the number of permutations of size n having one more ascent than descent but such that each prefix has no more ascents than descents is (n 1)!! (n 3)!! if n is even (and 0 otherwise). These enumerative results contrast with those in [, 4, 5, 7] by the fact that we consider here a family of admissible up-down sequences rather than a single sequence. Well-labelled positive paths appeared recently in [1], in the computation of the partition function for the freely-jointed chain [6] in a half-space, and this was our original motivation for studying these paths. ndeed, the space of configurations of the freelyjointed chain of length n projects naturally on the polytope Π n consisting of all points (x 1,...,x n ) [ 1, 1] n such that j i=1 x i 0 for all j = 1...n; and it is shown in [1] that well-labelled positive paths of size n are in bijection with a set of subpolytopes partitioning Π n. Given that the volume of each subpolytope is 1/n!, our results prove combinatorially that the volume of Π n is (n 1)!!. n! The paper is organised as follows. n Section, we define a recursive decomposition of well-labelled positive and Motzkin paths. We then translate these decompositions in terms of generating functions. For Motzkin paths, solving the generating function equation shows that the number of well-labelled Motzkin paths of size n+1 is (n 1)!!. From this, a simple induction shows that the number of well-labelled positive paths of size n is also (n 1)!!. n Section 3, we use the recursive decomposition of paths in order to define bijections between well-labelled positive paths, well-labelled Motzkin paths and matchings. One step of these bijections uses a construction of Chen [3] between
3 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS 3 labelled binary trees and matchings. Lastly in Section 4, we use our bijections to count well-labelled positive and Motzkin paths according to their number of horizontal steps. Specialising these results to the paths with no horizontal steps, we enumerate permutations whose up-down sequence belong to certain families mentioned above.. Decomposition of well-labelled paths n this section, we define a recursive decomposition of the class A of well-labelled Motzkin paths and the class B of well-labelled positive paths. We then translate these equations in terms of generating functions and obtain our first counting results. We denote respectively by A n and B n the sets of paths of size n in A and B. We denote respectively by a n and b n the cardinality of A n and B n and by A(z) = n 0 a n n! zn and B(z) = b n n! zn n 0 the corresponding exponential generating functions. Observe that a 0 = a 1 = 0 and b 0 = 0. The following notation will be useful for relabelling objects: given a set of n integers, we denote by λ the order preserving bijection from [n] to (and by λ 1 the inverse bijection)..1. Decomposition of well-labelled Motzkin paths. We first define a recursive decomposition of the class A of well-labelled Motzkin paths. For i { 1, 0, 1}, we denote by A i (respectively A i n) the set of paths (p,σ) in A (respectively A n ) such that p 1 = i. Observe that A 1 is made of a single element α of size. The decomposition A = {α } A 0 A 1 is illustrated by Figure and the following proposition reveals its recursive nature. Proposition 1. For any positive integer n, the set A 0 n is in bijection with the set [n] A n 1, the set A 1 n is in bijection with the set C n made of all unordered pairs {(,P ), (,P )} such that [n], = [n] \ and P, P are well-labelled Motzkin paths of respective size and. A = α A 0 A 1 Figure. Recursive decomposition of well-labelled Motzkin paths. Proof. For any path (p,σ) in A 0 n one obtains a pair (k, (p,σ )) in [n] A n 1 by setting k = σ 1, p = p...p n 1 and σ = σ 1...σ n 1 where σ i = λ 1 [n]\{k} (σ i+1) for i = 1...n 1. This is clearly a bijection between A 0 n and [n] A n 1.
4 4 O. BERNARD, B. DUPLANTER AND P. NADEAU Observe that the set C n is trivially in bijection with the set C n of ordered pairs ((,P ), (,P )) such that λ (σ 1) < λ (σ 1). Let (p,σ) be a path in A 1 n and let k be the least integer such that k i=1 p i = 0 (observe that p k = 1). We define an element of C n by setting φ(p,σ) = ((, (p,σ )), (, (p,σ ))) = {σ 1,...,σ k } and = {σ k+1,...,σ n }, p = p 1...p k 1 and p = p 1...p n k 1, where p i = p k i and p i = p k+i, σ = σ 1...σ k and σ = σ 1...σ n k, where σ i = λ 1 (σ k+1 i ) and σ i = λ 1 (σ k+i ). The mapping φ is clearly a bijection between the sets A 1 n and C n, which concludes the proof. Corollary. The generating function A(z) of well-labelled Motzkin paths satisfies (1) A(z) = z A(z) + za(z) +. Proof. For i { 1, 0, 1}, we denote by a i n the cardinality of A i n and by A i (z) = a i n n 0 n! z n the corresponding generating function. The partition A = {α } A 0 A 1 gives A(z) = z + A0 (z) + A 1 (z). Moreover, the bijection between A 0 n and [n] A n 1 gives a 0 n = na n 1, hence A 0 (z) = za(z) while the correspondence between A 1 n and C n gives a 1 n = 1 n ( ) n a k a n k, hence k A 1 (z) = A(z). By solving Equation (1) (and using the fact that a 0 = 0), one gets k=0 () A(z) = 1 z 1 z. One can extract the coefficient a n either directly from this expression of A(z) or by applying Lagrange inversion formula to the series C(z) = A(z)/z. ndeed, Equation (1) gives C(z) = z (1+C(z)), hence ( (1 + x) a n+1 = (n + 1)![z n ]C(z) = (n + 1)! [x n 1 ] n ) n = (n)! n n! = (n 1)!!. We will now determine the number b n of well-labelled positive paths of size n. This can be done by exploiting a bijection between B n [n + 1] {0, 1} and B n+1 A n+1 obtained by adding one step to a positive path. The bijection is as follows: given a well-labelled positive path (p,σ) of size n, an integer k in [n + 1] and an integer b in {0, 1}, we define the labelled path (p,σ ) = ψ((p,σ),k,b) by setting σ = σ 1...σ n+1, where σ i = λ [n+1]\{k} (σ i ) for i = 1...n and σ n+1 = k, p = p 1...p n, where p i = p i for i = 1...n 1 and p n is equal to b 1 if σ n+1 > σ n and equal to b otherwise.
5 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS 5 Observe that the path (p,σ ) is well-labelled (by the choice of the step p n) and is either positive or Motzkin (since (p, σ) is positive). Moreover, the mapping ψ is a bijection between B n [n + 1] {0, 1} and B n+1 A n+1 showing that (3) (n + 1)b n = b n+1 + a n+1 for all n 0. Since a n+1 = (n 1)!! a simple induction shows that b n = (n 1)!! and proves the following. Proposition 3. The number a n+1 of well-labelled Motzkin paths of size n + 1 and the number b n of well-labelled positive paths of size n are both equal to (n 1)!!... Decomposition of well-labelled positive paths. We now define a recursive decomposition of the class B of well-labelled positive paths. We denote by β 1 the welllabelled path of size 1 and for i {0, 1}, we denote by B i the set of paths (p,σ) in B of size at least satisfying p 1 = i. For a path (p,σ) of size n in B 1, we consider the greatest integer k n such that j 1 i=1 p i 1 for all j =...k 1 and k 1 i=1 p i = 1. We denote by B the subset of paths in B 1 such that k = n and we denote B = B 1 \ B the complement. We also denote by Bn, 0 B n and B n respectively the paths of size n in B 0, B and B. The partition B = {β 1 } B 0 B B is illustrated by Figure 3 and the following proposition reveals its recursive nature. Proposition 4. For any positive integer n, the set Bn 0 is in bijection with the set [n] B n 1, the set B n is in bijection with the class A n of well-labelled Motzkin paths, the set B n is in bijection with the set D n made of the ordered pairs ((,P ), (,P )) such that [n], = [n] \, P is a well-labelled Motzkin path of size and P is a well-labelled positive path of size. = B β 1 B 0 B B Figure 3. Recursive decomposition of well-labelled positive paths. Proof. For any path (p,σ) in Bn 0 one obtains a pair (k, (p,σ )) in [n] B n 1 by setting k = σ 1, p = p...p n 1 and σ = σ 1...σ n 1 where σ i = λ 1 [n]\{k} (σ i+1) for i = 1...n 1. This is clearly a bijection between Bn 0 and [n] B n 1. A bijection between the sets B n and A n is obtained by reading the positive path backward: given a path (p,σ) in B n one obtain a path (p,σ ) in A n by setting σ = σ n...σ 1 and p = p 1...p n 1 where p i = p n i for i = 1...n 1. This is clearly a bijection. Let (p,σ) be a path in B n and let k < n be the greatest integer such that j 1 i=1 p i 1 for all j =...k 1 and k 1 i=1 p i = 1. We define a pair φ (p,σ) = ((, (p,σ )), (, (p,σ )))
6 6 O. BERNARD, B. DUPLANTER AND P. NADEAU by setting = {σ 1,...,σ k } and = {σ k+1,...,σ n }, p = p 1...p k 1 and p = p 1...p n k 1, where p i = p k i and p i = p k+i, σ = σ 1...σ k and σ = σ 1...σ n k, where σ i = λ 1 (σ k+1 i ) and σ i = λ 1 (σ k+i ). We first want to prove that ((, (p,σ )), (, (p,σ ))) is in D n. t is clear that (p,σ ) and (p,σ ) are well-labelled paths and moreover, (p,σ ) is a Motzkin path. t remains to prove that (p,σ ) is a positive path. Observe that the step p k is non-zero otherwise it contradicts the maximality of k. f p k = 1, then (p,σ ) is clearly positive because (p,σ) is positive; and if p k = +1, then (p,σ ) is positive otherwise it would contradict the maximality of k. Hence, φ is a mapping from A n to D n. The bijectivity of φ is easy to check after observing that the step p k can be recovered: it is equal to 1 if λ (σ 1) < λ (σ 1) and to 1 otherwise. Proposition 4 will allow to define a bijection between positive paths and matchings in the next section. t also leads to the following relation between the generating functions A(z) and B(z): (4) B(z) = z + zb(z) + A(z) + A(z)B(z), 1 which, by (), gives B(z) = 1. This result could also have been derived from 1 z the observation that b n = a n+1 implies B(z) = A (z). 3. Bijections with matchings Proposition 3 suggests that the classes of paths A n+1 and B n are both in bijection with matchings. The goal of this section is to describe such bijections. For this, we will introduce intermediate objects called labelled binary trees Bijections between well-labelled paths and labelled binary trees. A labelled binary tree of size n is a rooted tree with n leaves having n different labels in [n] and such that each (unlabelled) internal vertex has exactly two unordered children. We call marked labelled binary tree a labelled binary tree in which one of the (internal or external) vertices is marked. A binary tree and a marked binary tree are represented in Figure 4. We denote by T the set of labelled binary trees of size at least and we denote by R the set of marked labelled binary trees. We will now show that the recursive descriptions of the classes T and R parallel those of the classes A and B and obtain bijections between T and A and between R and B. We use the following notation for relabelling trees: if λ is a bijection between two sets of integers, J and τ is a binary tree whose leaves have labels in, then λ(τ) denotes the tree obtained from τ by replacing replacing the label i of each leaf by the label λ(i) J. Bijection between Motzkin paths and labelled trees. We denote by τ the unique labelled binary tree of size and by T 0 (respectively T 1 ) the set of labelled binary trees made of the root-vertex and two subtrees, one of which (respectively none of which) is a leaf. For all integers n, we denote respectively by T n, Tn 0 and Tn 1 the set of trees of size n in T, T 0 and T 1. We now explicit the recursive nature of the partition T = {τ } T 0 T 1.
7 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS (a) (b) Figure 4. (a) A labelled binary tree. (b) A marked labelled binary tree Proposition 5. For any integer n >, the set Tn 0 is in bijection with the set [n] T n 1. the set Tn 1 is in bijection with the set U n of unordered pairs {(,τ ), (,τ )} such that [n], = [n] \ and τ, τ are labelled binary trees in T of respective size and. Proof. Let n >. Given an integer k [n] and a tree τ in T n 1, one defines a tree τ in Tn 0 as the tree made of a root-vertex, one subtree which is a leaf labelled k and one subtree equal to λ [n]\{k} (τ) (which is not a leaf). This is a bijection between [n] T n 1 and Tn 0. Given a pair {(,τ ), (,τ )} in U n, one defines a tree τ in Tn 1 as the tree made of a root-vertex, a subtree equal to λ (τ ) and a subtree equal to λ (τ ). This is a bijection between U n and T 1 n. Definition of bijection Φ. Comparing Propositions 1 and 5, it is clear that one can define a recursive bijection Φ between the class A of well-labelled Motzkin paths and the class T of labelled binary trees. We now summarise the recursive construction of the image of a well-labelled Motzkin path (p,σ) by the bijection Φ: (i) f (p,σ) = α, then Φ(p,σ) = τ. (ii) f (p,σ) has size n > and p 1 = 0, then we set p = p...p n 1 and σ = σ 1...σ n 1 where σ i = λ 1 [n]\{σ 1 } (σ i+1) for i = 1...n 1. With these notations, we define Φ(p,σ) as the tree made of a root-vertex, the subtree made of a leaf labelled σ 1 and the subtree λ [n]\{σ1 }(Φ(p,σ )). (iii) f (p,σ) has size n > and p 1 = 1, then we consider the least integer k such that k i=1 p i = 0 and we set (as in the proof of Proposition 1): = {σ 1,...,σ k } and = {σ k+1,...,σ n }, p = p 1...p k 1 and p = p 1...p n k 1, where p i = p k i and p i = p k+i, σ = σ 1...σ k and σ = σ 1...σ n k, where σ i = λ 1 (σ k+1 i ) and σ λ 1 (σ k+i ). i = With these notations, we define Φ(p,σ) as the tree made of a root-vertex, the subtree λ (Φ(p,σ )) and the subtree λ (Φ(p,σ )).
8 8 O. BERNARD, B. DUPLANTER AND P. NADEAU For instance, the image of the Motzkin path represented in Figure 1(a) by the mapping Φ is represented in Figure 4(a). From the definition of Φ and Propositions 1 and 5, we have the following theorem. Theorem 6. For any positive integer n > 1, the mapping Φ is a bijection between well-labelled Motzkin paths of size n and labelled binary trees with n leaves. Bijection between positive paths and marked trees. We now define a bijection Φ between well-labelled positive paths and marked labelled binary trees. Before defining the bijection Φ, let us explain briefly what led us to consider marked labelled binary trees. As seen in Section, the recursive decomposition of positive paths leads to consider subpaths corresponding to either positive paths or Motzkin paths. The recursive relation is captured by Equation (4) which can be written B(z) = Ã(z) + Ã(z)B(z), where Ã(z) = z + A(z) is the generating function of unmarked binary trees (of size n 1), or equivalently, binary trees marked at their root-vertex. This relation suggests that one can interpret B(z) as the generating function of marked binary trees. We denote by ρ 1 the marked labelled tree of size 1. We denote by R R the set of marked trees of size at least such that the marked vertex is the root. Clearly, this set is in bijection with the set T of unmarked trees. We denote by R 0 (respectively R ) the set of marked trees made of a non-marked root and two subtrees, one of which (respectively none of which) is a non-marked leaf. For all integer n > 1, we denote respectively by R n, R 0 n, R n and R n the set of marked trees of size n in R, R 0, R and R. We now explicit the recursive nature of the partition Proposition 7. For all integer n > 1, R = {ρ 1 } R 0 R R. the set R 0 n is in bijection with the set [n] R n 1, the set R n is in bijection with T n, the set R n is in bijection with the set U n of ordered pairs ((,τ ), (,τ )) such that [n], = [n] \, τ is a non-marked labelled binary tree of size and τ is a marked labelled binary tree of size. The proof of Proposition 7 is similar to the proof of Proposition 5 and is omitted. Definition of bijection Φ. Comparing Propositions 4 and 7, it is clear that one can define a recursive bijection Φ between the class B of well-labelled paths and the class R of marked labelled binary trees. We now summarise the recursive construction of the image of a well-labelled positive path (p,σ) by the bijection Φ : (i) f (p,σ) = β 1 then Φ (p,σ) is the marked tree ρ 1. (ii) f (p,σ) has size n > 1 and p 1 = 0, then we define p = p...p n 1 and σ = σ 1...σ n 1, where σ i = λ 1 [n]\{σ 1 } (σ i+1) for i = 1...n 1. With these notations, we define Φ (p,σ) as the tree made of a non-marked root-vertex, the subtree made of a non-marked leaf labelled σ 1 and the marked subtree λ [n]\{σ1 }(Φ (p,σ )).
9 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS 9 (iii) f (p,σ) has size n > 1 and p 1 = 1, then we consider the greatest integer k n such that j 1 i=1 p i 1 for all j =...k 1 and k 1 i=1 p i = 1, and we set (as in the proof of Proposition 4): = {σ 1,...,σ k } and = {σ k+1,...,σ n }, p = p 1...p k 1 and p = p 1...p n k 1, where p i = p k i and p i = p k+i, σ = σ 1...σ k and σ = σ 1...σ n k, where σ i = λ 1 (σ k+1 i ) and σ λ 1 (σ k+i ). i = f k = n (that is, (p,σ) is in B ), we define Φ (p,σ) as the marked tree obtained by marking the root-vertex of the unmarked tree Φ(p,σ ) (note that, p and σ are empty in this case). Otherwise (that is, if k < n), we define Φ (p,σ) as the marked tree made of a non-marked root-vertex, the non-marked subtree λ (Φ(p,σ )) and the marked subtree λ (Φ (p,σ )). For instance, the image of the positive path represented in Figure 1(b) by the mapping Φ is represented in Figure 4(b). From the definition of Φ and Propositions 4 and 7, we have the following theorem. Theorem 8. The function Φ is a bijection between well-labelled positive paths of size n and marked labelled binary trees with n leaves. Remark. The final height of a positive path (p,σ) of size n is n 1 i=1 p i. t is not hard to prove inductively that a positive path (p,σ) has an even final height if and only if the mark of the image tree, ρ = Φ (p,σ), is on a leaf. ndeed, if (p,σ) = β 1 the final height is 0, and the mark is on a leaf of the tree ρ = ρ 1 ; while if (p,σ) is in B the final height is 1, and the mark is on an internal vertex (the root-vertex) of ρ. n the other cases ((p,σ) B 0 B ), the mark is in a subtree ρ of ρ corresponding to a path (p,σ ) having a final height of the same parity as (p,σ). 3.. Bijections between labelled binary trees and matchings. We will now present a bijection Ψ due to Chen [3] between labelled binary trees of size n and matchings on [n ]. We follow the exposition from [8, p.16] for defining the bijection Ψ and then define a similar bijection Ψ between marked binary trees of size n and matchings on [n]. The mappings Ψ and Ψ are represented in Figure 5. The first step of this bijection is to attribute a label to each internal node of the binary tree. Definition of bijection Ψ [3]. Let τ be a labelled binary tree with n leaves labelled on [n]. One defines an induced labelling of the n internal non-root vertices of τ by the following procedure. While there are unlabelled non-root vertices, we consider those among them that have both of their children labelled. There is at least one such vertex and we consider the vertex v which has the child with least label; we then attribute to v the least label in [n ]\[n] which has not yet been attributed. For instance, starting from the tree in Figure 4(a) one obtains the labels indicated in the fully labelled tree represented in Figure 5(a). One then obtains the matching π = Ψ(τ) on [n ] by letting π(i) = j for all pairs i,j [n ] which are the labels of siblings in the fully labelled tree. n [8, p.16] the mapping Ψ is proved to be a bijection between labelled binary trees of size n and matchings on [n ].
10 10 O. BERNARD, B. DUPLANTER AND P. NADEAU Ψ (a) Ψ (b) Figure 5. Bijections between labelled binary trees and matchings. Definition of bijection Ψ. Let τ be a marked labelled binary tree of size n and let τ be the corresponding unmarked tree. We consider the matching π = Ψ(τ) on [n ] and define a matching π = Ψ (τ ) on [n] as follows. f the marked vertex v of τ is the root, then π (i) = π(i) for all i in [n ] and π (n 1) = n. f v is not the root, then we consider its label k and the label l of its sibling. n this case π (i) = π(i) for all i k,l in [n ], π (k) = n and π (l) = n 1. t is clear that the mapping Ψ is a bijection between marked labelled binary tree of size n and matchings on [n]. Combining the bijections Φ, respectively Φ, with the bijections Ψ, respectively Ψ, gives the following bijective proof of Proposition 3. Theorem 9. The composition Ψ Φ is a bijection between well-labelled Motzkin paths of size n and matchings on [n ]. Similarly, Ψ Φ is a bijection between well-labelled positive paths of size n and matchings on [n]. 4. Enumerative corollaries We will now study the number of horizontal steps in well-labelled paths through the bijections Φ, Φ, Ψ, Ψ and deduce some enumerative corollaries in terms of the up-down sequences of permutations. Recall that a horizontal step of a well-labelled path (p, σ) is a letter 0 in p. We say that a leaf in a labelled binary tree is single if its sibling is an internal node. Theorem 10. For all integers n, k, the mappings Φ and Ψ induce successive bijections between well-labelled Motzkin paths of size n with k horizontal steps, labelled binary trees with n leaves, k of which are single leaves, matchings on [n ] having k pairs (i,j) such that i {1,...,n} and j {n+ 1,...,n }.
11 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS 11 For example, the Motzkin path of size n = 10 in Figure 1(a) has horizontal steps, the corresponding labelled binary tree represented in Figure 4(a) has single leaves, and the corresponding matching represented in Figure 5(a) has pairs (i,j) such that i {1,...,n} and j {n+1,...,n }. Proof. The correspondence between the number of horizontal steps of a Motzkin path (p,σ) and the number of single leaves in the binary tree Φ(p,σ) follows from a simple induction on the size of (p,σ). ndeed, one creates a single leaf in the recursive construction of Φ(p, σ) exactly when case (ii) thereof (corresponding to a horizontal step of (p,σ)) occurs. The correspondence between the number of single leaves in the binary tree τ and the number of pairs (i,j) such that i {1,...,n} and j {n+1,...,n } in the matching Ψ(τ) is an immediate consequence of the fact that the labels of external vertices are in {1,..., n} while the labels of internal vertices are in {n+1,..., n }. Corollary 11. The number of well-labelled Motzkin paths of size n having k horizontal steps is ( )( ) n n a n,k = k! (n k 1)!! (n k 3)!! k k if n k is even and 0 otherwise. Proof. By Theorem 10, the number a n,k counts matchings on [n ] with exactly k pairs (i,j) such that i {1,...,n} and j {n+1,...,n }. To enumerate such matchings, first choose these k pairs: there are ( n k) possibilities of choosing the integers i in {1,...,n}, there are ( ) n k possibilities for choosing the integers j in {n+1,...,n } and then k! possibilities to define the pairing between the chosen integers in {1,..., n} and the chosen integers in {n+1,...,n }. After that, it remains to choose a pairing of the n k unmatched integers in {1,...,n} and a pairing of the n k unmatched integers in {n+1,...,n }. Such matchings exist only if n k is even and there are (n k 1)!!(n k 3)!! of them in this case. We now examine horizontal steps in positive paths. We say that a leaf in a marked labelled binary tree is quasi-single if it is not marked and its sibling is either marked or internal. Theorem 1. For all integers n,k, the mappings Φ and Ψ induce successive bijections between well-labelled positive paths of size n with k horizontal steps, marked labelled binary trees of with n leaves, k of which are quasi-single leaves, matchings on [n] having k pairs (i,j) with i {1,...,n} and j {n+1,...,n 1}. Proof. The correspondence between the number of horizontal steps of a positive path (p,σ) and the number of quasi-single leaves in the marked tree Φ (p,σ) follows from a simple induction on the size of (p,σ). ndeed, one creates a quasi-single leaf in the recursive construction of Φ (p,σ) exactly when case (ii) of the definition of either Φ or Φ occurs.
12 1 O. BERNARD, B. DUPLANTER AND P. NADEAU We now consider a marked labelled binary tree τ of size n > 1. Let v be the marked vertex and let τ be the non-marked tree obtained by forgetting the mark. The number k of single leaves in τ and the number k of quasi-single leaves in τ are related by k = k if v is internal, k = k 1 if v is a leaf and its sibling is internal k = k + 1 if v and its sibling are both leaves. Similarly, the definition of Ψ gives a relation between the number l of pairs (i,j) of the matching Ψ (τ ) such that i {1,...,n} and j {n + 1,...,n 1} and the number l of pairs (i,j) of the matching Ψ(τ) such that i {1,...,n} and j {n+1,...,n }: l = l if the label of v is larger than n, l = l 1 if the label of v is not larger than n and the label of its sibling is larger than n, l = l + 1 if the label of v and its sibling are not larger than n. Theorem 10 gives k = l, hence the previous discussion gives k = l and concludes the proof. Corollary 13. The number of well-labelled positive paths of size n having k horizontal steps is ( )( ) n n 1 k! [(n k 1)!!] if n k is even, k k (5) b n,k = ( )( ) n n 1 k! (n k)!! (n k )!! otherwise. k k The proof of Corollary 13 is very similar to the Corollary 11 and is omitted. We now study the consequence of these results in terms of the up-down sequences of permutations. Counting permutations having a positive up-down sequence. An ascent of a permutation σ = σ 1 σ...σ n is an index i < n such that σ i < σ i+1 ; a descent is an index i < n such that σ i > σ i+1. The enumeration of permutations with a given sequence of ascents and descents, called up-down sequences (or shape) was investigated for instance in [, 4, 5, 7]. Here we will count permutations of size n such that their up-down sequences belong to a certain family, while previous works focused on the enumeration according to a single up-down sequence. We say that a permutation σ has a positive up-down sequence if for all j n the number of ascents less than j is no more than the number of descents less than j. We say that σ has a Dyck up-down sequence if it has one more ascent than descents but for all j < n the number of ascents less than j is no more than the number of descents less than j. Observe that a well-labelled path (p,σ) with no horizontal steps is completely determined by the permutation σ (indeed, the word p is determined by the up-down sequence of σ). Moreover, the well-labelled path (p, σ) is positive (respectively Motzkin) if and only if the permutation σ has a positive (respectively Dyck) up-down sequence. Thus, the following theorem immediately follows by looking at the specialisation k = 0 in Corollaries 11 and 13.
13 A BJECTON BETWEEN WELL-LABELLED POSTVE PATHS AND MATCHNGS 13 Theorem 14. For any integer n, the number of permutations of size n having a positive up-down sequence is [(n 1)!!] if n is even and n!! (n )!! otherwise. The number of permutations of size n having a Dyck up-down sequence is (n 1)!! (n 3)!! if n is even and 0 otherwise. We would be happy to see a more direct bijective proof of these specialisations. Acknowledgement: We are very thankful to Sylvie Corteel for fruitful discussions and for providing us with the conjectural formula for the numbers b n,k. References [1] O. Bernardi, B. Duplantier, and P. Nadeau. Partition function of a freely-jointed chain in a halfspace. n preparation. [] L. Carlitz. Permutations with prescribed pattern. Math. Nachr., 58:31 53, [3] W. Y. C. Chen. A general bijective algorithm for trees. Proc. Nat. Acad. Sci. U.S.A., 87(4): , [4] N. G. de Bruijn. Permutations with given ups and downs. Nieuw Arch. Wisk. (3), 18:61 65, [5] H. O. Foulkes. Enumeration of permutations with prescribed up-down and inversion sequences. Discrete Math., 15(3):35 5, [6] H. Kramers. The behavior of macromolecules in inhomogeneous flow. J. Chem. Phys., 14(7):415 44, [7]. Niven. A combinatorial problem of finite sequences. Nieuw Arch. Wisk. (3), 16:116 13, [8] R. Stanley. Enumerative combinatorics, volume. Cambridge University Press, O. Bernardi: CNRS, Département de Mathématiques, Université Paris-Sud, Orsay, France address: olivier.bernardi@math.u-psud.fr B. Duplantier: nstitut de Physique Théorique, Orme des Merisiers, CEA Saclay, Gif-sur-Yvette, France address: bertrand.duplantier@cea.fr P. Nadeau: Fakultät für Mathematik, Universität Wien, Nordbergstraße 15, A Vienna, Austria address: philippe.nadeau@univie.ac.at
Maximizing the descent statistic
Maximizing the descent statistic Richard EHRENBORG and Swapneel MAHAJAN Abstract For a subset S, let the descent statistic β(s) be the number of permutations that have descent set S. We study inequalities
More informationWieland drift for triangular fully packed loop configurations
Wieland drift for triangular fully packed loop configurations Sabine Beil Ilse Fischer Fakultät für Mathematik Universität Wien Wien, Austria {sabine.beil,ilse.fischer}@univie.ac.at Philippe Nadeau Institut
More informationarxiv: v1 [math.co] 6 Jun 2014
WIELAND GYRATION FOR TRIANGULAR FULLY PACKED LOOP CONFIGURATIONS SABINE BEIL, ILSE FISCHER, AND PHILIPPE NADEAU arxiv:1406.1657v1 [math.co] 6 Jun 2014 Abstract. Triangular fully packed loop configurations
More informationPaths, Permutations and Trees. Enumerating Permutations Avoiding Three Babson - Steingrímsson Patterns
Paths, Permutations and Trees Center for Combinatorics Nankai University Tianjin, February 5-7, 004 Enumerating Permutations Avoiding Three Babson - Steingrímsson Patterns Antonio Bernini, Elisa Pergola
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 informationNotes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.
Lecture: Hélène Barcelo Analytic Combinatorics ECCO 202, Bogotá Notes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.. Tuesday, June 2, 202 Combinatorics is the study of finite structures that
More informationENUMERATING PERMUTATIONS AVOIDING A PAIR OF BABSON-STEINGRíMSSON PATTERNS
ENUMERATING PERMUTATIONS AVOIDING A PAIR OF BABSON-STEINGRíMSSON PATTERNS ANDERS CLAESSON AND TOUFIK MANSOUR Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the
More informationA bijective proof of Shapiro s Catalan convolution
A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May
More informationA REFINED ENUMERATION OF p-ary LABELED TREES
Korean J. Math. 21 (2013), No. 4, pp. 495 502 http://dx.doi.org/10.11568/kjm.2013.21.4.495 A REFINED ENUMERATION OF p-ary LABELED TREES Seunghyun Seo and Heesung Shin Abstract. Let T n (p) be the set of
More informationRANDOM PERMUTATIONS AND BERNOULLI SEQUENCES. Dominique Foata (Strasbourg)
RANDOM PERMUTATIONS AND BERNOULLI SEQUENCES Dominique Foata (Strasbourg) ABSTRACT. The so-called first fundamental transformation provides a natural combinatorial link between statistics involving cycle
More informationSome statistics on permutations avoiding generalized patterns
PUMA Vol 8 (007), No 4, pp 7 Some statistics on permutations avoiding generalized patterns Antonio Bernini Università di Firenze, Dipartimento di Sistemi e Informatica, viale Morgagni 65, 504 Firenze,
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationPostorder Preimages. arxiv: v3 [math.co] 2 Feb Colin Defant 1. 1 Introduction
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #3 Postorder Preimages arxiv:1604.01723v3 [math.co] 2 Feb 2017 1 University of Florida Colin Defant 1 received 7 th Apr. 2016,
More informationPattern Popularity in 132-Avoiding Permutations
Pattern Popularity in 132-Avoiding Permutations The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Rudolph,
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 informationMotzkin Paths with Vertical Edges
Motzkin Paths with Vertical Edges Veronika Irvine and Frank Ruskey University of Victoria, Canada March 13, 2014 Abstract This paper considers finite lattice paths formed from the set of step vectors {,,,,
More informationUnlabelled Structures: Restricted Constructions
Gao & Šana, Combinatorial Enumeration Notes 5 Unlabelled Structures: Restricted Constructions Let SEQ k (B denote the set of sequences of exactly k elements from B, and SEQ k (B denote the set of sequences
More informationEquality of P-partition Generating Functions
Bucknell University Bucknell Digital Commons Honors Theses Student Theses 2011 Equality of P-partition Generating Functions Ryan Ward Bucknell University Follow this and additional works at: https://digitalcommons.bucknell.edu/honors_theses
More informationAsymptotic Enumeration of Compacted Binary Trees
Asymptotic Enumeration of Compacted Binary Trees Antoine Genitrini Bernhard Gittenberger Manuel Kauers Michael Wallner March 30, 207 Abstract A compacted tree is a graph created from a binary tree such
More informationAcyclic orientations of graphs
Discrete Mathematics 306 2006) 905 909 www.elsevier.com/locate/disc Acyclic orientations of graphs Richard P. Stanley Department of Mathematics, University of California, Berkeley, Calif. 94720, USA Abstract
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationCounting 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 informationIntersecting curves (variation on an observation of Maxim Kontsevich) by Étienne GHYS
Intersecting curves (variation on an observation of Maxim Kontsevich) by Étienne GHYS Abstract Consider the graphs of n distinct polynomials of a real variable intersecting at some point. In the neighborhood
More informationTHE LECTURE HALL PARALLELEPIPED
THE LECTURE HALL PARALLELEPIPED FU LIU AND RICHARD P. STANLEY Abstract. The s-lecture hall polytopes P s are a class of integer polytopes defined by Savage and Schuster which are closely related to the
More informationTHE THEORY OF HEAPS AND THE CARTIER FOATA MONOID. C. Krattenthaler
THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID C Krattenthaler Fakultät für Mathematik, Universität Wien, Nordbergstraße 15, A-1090 Vienna, Austria WWW: http://wwwmatunivieacat/~kratt Abstract We present
More informationCOMBINATORICS OF NON-AMBIGUOUS TREES
COMBINATORICS OF NON-AMBIGUOUS TREES JEAN-CHRISTOPHE AVAL, ADRIEN BOUSSICAULT, MATHILDE BOUVEL, MATTEO SILIMBANI Abstract. This article investigates combinatorial properties of non-ambiguous trees. These
More informationCOUNTING INTEGER POINTS IN POLYTOPES ASSOCIATED WITH DIRECTED GRAPHS. Ilse Fischer
COUNTING INTEGER POINTS IN POLYTOPES ASSOCIATED WITH DIRECTED GRAPHS Ilse Fischer Fakultät für Mathematik, Universität Wien Oskar-Morgenstern-Platz 1, 1090 Wien, Austria ilse.fischer@univie.ac.at Tel:
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationODD PARTITIONS IN YOUNG S LATTICE
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75g ODD PARTITIONS IN YOUNG S LATTICE ARVIND AYYER, AMRITANSHU PRASAD, AND STEVEN SPALLONE Abstract. We show that the subgraph induced in Young
More informationThe q-exponential generating function for permutations by consecutive patterns and inversions
The q-exponential generating function for permutations by consecutive patterns and inversions Don Rawlings Abstract The inverse of Fedou s insertion-shift bijection is used to deduce a general form for
More informationFormal Group Laws and Chromatic Symmetric Functions of Hypergraphs
FPSAC 2015, Daejeon, South Korea DMTCS proc. FPSAC 15, 2015, 655 666 Formal Group Laws and Chromatic Symmetric Functions of Hypergraphs Jair Taylor University of Washington Abstract. If f(x) is an invertible
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
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 informationOn the Sequence A and Its Combinatorial Interpretations
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 9 (2006), Article 06..1 On the Sequence A079500 and Its Combinatorial Interpretations A. Frosini and S. Rinaldi Università di Siena Dipartimento di Scienze
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 informationA proof of the Square Paths Conjecture
A proof of the Square Paths Conjecture Emily Sergel Leven October 7, 08 arxiv:60.069v [math.co] Jan 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationGrowing and Destroying Catalan Stanley Trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #11 Growing and Destroying Catalan Stanley Trees Benjamin Hackl 1 Helmut Prodinger 2 arxiv:1704.03734v3 [math.co] 26 Feb 2018
More informationThe Phagocyte Lattice of Dyck Words
DOI 10.1007/s11083-006-9034-0 The Phagocyte Lattice of Dyck Words J. L. Baril J. M. Pallo Received: 26 September 2005 / Accepted: 25 May 2006 Springer Science + Business Media B.V. 2006 Abstract We introduce
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 informationOrdered trees and the inorder traversal
Discrete Mathematics 306 (006) 173 1741 www.elsevier.com/locate/disc Ordered trees and the inorder traversal A. Sapounakis, I. Tasoulas, P. Tsikouras Department of Informatics, University of Piraeus, 18534
More informationChains of Length 2 in Fillings of Layer Polyominoes
Chains of Length 2 in Fillings of Layer Polyominoes Mitch Phillipson, Catherine H. Yan and Jean Yeh Department of Mathematics Texas A&M University College Station, Texas, U.S.A. {phillipson,cyan,jeanyeh}@math.tamu.edu
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 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 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 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 informationMATH 580, midterm exam SOLUTIONS
MATH 580, midterm exam SOLUTIONS Solve the problems in the spaces provided on the question sheets. If you run out of room for an answer, continue on the back of the page or use the Extra space empty page
More informationShifted symmetric functions II: expansions in multi-rectangular coordinates
Shifted symmetric functions II: expansions in multi-rectangular coordinates Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationPERMUTED COMPOSITION TABLEAUX, 0-HECKE ALGEBRA AND LABELED BINARY TREES
PERMUTED COMPOSITION TABLEAUX, 0-HECKE ALGEBRA AND LABELED BINARY TREES V. TEWARI AND S. VAN WILLIGENBURG Abstract. We introduce a generalization of semistandard composition tableaux called permuted composition
More informationTHE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES. Changwoo Lee. 1. Introduction
Commun. Korean Math. Soc. 18 (2003), No. 1, pp. 181 192 THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES Changwoo Lee Abstract. We count the numbers of independent dominating sets of rooted labeled
More informationA BIJECTIVE STUDY OF BASKETBALL WALKS
Séminaire Lotharingien de Combinatoire 77 (2016), Article B77a A BIJECTIVE STUDY OF BASKETBALL WALKS JÉRÉMIE BETTINELLI, ÉRIC FUSY, CÉCILE MAILLER, AND LUCAS RANDAZZO ABSTRACT. The Catalan numbers count
More informationarxiv: v1 [math.co] 8 Feb 2014
COMBINATORIAL STUDY OF THE DELLAC CONFIGURATIONS AND THE q-extended NORMALIZED MEDIAN GENOCCHI NUMBERS ANGE BIGENI arxiv:1402.1827v1 [math.co] 8 Feb 2014 Abstract. In two recent papers (Mathematical Research
More informationarxiv: v1 [math.co] 29 Apr 2013
Cyclic permutations realized by signed shifts Kassie Archer and Sergi Elizalde arxiv:1304.7790v1 [math.co] 9 Apr 013 Abstract The periodic (ordinal) patterns of a map are the permutations realized by the
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 informationADDITIONAL NOTES. 3 Surjections 6
Contents Labelling Atoms. Well-labelling............................................. The Exponential Generating Function egf............................3 Examples................................................
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 informationOn the H-triangle of generalised nonnesting partitions
FPSAC 204, Chicago, USA DMTCS proc. AT, 204, 83 90 On the H-triangle of generalised nonnesting partitions Marko Thiel Department of Mathematics, University of Vienna, Austria Abstract. With a crystallographic
More informationA NATURAL EXTENSION OF THE YOUNG PARTITIONS LATTICE
A NATURAL EXTENSION OF THE YOUNG PARTITIONS LATTICE C. BISI, G. CHIASELOTTI, G. MARINO, P.A. OLIVERIO Abstract. Recently Andrews introduced the concept of signed partition: a signed partition is a finite
More informationPERMUTED COMPOSITION TABLEAUX, 0-HECKE ALGEBRA AND LABELED BINARY TREES
PERMUTED COMPOSITION TABLEAUX, 0-HECKE ALGEBRA AND LABELED BINARY TREES V. TEWARI AND S. VAN WILLIGENBURG Abstract. We introduce a generalization of semistandard composition tableaux called permuted composition
More informationA new Euler-Mahonian constructive bijection
A new Euler-Mahonian constructive bijection Vincent Vajnovszki LE2I, Université de Bourgogne BP 47870, 21078 Dijon Cedex, France vvajnov@u-bourgogne.fr March 19, 2011 Abstract Using generating functions,
More informationLECTURE 7. 2 Simple trees and Lagrange Inversion Restricting the out-degree Lagrange Inversion... 4
Contents 1 Recursive specifications 1 1.1 Binary Trees B............................................ 1 1.1.1 A recursive structure.................................... 1.1. Decomposition........................................
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
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 informationLIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES
LIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES ALOIS PANHOLZER AND GEORG SEITZ Abstract. We consider so-called simple families of labelled trees, which contain, e.g., ordered,
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationFighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.
Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationOn the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States
On the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States Sven De Felice 1 and Cyril Nicaud 2 1 LIAFA, Université Paris Diderot - Paris 7 & CNRS
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationOn Minimal Words With Given Subword Complexity
On Minimal Words With Given Subword Complexity Ming-wei Wang Department of Computer Science University of Waterloo Waterloo, Ontario N2L 3G CANADA m2wang@neumann.uwaterloo.ca Jeffrey Shallit Department
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
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 informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationA basis for the non-crossing partition lattice top homology
J Algebr Comb (2006) 23: 231 242 DOI 10.1007/s10801-006-7395-5 A basis for the non-crossing partition lattice top homology Eliana Zoque Received: July 31, 2003 / Revised: September 14, 2005 / Accepted:
More informationGreedy Trees, Caterpillars, and Wiener-Type Graph Invariants
Georgia Southern University Digital Commons@Georgia Southern Mathematical Sciences Faculty Publications Mathematical Sciences, Department of 2012 Greedy Trees, Caterpillars, and Wiener-Type Graph Invariants
More informationInvolutions by Descents/Ascents and Symmetric Integral Matrices. Alan Hoffman Fest - my hero Rutgers University September 2014
by Descents/Ascents and Symmetric Integral Matrices Richard A. Brualdi University of Wisconsin-Madison Joint work with Shi-Mei Ma: European J. Combins. (to appear) Alan Hoffman Fest - my hero Rutgers University
More informationCOUNTING NONINTERSECTING LATTICE PATHS WITH TURNS
COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS C. Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. e-mail: KRATT@Pap.Univie.Ac.At Abstract. We derive
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationLattice paths with catastrophes
Lattice paths with catastrophes Lattice paths with catastrophes SLC 77, Strobl 12.09.2016 Cyril Banderier and Michael Wallner Laboratoire d Informatique de Paris Nord, Université Paris Nord, France Institute
More informationCrossings and Nestings in Tangled Diagrams
Crossings and Nestings in Tangled Diagrams William Y. C. Chen 1, Jing Qin 2 and Christian M. Reidys 3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P. R. China 1 chen@nankai.edu.cn,
More informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
More informationEnumerative and Algebraic Combinatorics of OEIS A071356
Enumerative and Algebraic Combinatorics of OEIS A071356 Chetak Hossain Department of Matematics North Carolina State University July 9, 2018 Chetak Hossain (NCSU) Combinatorics of OEIS A071356 July 9,
More informationA RELATION BETWEEN SCHUR P AND S. S. Leidwanger. Universite de Caen, CAEN. cedex FRANCE. March 24, 1997
A RELATION BETWEEN SCHUR P AND S FUNCTIONS S. Leidwanger Departement de Mathematiques, Universite de Caen, 0 CAEN cedex FRANCE March, 997 Abstract We dene a dierential operator of innite order which sends
More informationExpected Number of Distinct Subsequences in Randomly Generated Binary Strings
Expected Number of Distinct Subsequences in Randomly Generated Binary Strings arxiv:704.0866v [math.co] 4 Mar 08 Yonah Biers-Ariel, Anant Godbole, Elizabeth Kelley March 6, 08 Abstract When considering
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 informationAlmost all trees have an even number of independent sets
Almost all trees have an even number of independent sets Stephan G. Wagner Department of Mathematical Sciences Stellenbosch University Private Bag X1, Matieland 7602, South Africa swagner@sun.ac.za Submitted:
More informationTableau models for Schubert polynomials
Séminaire Lotharingien de Combinatoire 78B (07) Article #, pp. Proceedings of the 9 th Conference on Formal Power Series and Algebraic Combinatorics (London) Tableau models for Schubert polynomials Sami
More informationReconstructibility of trees from subtree size frequencies
Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 4, 435 442 Reconstructibility of trees from subtree size frequencies Dénes Bartha and Péter Burcsi Abstract. Let T be a tree on n vertices. The subtree frequency
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationPeriodic Patterns of Signed Shifts
FPSAC 2013, Paris, France DMTCS proc. (subm.), by the authors, 1 12 Periodic Patterns of Signed Shifts Kassie Archer 1 and Sergi Elizalde 1 1 Department of Mathematics, Dartmouth College, Hanover, NH 03755.
More informationRectangular Young tableaux with local decreases and the density method for uniform random generation (short version)
Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version) Cyril Banderier 1 Philippe Marchal 2 Michael Wallner 3 March 25, 2018 1 : LIPN UMR-CNRS
More informationEnumerative Combinatorics 7: Group actions
Enumerative Combinatorics 7: Group actions Peter J. Cameron Autumn 2013 How many ways can you colour the faces of a cube with three colours? Clearly the answer is 3 6 = 729. But what if we regard two colourings
More informationarxiv: v1 [cs.dm] 25 Jun 2016
A permutation code preserving a double Eulerian bistatistic Jean-Luc Baril and Vincent Vajnovszki LEI, Université de Bourgogne Franche-Comté BP, Dijon Cedex, France {barjl}{vvajnov}@u-bourgogne.fr arxiv:.v
More informationLinked Partitions and Linked Cycles
Linked Partitions and Linked Cycles William Y. C. Chen 1,4, Susan Y. J. Wu 2 and Catherine H. Yan 3,5 1,2,3 Center for Combinatorics, LPMC Nankai University, Tianjin 300071, P. R. China 3 Department of
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
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 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 information