A Combinatorial Proof of the Recurrence for Rook Paths
|
|
- Milton Watts
- 5 years ago
- Views:
Transcription
1 A Combinatorial Proof of the Recurrence for Rook Paths Emma Yu Jin and Markus E. Nebel Department of Computer Science niversity of Kaiserslautern, Germany Submitted: Feb 23, 2012; Accepted: Mar 5, 2012; Published: Mar 19, 2012 Mathematics Subject Classifications: 05A19, 68R05 Abstract Let a n count the number of 2-dimensional rook paths R n,n from (0, 0) to (2n, 0). Rook paths R m,n are the lattice paths from (0, 0) to (m+n, m n) with allowed steps (x, x) and (y, y) where x, y N +. In answer to the open question proposed by M. Erickson et al. (2010), we shall present a combinatorial proof for the recurrence of a n, i.e., (n + 1)a n+1 + 9(n 1)a n 1 = 2(5n + 2)a n with initial conditions a 0 = 1 and a 1 = 2. Furthermore, our proof can be extended to show the recurrence for the number of multiple Dyck paths d n, i.e., (n + 2)d n+1 + 9(n 1)d n 1 = 5(2n + 1)d n with d 0 = 1 and d 1 = 1, where d n = N n (4) and N n (x) is Narayana polynomial. 1 Introduction The set of rook paths R m,n is given by all 2-dimensional lattice paths from (0, 0) to (m + n, m n) with allowed steps (x, x) and (y, y) where x, y N +. They owe their name to the following view: consider a rook placed on the lower left corner (0, 0) of a chess board of size m n. Then R m,n counts the number of ways the rook can reach the opposite corner if in each single step it can move an arbitrary number of squares in the horizontal or vertical direction. Generalizations to d-dimensional chess boards are available [3]. There the number of corresponding paths can also be interpreted as the number of ways a debitor can repay all of its d creditors if the extension of the chess board in dimension i equals the specific amount owing creditor i. The work of this author has been supported by the Alexander von Humboldt Foundation by a postdoctoral research fellowship. Author to whom correspondence should be addressed. the electronic journal of combinatorics 19 (2012), #P59 1
2 We set R m,n = a m,n and R n = R n,n for simplicity. M. Erickson et al. [1] gave the following generating function f(s, t) for the number of rook paths: f(s, t) = m 0,n 0 a m,n s m t n = (1 s)(1 t) 1 2(s + t) + 3st. (1) For the special case a n = a n,n the generating function f(x) = n 0 a nx n can be derived from eq. (1) by first substituting t = x and then finding the coefficient of s s0 using partial fractions and Laurent series [1, 6]. Explicitly, the double generating function f(s, t) is rational and it converges for sufficiently small s and t. As a result, f(x) = [s 0 ]F (s, x) s converges for x small. We shall fix a small x; then the series f(s, t), as a function of s, converges in some circle s = r > 0. According to the Cauchy integral theorem and the Residue theorem, we have f(x) = [s 0 ]f ( s, x ) = 1 s 2πi s =r f ( s, x ) ds s s = S 0 [ ( Res f s, x ) 1 ] s s where S 0 is the set of all the poles of 1f(s, x ) inside the circle s = r and for any pole s s s S 0, lim x 0 s = 0. Therefore we arrive at f(x) = S 0 Res = 1 2πi s =r [ ( f s, x ) 1 s s ] (1 s)(1 x) s ds 1 2(s + x ) + 3x s. s The only pole of 1f(s, x) approaching 0 as x 0 is at s s s 0 = 3x x2 10x + 1. Consequently, [ (1 s)(1 x f(x) = Res ) s s=s0 1 2(s + x) + 3x 1 ] ( + 1 s 2 = 1 ) 1 x 1 + (2) 2 1 9x s by taking the initial condition f(0) = 1 into account. The recurrence relation for a n = [x n ]f(x) can be derived from eq. (2)[1], i.e., a 0 = 1, a 1 = 2, a n = n + 1 2(5n + 2) a 9(n 1) n+1 + 2(5n + 2) a n 1. (3) The set of multiple Dyck paths MD n is given by the 2-dimensional lattice paths from (0, 0) to (2n, 0) with allowed steps (x, x) and (y, y) where x, y N + that never go below x-axis. MD n = d n. Similarly the generating function of d n is given by g(x) = d n x n = 1 ( x 1 ) (1 x)(1 9x), (4) x n 0 the electronic journal of combinatorics 19 (2012), #P59 2
3 and the recurrence for d n is d 0 = 1, d 1 = 1, d n = n + 2 5(2n + 1) d 9(n 1) n+1 + 5(2n + 1) d n 1. (5) In the next section we shall present the combinatorial proof of eq. (3). Eq. (5) follows analogously. Part of the proof employs the bijective proof of recurrence for Dyck paths [2, 5, 7]. Furthermore, we refer the readers to the related combinatorial proof of some famous numbers, like the recurrence for the Delannoy numbers was proved bijectively by P. Peart et al.[4], the recurrence for the large Schröder numbers was shown by Foata et al.[2], and R.A. Sulanke [7] independently. 2 The Main Proof We can represent each rook path by the combination of (i.e., up-step) and D (i.e., down-step) with multiplicities. Accordingly, let i = (resp. D }{{} i = D D) be a }{{} i-times i-times single up-step (resp. down-step) of length i (the underline is used to represent the step s atomicity). For our proof we will count the occurrence of, D, D and DD ignoring the underlines. Let S 1 S 2 (S 1 S 2 ) denote the steps S 1 S 2 above x-axis (resp. below x-axis) where S i {, D} for i = 1, 2 subject to the condition that the y-the coordinates of both, the start point and the end point of S 1, are non-negative (resp. non-positive). Let m 11 count the occurrence of and DD, m 22 count the occurrence of DD and, m 12 count the occurrence of D and D, and m 21 count the occurrence of D and D. For example, m 11, m 12, m 21, m 22 of the rook path DDDDDD is 4, 3, 0, 4. i,j=1,2 m ij = 2n 1 holds for each path M R n. Here is the sketch of the idea of the combinatorial proof. (n+1)a n+1 counts the family of rook paths R n+1 having one unit -step labeled with z, denoted by ( z, R n+1 ). In Lemma 1 we focus on the map from ( z, R n+1 ) to (s x, R n, {a, b}) with multiplicity on each patten x, x and D x D, D x D, and x D, D x. In Lemma 2, 3(n 1)a n 1 counts the family of ( z, R n 1, [i, j]) where [i, j] = [1, 2], [2, 1], [2, 2] and having one unit -step labeled with z, accordingly we present map from ( z, R n 1, [i, j]) where [i, j] = [1, 2], [2, 1], [2, 2] to ( x, R n, {s, t}) with multiplicity on each pattern s x and s x D for s = or D. Lemma 1. For each M R n, let m 11 count the occurrence of and DD, m 22 count the occurrence of DD and, m 12 count the occurrence of D and D, and m 21 count the occurrence of D and D. Then for a n+1 = R n+1 we have (n + 1)a n+1 = M R n 5(m 11 + m 21 ) + 8m m (6) the electronic journal of combinatorics 19 (2012), #P59 3
4 Proof. Let F n be the family of free Dyck paths, i.e., the lattice paths from (0, 0) to (2n, 0) with allowed steps (1, 1) and (1, 1), and pair ( z, F n+1 ) be the set of paths F n+1 having one of the unit up-steps labeled with z. Tuple (s x, F n, {a, b}) represents the set of paths F n having one of the unit steps s ( or D) labeled with x, or having nothing labeled. We set f i (F n ) = f(s x, F n, {i}) for i = a, b. In the sequel we will construct a bijection f : (s x, F n, {a, b}) ( z, F n+1 ). Case 1: (s x, F n, {a}): For the paths having labeling as P 1 = s x F n, we set f a (P 1 ) = s z D F n+1 if s is above x-axis, otherwise f a (P 1 ) = sd z F n+1. For the paths without labeling as P 2 we have f a (P 2 ) = z DP 2. x-axis, a: x D x x-axis, a: z f a D z D D f a f a D x D x f a D z D z For step s, we define the level of the step s, denoted by l 1 (s) as the y-th coordinates of its final point. Case 2: (s x, F n, {b}) and l 1 (s x ) 0: For an arbitrary path P 1 = s x (s x, F n ) and l 1 (s x ) > 0, let s be the first -step preceding s for which l 1 ( s ) = l 1 (s) and let D s be the first D-step that follows s such that l 1 (D s ) = l 1 (s) 1. Note that s = s if s is a -step. As a result, we can write P 1 = s s x RD s where R is the Dyck path between s x and D s. Then f b (P 1 ) = z s srdd s F n+1. x f b z D D D x D f b D z D D Similarly, for the paths P 2 = s x F n and l 1 (s) < 0, let s be the first -step after s for which l 1 ( s ) = l 1 (s) + 1 and let D s be the first D-step preceding s such the electronic journal of combinatorics 19 (2012), #P59 4
5 that l 1 (D s ) = l 1 (s). Note that D s = s if s is a D-step. As a result, we can write P 2 = D s s x R s where R is the Dyck path between s x and s. Then f b (P 2 ) = D s sdr z s F n+1. x-axis: D x f b D x f b D D z D z Case 3: (, F n, {b}) or (s x, F n, {b}) and l 1 (s) = 0: In the former case, let P 1 F n, f b (P 1 ) = D z P 1. In the later case, if P 2 = D x then f b (P 2 ) = DD z holds, if P 3 = x then f b (P 3 ) = z D. We omit the proof that the map f is bijective since that proof follows similarly to that for Dyck paths [2, 5, 7]. The next step we shall extend f 1 to the map g : ( z, R n+1 ) (s x, R n, {a, b}) by allowing the atomic up step and down step to be of arbitrary length, according to which g is surjective but not injective. We start from studying the number of labeled paths in ( z, R n+1 ) induced by f(s x, R n, {a, b}) via integrating the newly added 2-steps to the paths in R n. Case 1: (, R n, {a, b}): W.l.o.g. we assume path p 1 = m p 0 R n where the first step of p 1 is -step of length m (m 1). Then f a (p 1 ) = z D m p 0 and f b (p 1 ) = D z m p 0. D z m p 0 ( z, R n+1 ) is obtained by gluing z and m (m 1), therefore we set g( z, z D m p 0 ) = (, p 1, {a}), g( z, D z m p 0 ) = g( z, D z m p 0 ) = (, p 1, {b}). For each image (, p 1 ) (, R n ) by map g, there are three preimages in ( z, R n+1 ) such that the first unit -step is labeled with z, which has cardinality 3a n. Case 2: (s x, R n, {a, b}) and s is the last unit step: W.l.o.g. we assume path p 2 = D x. Then f a (p 2 ) = D z D and f b (p 2 ) = DD z. DD z ( z, R n+1 ) is obtained by gluing two D-steps, therefore we set g( z, D z D) = (D x, p 2, {a}), g( z, DD z ) = g( z, DD z ) = (D x, p 2, {b}). For each image (s x, p 2 ) (s x, R n ) by map g, there are three preimages in ( z, R n+1 ) such that the last unit -step is labeled with z, which has cardinality 3a n. In what follows we consider all the possible scenarios for s x Y P where Y is the step immediately following s x for an arbitrary but fixed path p R n. the electronic journal of combinatorics 19 (2012), #P59 5
6 Let represent xor, i.e., the two exclusive cases of either an atomic up-step of length two or of two up-steps which for sure belong to two different atomic up-steps. For a multiple Dyck path A that has a t-step of length m 1 as its first atomic step and s-step of length m 2 as its last atomic step, i.e., A = t m 1 A s m 2 where t =, s = D or t = D, s = and m 1, m 2 1, we set tas = t m 1+1 A s m 2 s tas = t m 1+1 A s m 2+1 tas = tt m 1 A s m 2+1 tas = tt m 1 A s m 2 s ta s = tas xor tas t As = tas xor tas Case 3: x : Let p 3 = x, then f a (p 3 ) = z D and recall that D x is the step that after x for which l 1 ( x ) = l 1 (D x) + 1. Let A x 1 (resp. A 1 ) be the sub multiple Dyck paths from x to D x with (resp. without) labeling x, then we can assume p 3 = A x 1, and therefore f b (p 3 ) = z A 1 D. By setting g( z, z D ) = ( x, p 3, {a}) xor g( z, z D ) = ( x, p 3, {a}), g( z, z A 1 D ) = g( z, z A 1 D ) = ( x, p 3, {b}), g( z, z A 1 D ) = g( z, z A 1 D ) = ( x, p 3, {b}), all the five preimages in ( z, R n+1 ) are mapped by g to ( x, R n, {a, b}). We name the active point to be the point that connects two S-steps (S = or D) as SS or SS, Furthermore, the hollow circled dot represents the point that connects one of the patterns from {SS, SS} exclusively. The figure below shows the images ( x, p 3, {a, b}) representing the active points by big black dots. x a g z b g D x D x A x z A 1 1 Case 4: x D : Let p 4 = x D, then f a (p 4 ) = z DD and f b (p 4 ) = the electronic journal of combinatorics 19 (2012), #P59 6
7 z DD holds. Accordingly we set g( z, z DD ) = g( z, z DD ) = ( x D, p 4, {a}), g( z, z DD ) = g( z, z DD ) = ( x D, p 4, {a}), g( z, z DD ) = g( z, z DD ) = ( x D, p 4, {b}), g( z, z DD ) = g( z, z DD ) = ( x D, p 4, {b}). Every eight preimages in ( z, R n+1 ) are mapped by g to one image ( x D, p 4, {a, b}). z a x g b x g z Case 5: D x : First we discuss the subcase in which D x touches the x-axis, i.e., l 1 (D x ) = 0, and is followed by -step. Let p 5 = D x, then f a (p 5 ) = D z D and f b (p 5 ) = DD z hold. Thus, we set g( z, D z D ) = (D x, p 5, {a}), g( z, DD z ) = g( z, DD z ) = (D x, p 5, {b}), g( z, DD z ) = g( z, DD z ) = (D x, p 5, {b}). Next we study the subcase in which D x is above x-axis. Let p 5 = D x, then f a (p 5 ) = D z D holds. Let D D x be the first step after D x such that l 1 (D x ) = l 1 (D D x) + 1. Let D x be the first step preceding D x such that l 1 ( D x) = l 1 (D x ). Then we assume A x 2 (resp. A z 2) is the path from D x to D x with labeling D x (resp. D z = z ) x and A 3 is the path from the end of D x to D D x. Therefore we can interpret p 5 as p 5 = A x 2A 3, and f b (p 5 ) = A z 2A 3 D. Thus, we set g( z, D z D ) = (D x, p 5, {a}), g( z, A z 2A 3 D ) = g( z, A z 2A 3 D ) = (D x, p 5, {b}), g( z, A z 2A 3 D ) = g( z, A z 2A 3 D ) = (D x, p 5, {b}). In both cases, every five preimages in ( z, R n+1 ) are mapped by g to one image in (D x, R n, {a, b}). D x a D x b A x 2 A 3 g g D z D A 3 D z D D x A z 2 the electronic journal of combinatorics 19 (2012), #P59 7
8 Case 6: D x D : First we discuss the subcase in which D x touches the x-axis, i.e., l 1 (D x ) = 0, and is followed by a D-step. Let p 5 = D x D, then f a (p 5 ) = D z DD and f b (p 5 ) = DD z D. We set g( z, D z DD ) = (D x D, p 5, {a}) g( z, D z DD ) = (D x D, p 5, {a}), g( z, DD z D ) = (D x D, p 5, {b}) g( z, DD z D ) = (D x D, p 5, {b}). xor xor Next we study the subcase that D x is above x-axis. For p 6 = D x D, f a (p 6 ) = D z D D holds. Let D x be the first step preceding D x such that l 1 ( D x) = l 1 (D x ). Then we follow the assumption of A x 2 and A z 2 in Case 5, and represent p 6 as p 6 = A x 2 D, therefore f b (p 6 ) = A z 2D D. Consequently, by setting g( z, D z DD ) = (D x D, p 6, {a}) g( z, D z DD ) = (D x D, p 6, {a}), g( z, A z 2DD ) = (D x D, p 6, {b}) g( z, A z 2DD ) = (D x D, p 6, {b}), xor xor every two preimages in ( z, R n+1 ) are mapped by g to one image in (D x D, R n, {a, b}). D x a g z D x b g z For those labeled step s x Y, the case discussion follows similarly. To sum up, for each path p R n, the number of paths in ( z, R n+1 ) resulted from p is 5(m 11 + m 21 ) + 8m m Hence eq. (6) follows and the proof is complete. Lemma 2. nder the assumption of Lemma 1 we have Proof. We shall construct the map M R n [(m 11 + m 21 ) + 2m 12 ] + 3(n 1)a n 1 = 2na n (7) µ : ( x D x, R n ) ( x D, R n, {a, b}) (D x D x D, R n ) (D x, R n, {a, b}) ( x, R n 1, {[1, 2], [2, 1], [2, 2]}) ( z, R n, {s, t}). Note that (D x D x D, R n ) and (D x, R n, {a, b}) are the mirror images of ( x D x, R n ) and ( x D, R n, {a, b}) under reflection K : y = 0, i.e., for a ( x D x, R n ), then K(a) (D x D x D, R n ) and g(k(a)) = K(g(a)), for which we omit the case discussion for (D x D x D, R n ) and (D x, R n, {a, b}). the electronic journal of combinatorics 19 (2012), #P59 8
9 Case 1: For w 1 ( x, R n ) or w 1 ( x D, R n, {a, b}), µ simply replaces the labeling x with z, i.e., µ( x, w 1 ) = ( z, w 1, s) and µ( x D, w 1, a) = ( z D, w 1, s), µ( x D, w 1, b) = ( z D, w 1, t). Case 2: w 2 (D x, R n ): Let x be the first -step preceding D x such that l 1 ( x ) = l 1 (D x ) + 1. Similarly, let D be the first D-step that follows and for which l 1 () = l 1 (D ) + 1 holds. We assume A x 4 (resp. A 4 ) is the path from x to D x with (resp. without) labeling x, and A 5 is the path from the end of to D. Then we consider path w 2 = A x 4 A 5, µ(w 2 ) = ( z, z A 4 A 5, t). We observe that in the case A 5 D, µ is a one-to-one correspondence. In the case A 5 = D, three patterns are missing from ( z, R n, t), i.e., ( z A 4 A 5, t), ( z A 4 A 5, t) and ( z A 4 A 5, t). Case 3 will make up for this. A µ D B A D x B z D Case 3: w 3 ( x, R n 1, {[1, 2], [2, 1], [2, 2]}): If x R n 1 (thus w 3 = x A D in which A is a multiple Dyck path (can be )), then we set µ(w 3, [2, 1]) = ( z, z A DD, t) µ(w 3, [1, 2]) = ( z, z A DD, t) µ(w 3, [2, 2]) = ( z, z A DD, t), which make up three other possible patterns in Case 2. It remains to prove the map µ is bijective. Note the union of the image set for these 3 cases is exactly the set ( z, R n, {s, t}) and µ is injective by construction. Consequently, eq. (7) holds. Theorem 3. Let a n denote the number of 2-dimensional rook paths from (0, 0) to (2n, 0). Then the recurrence of a n is given by a 0 = 1, a 1 = 2, a n = n + 1 2(5n + 2) a 9(n 1) n+1 + 2(5n + 2) a n 1. (8) Proof. In combination of Lemma 1 and Lemma 2, we obtain (n + 1)a n+1 + 9(n 1)a n 1 = 2(2n 1) = 2(5n + 2)a n, with initial condition a 0 = 1 and a 1 = 2. M R n [(m 11 + m 21 ) + 2m 12 ] + 9(n 1)a n 1 the electronic journal of combinatorics 19 (2012), #P59 9
10 The combinatorial proof for the recurrence of rook paths can also be extended to the combinatorial proof for the recurrence of multiple Dyck paths. Eq. (5) follows according to the lemmas below. Lemma 4. For each M D n, let n 11, n 12, n 21, n 22 count the occurrence of, D, D and DD. Then for d n+1 = D n+1 we have (n + 2)d n+1 = M MD n 5(n 11 + n 21 ) + 8n n 22. (9) Lemma 5. nder the assumptions of Lemma 4 we have References M MD n 2n (n 1)d n 1 = (n + 1)d n. (10) [1] M. Erickson, S. Fernando and K. Tran. Enumerating rook and Queen paths. Bull. Inst. Combin. Appl., 60:37-48, [2] D. Foata and D. Zeilberger. A classic proof of a recurrence for a very classical sequence. J. Comb. Theor., Ser. A., 80: , [3] M. Kauers and D. Zeilberger. The computational challenge of enumerating highdimensional rook walks, arxiv: v1 [math.co] 21 Nov [4] P. Peart and W. J. Woan. A bijective proof of the delannoy recurrence. Proceeding of the Thirty-third Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL), 158: Congressus Numerantium, [5] J-L. Rémy. n procédé itératif de dénombrement d arbres binaires et son application à leur génération aléatpoire. RAIRO Inform. Théor., 19: , [6] R.P. Stanley. Enumerative Combinatorics (Vol.2). Cambridge niversity Press, New York, [7] R.A. Sulanke. Bijective Recurrences concerning Schröder paths. Electron. J. Combin., 5:#R47, the electronic journal of combinatorics 19 (2012), #P59 10
Motzkin 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 informationSpanning Trees in Grid Graphs
Spanning Trees in Grid Graphs Paul Raff arxiv:0809.2551v1 [math.co] 15 Sep 2008 July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid
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 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 informationTHE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 163 178 DOI: 10.5644/SJM.13.2.04 THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE FENG-ZHEN ZHAO Abstract. In this
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 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 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 informationSequences that satisfy a(n a(n)) = 0
Sequences that satisfy a(n a(n)) = 0 Nate Kube Frank Ruskey October 13, 2005 Abstract We explore the properties of some sequences for which a(n a(n)) = 0. Under the natural restriction that a(n) < n the
More informationA weighted interpretation for the super Catalan numbers
A weighted interpretation for the super Catalan numbers ariv:1403.5246v2 [math.co] 26 Aug 24 Emily Allen Irina Gheorghiciuc Abstract The super Catalan numbers T (m, n) = (2m)!(2n)!/2m!n!(m+n)! are integers
More informationHigher Dimensional Lattice Chains and Delannoy Numbers
Linfield College DigitalCommons@Linfield Faculty Publications Faculty Scholarship & Creative Works -- Higher Dimensional Lattice Chains and Delannoy Numbers John S Caughman Portland State University Charles
More informationOn the log-convexity of combinatorial sequences arxiv:math/ v3 [math.co] 27 Nov 2006
On the log-convexity of combinatorial sequences arxiv:math/0602672v3 [math.co] 27 Nov 2006 Lily L. Liu, Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, PR China
More informationarxiv: v1 [math.co] 28 Feb 2012
Computational and Theoretical Challenges On Counting Solid Standard Young Tableaux Shalosh B. EKHAD and Doron ZEILBERGER 1 Very Important: This article is accompanied by the Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/solidsyt.
More informationCatalan numbers Wonders of Science CESCI, Madurai, August
Catalan numbers Wonders of Science CESCI, Madurai, August 25 2009 V.S. Sunder Institute of Mathematical Sciences Chennai, India sunder@imsc.res.in August 25, 2009 Enumerative combinatorics Enumerative
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 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 informationCounting Peaks and Valleys in a Partition of a Set
1 47 6 11 Journal of Integer Sequences Vol. 1 010 Article 10.6.8 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
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationEnumeration of Chord Diagrams without Loops and Parallel Chords
Enumeration of Chord Diagrams without Loops and Parallel Chords Evgeniy Krasko Alexander Omelchenko St. Petersburg Academic University 8/3 Khlopina Street, St. Petersburg, 9402, Russia {krasko.evgeniy,
More informationA Solution to the Checkerboard Problem
A Solution to the Checkerboard Problem Futaba Okamoto Mathematics Department, University of Wisconsin La Crosse, La Crosse, WI 5460 Ebrahim Salehi Department of Mathematical Sciences, University of Nevada
More informationDescents in Parking Functions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.3 Descents in Parking Functions Paul R. F. Schumacher 1512 Oakview Street Bryan, TX 77802 USA Paul.R.F.Schumacher@gmail.com Abstract
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 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 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 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 informationarxiv: v1 [math.nt] 4 Mar 2014
VARIATIONS ON A GENERATINGFUNCTIONAL THEME: ENUMERATING COMPOSITIONS WITH PARTS AVOIDING AN ARITHMETIC SEQUENCE arxiv:403.0665v [math.nt] 4 Mar 204 MATTHIAS BECK AND NEVILLE ROBBINS Abstract. A composition
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 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 informationarxiv: v1 [math.co] 17 Dec 2007
arxiv:07.79v [math.co] 7 Dec 007 The copies of any permutation pattern are asymptotically normal Milós Bóna Department of Mathematics University of Florida Gainesville FL 36-805 bona@math.ufl.edu Abstract
More informationINEQUALITIES OF SYMMETRIC FUNCTIONS. 1. Introduction to Symmetric Functions [?] Definition 1.1. A symmetric function in n variables is a function, f,
INEQUALITIES OF SMMETRIC FUNCTIONS JONATHAN D. LIMA Abstract. We prove several symmetric function inequalities and conjecture a partially proved comprehensive theorem. We also introduce the condition of
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 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 informationbesides your solutions of these problems. 1 1 We note, however, that there will be many factors in the admission decision
The PRIMES 2015 Math Problem Set Dear PRIMES applicant! This is the PRIMES 2015 Math Problem Set. Please send us your solutions as part of your PRIMES application by December 1, 2015. For complete rules,
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationWeak Separation, Pure Domains and Cluster Distance
Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,
More informationA Simple Proof of the Aztec Diamond Theorem
A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu Department of Applied Mathematics National University of Kaohsiung Kaohsiung 811, Taiwan, ROC speu@nuk.edu.tw Tung-Shan Fu Mathematics Faculty National
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 informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
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 informationOn the size of Kakeya sets in finite vector spaces
On the size of Kakeya sets in finite vector spaces Gohar Kyureghyan Institute of Algebra and Geometry Otto-von-Guericke University Magdeburg 9106 Magdeburg, Germany gohar.kyureghyan@ovgu.de Peter Müller
More informationOn the maximum number of isosceles right triangles in a finite point set
On the maximum number of isosceles right triangles in a finite point set Bernardo M. Ábrego, Silvia Fernández-Merchant, and David B. Roberts Department of Mathematics California State University, Northridge,
More informationAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern D. Merlini and R. Sprugnoli Dipartimento di Sistemi e Informatica viale Morgagni 65, 5034, Firenze, Italia merlini@dsi.unifi.it,
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 informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
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 informationCovering a Chessboard with Staircase Walks
Covering a Chessboard with Staircase Walks Eyal Ackerman Rom Pinchasi July 22, 2013 Abstract An ascending (resp., descending) staircase walk on a chessboard is a rook s path that goes either right or up
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
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 informationA LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH
Volume 10, Number, Pages 5 56 ISSN 1715-0868 A LOWER BOUND FOR RADIO k-chromatic NUMBER OF AN ARBITRARY GRAPH SRINIVASA RAO KOLA AND PRATIMA PANIGRAHI Abstract Radio k-coloring is a variation of Hale s
More informationApplications of Chromatic Polynomials Involving Stirling Numbers
Applications of Chromatic Polynomials Involving Stirling Numbers A. Mohr and T.D. Porter Department of Mathematics Southern Illinois University Carbondale, IL 6290 tporter@math.siu.edu June 23, 2008 The
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 informationAn enumeration of equilateral triangle dissections
arxiv:090.599v [math.co] Apr 00 An enumeration of equilateral triangle dissections Aleš Drápal Department of Mathematics Charles University Sokolovská 83 86 75 Praha 8 Czech Republic Carlo Hämäläinen Department
More informationEnumerating multiplex juggling patterns
Enumerating multiplex juggling patterns Steve Butler Jeongyoon Choi Kimyung Kim Kyuhyeok Seo Abstract Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATH OPTION, Spring 018 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 0 points.
More informationPartitions with Fixed Number of Sizes
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 18 (015), Article 15.11.5 Partitions with Fixed Number of Sizes David Christopher Department of Mathematics The American College Madurai Tamil Nadu India
More informationA combinatorial interpretation of the $^{\star}_{g}(n)$ coefficients
Syddansk Universitet A combinatorial interpretation of the $^{\star}_{g}(n)$ coefficients Li, Thomas Jiaxian; M. Reidys, Christian Published in: S I A M Journal on Discrete Mathematics Publication date:
More informationSELF-AVOIDING WALKS AND FIBONACCI NUMBERS. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA
SELF-AVOIDING WALKS AND FIBONACCI NUMBERS Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA 91711 benjamin@hmc.edu Abstract. By combinatorial arguments, we prove that the number
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationA Combinatorial Approach to Finding Dirichlet Generating Function Identities
The Waterloo Mathematics Review 3 A Combinatorial Approach to Finding Dirichlet Generating Function Identities Alesandar Vlasev Simon Fraser University azv@sfu.ca Abstract: This paper explores an integer
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
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 informationAnimals and 2-Motzkin Paths
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 8 (2005), Article 0556 Animals and 2-Motzkin Paths Wen-jin Woan 1 Department of Mathematics Howard University Washington, DC 20059 USA wwoan@howardedu
More informationCatalan numbers and power laws in cellular automaton rule 14
November 7, 2007 arxiv:0711.1338v1 [nlin.cg] 8 Nov 2007 Catalan numbers and power laws in cellular automaton rule 14 Henryk Fukś and Jeff Haroutunian Department of Mathematics Brock University St. Catharines,
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationA Recursive Relation for Weighted Motzkin Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.6 A Recursive Relation for Weighted Motzkin Sequences Wen-jin Woan Department of Mathematics Howard University Washington, D.C. 0059
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationDiscrete Mathematics 2007: Lecture 5 Infinite sets
Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for
More informationENUMERATIVE APPLICATIONS OF SYMMETRIC FUNCTIONS. Ira M. GESSEL 1
Publ. I.R.M.A. Strasbourg, 1987, 229/S 08 Actes 17 e Séminaire Lotharingien, p. 5-21 ENUMERATIVE APPLICATIONS OF SYMMETRIC FUNCTIONS BY Ira M. GESSEL 1 1. Introduction. This paper consists of two related
More informationThe game of plates and olives
The game of plates and olives arxiv:1711.10670v2 [math.co] 22 Dec 2017 Teena Carroll David Galvin December 25, 2017 Abstract The game of plates and olives, introduced by Nicolaescu, begins with an empty
More informationProof of a generalization of Aztec diamond theorem
Proof of a generalization of Aztec diamond theorem Institute for Mathematics and its Applications University of Minnesota Minneapolis, MN 55455 December 5, 2014 Aztec Diamond Theorem Definition The Aztec
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 informationSolving an arbitrary permutation puzzle
T.C. Brouwer Solving an arbitrary permutation puzzle Bachelor thesis, June 18, 2016 Supervisor: Dr. R.M. van Luijk Mathematisch Instituut, Universiteit Leiden Contents 1 Introduction 2 Mathematical formulation
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 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 informationTESTING FOR A SEMILATTICE TERM
TESTING FOR A SEMILATTICE TERM RALPH FREESE, J.B. NATION, AND MATT VALERIOTE Abstract. This paper investigates the computational complexity of deciding if a given finite algebra is an expansion of a semilattice.
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 informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More informationProjective Spaces. Chapter The Projective Line
Chapter 3 Projective Spaces 3.1 The Projective Line Suppose you want to describe the lines through the origin O = (0, 0) in the Euclidean plane R 2. The first thing you might think of is to write down
More informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
More informationExtensions of edge-coloured digraphs
Proceedings of the 10th WSEAS International Confenrence on APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 395 Extensions of edge-coloured digraphs HORTENSIA GALEANA-SÁNCHEZ Instituto de Matemáticas
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 informationTrivial Meet and Join within the Lattice of Monotone Triangles
Trivial Meet and Join within the Lattice of Monotone Triangles John Engbers Adam Hammett July 17, 2014 Abstract The lattice of monotone triangles (M n, ) ordered by entry-wise comparisons is studied. Let
More informationIra M. Gessel Department of Mathematics, Brandeis University, P.O. Box 9110, Waltham, MA Revised September 30, 1988
GENERALIZED ROOK POLYNOMIALS AND ORTHOGONAL POLYNOMIALS Ira M. Gessel Department of Mathematics, Brandeis University, P.O. Box 9110, Waltham, MA 02254-9110 Revised September 30, 1988 Abstract. We consider
More informationA brief overview of the sock matching problem
A brief overview of the sock matching problem Bojana Pantić a, Olga Bodroˇza-Pantić a arxiv:1609.08353v1 [math.co] 7 Sep 016 a Dept. of Math. & Info., Faculty of Science, University of Novi Sad, Novi Sad,
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationThe number of Euler tours of random directed graphs
The number of Euler tours of random directed graphs Páidí Creed School of Mathematical Sciences Queen Mary, University of London United Kingdom P.Creed@qmul.ac.uk Mary Cryan School of Informatics University
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 informationFrom alternating sign matrices to Painlevé VI
From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July
More informationarxiv: v1 [math.co] 22 Oct 2007
CROSSINGS AND NESTINGS IN TANGLED-DIAGRAMS arxiv:0710.4053v1 [math.co] 22 Oct 2007 WILLIAM Y. C. CHEN, JING QIN AND CHRISTIAN M. REIDYS Abstract. A tangled-diagram is graph of degree less than two whose
More informationarxiv: v2 [math.co] 26 Mar 2016
A new bijection on m-dyck paths with application to random sampling arxiv:603.06290v2 [math.co] 26 Mar 206 Axel Bacher September 5, 208 Abstract We present a new bijection between variants of m-dyck paths
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 information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationCOMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS
COMPOSITIONS PARTITIONS AND FIBONACCI NUMBERS ANDREW V. SILLS Abstract. A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions
More information