DOCSLIB.ORG

On Some Properties of Narayana Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

PROTEUS JOURNAL ISSN/eISSN: 0889-6348 On Some Properties of Narayana Numbers Dr. R. Sivaraman Associate Professor, Department of Mathematics, D. G. Vaishnav College, Chennai, India National Awardee for popularizing mathematics among masses Email: [email protected] Abstract Among several classes of numbers that exist in mathematics, Narayana numbers plays a significant role especially in several problems of combinatorics. In this paper, we will introduce Narayana Numbers through coefficients similar to binomial coefficients and prove that sums of row entries of Narayana triangle are precisely the well known Catalan numbers. Some of the interesting combinatorial properties concerning with Narayana numbers were discussed in this paper. This will add more insight about such numbers and will reach wider research audience. Keywords: Narayana Numbers, Triangular Numbers, Factorials, Narayana Triangle, Catalan Numbers. 1. Introduction Pascal and other notable mathematicians investigated Pascal’s triangle using binomial coefficients for natural numbers. During 1970’s mathematicians like Hansell and Hoggatt generalized the concept of binomial coefficients for triangular numbers. They proved that such numbers are always positive integers. Narayana numbers were first studied by famous British Combinatorist Percy Alexander Macmahon during 1915 and 1916. During 1955, Indian origin Canadian mathematician Tadepalli Venkata Narayana identified as T.V. Narayana rediscovered the Narayana numbers through the construction of a triangle named after him as Narayana triangle. This paper provides some of the interesting properties of Narayana numbers. We will first begin with some definitions. 2. Definitions 2.1 The triangular numbers are numbers which are sum of consecutive natural numbers. They form a special case of more general class of numbers called figurate numbers. The nth triangular n( n 1) number is given by t1 2 3 n (2.1) n 2 2.2 The numbers formed through two integers n and r where n0,0 r n given by the n n! expression (2.2) are called binomial coefficients. They are called so because r r! ( nr )! these numbers form the coefficients of the binomial expansion (a b )n . VOLUME 11 ISSUE 8 2020 http://www.proteusresearch.org/ Page No: 8 PROTEUS JOURNAL ISSN/eISSN: 0889-6348 2.3 The numbers formed through two integers integers n and r where n0,0 r n given by the n t ! expression n (2.3) where t is the nth triangular number is defined in (2.1) and n r tr! t nr ! tn ! is the factorial of the nth triangular number tn . In particular, the factorial of the nth triangular number tn is given by ttttn! n n1 n 2 ttt 3 2 1 (2.4) .We assume that t0 ! 1similar to n n 0! 1. With this convention, from (2.3), we get 1. 0 n Note that equation (2.4) is a direct analogue of usual factorial which is product of first n natural numbers. We also see that equation (2.3) in a sense acts like a binomial coefficient for triangular n numbers. We call numbers generated through (2.3) of the form as Narayana numbers. r 1 2n 2.4 The nth Catalan number is given by the expression Cn (2.5) n 1n 3. Theorem 1 n n1 n n 1 The Narayana numbers are given by (3.1) r rn r 1 rr 1 Proof: By definition (2.3), we have n tn! ttt nrnr ! 1 nr 2 tttt n 1 nnn 1 tt nr 2 nr 1 r ttrnr!! tt rnr !! tttt rr 1 2 1 (nnnn 1) ( 1) ( nr 2)( nr 1) 2 2 2 (r 1) rrr ( 1) 3 2 2 1 2 2 2 2 (nnn 1)2 ( 1) 2 ( nr 2) 2 ( nr 1) (r 1) rr2 ( 1) 2 3 2 2 2 1 2 (1)n nn (1) ( nr 2)( nr 1) nn (1) ( nr 2)( nr 1) 1 (1)(1)rrr 321 rr (1) 321 nr 1 n1 n 1 . r1 r n r 1 n1 n n 1 Thus, as required. This completes the proof. rn r 1 rr 1 VOLUME 11 ISSUE 8 2020 http://www.proteusresearch.org/ Page No: 9 PROTEUS JOURNAL ISSN/eISSN: 0889-6348 n We notice that equation (3.1) provides an explicit formula for Naryana numbers of the form r n n in terms of the binomial coefficients . Some authors call as Tribinomial coefficients r r since they represent binomial coefficients analogue of triangular numbers. We further know that nn n 1 the binomial coefficients satisfy the recurrence relation . The Narayana numbers rr r 1 also satisfy the same relation which we will prove through following theorem. 3.1 Theorem 1 (Recurrence Relation of Narayana Numbers) n ntn n 1 The Narayana numbers satisfy the recurrence relation (3.2) r rtr r 1 Proof: Using equations (2.3) and (2.4), we have n tn! t n ! tr t r r ttrnr!! tt r 1 !! nr tn1 ! n 1 tn t n tr1 ! t nr ! r 1 This proves (3.2) and thus completes the proof. 4. Narayana Triangle n We denote the Narayana numbers by N(n,r). We now try to construct a triangle which we r call Narayana Triangle whose entries are N(n,r), where n is any non-negative integer and r = 1,2,3,…,n. Thus, the entries of the Narayana triangle are zero for r > n. n 0 For the first row, if n = 0, then r = 0 is the only choice and 1 Hence the first row r 0 entry of Narayana triangle is just 1. 1 11 1 2 For the second row, if n = 1 then r = 0,1. Hence by (3.1), we have 1 and 1 0 11 1 2 So the second row entries of Narayana triangle are 1, 1. VOLUME 11 ISSUE 8 2020 http://www.proteusresearch.org/ Page No: 10 PROTEUS JOURNAL ISSN/eISSN: 0889-6348 2 21 2 3 For the third row, if n = 2, then r = 0, 1, 2. Hence by (3.1), we have 1, 3 0 12 1 2 2 and 1. Hence the third row entries of Narayana triangle are 1, 3, 1. 2 3 For the fourth row, if n = 3, then r = 0, 1, 2, 3. Hence by (3.1), we have 1, 0 31 3 4 3 1 3 4 3 6, 6, 1.Hence the fourth row entries of Narayana 13 1 2 2 2 2 3 3 triangle are 1, 6, 6, 1. Proceeding in this fashion, we get Narayana triangle displayed with first seven rows: Figure 1: Narayana Triangle The numbers forming the triangle when read from left to right row-wise gives 1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 1, 10, 20, 10, 1, 1, 15, 50, 50, 15, 1, . are called Narayana numbers. These numbers are obtained from (3.1). We can notice many similarities between Pascal’s triangle and Narayana n n triangle. For example, since 1 each row of Narayana triangle (except the first) begin 0 n and end with 1 like in Pascal’s triangle. We knew that the entries of Pascal’s triangle are symmetrical about the vertical line through the middle. This is because of the fact that n n . Similarly, from Figure 1 we notice that the entries of Narayana triangle also r nr satisfy the same property. We will now prove this property formally through the following theorem. VOLUME 11 ISSUE 8 2020 http://www.proteusresearch.org/ Page No: 11 PROTEUS JOURNAL ISSN/eISSN: 0889-6348 4.1 Theorem 2 The entries of Narayana triangle are symmetrical about the central vertical line. n Proof: All we have to do is to show that for Narayana numbers of the form , we should have r n n (4.1) . Now by the generation of Narayana numbers presented in (3.1), we get r nr n1 n n1 1 n (n 1)! nrr1 nrnr 1 rnrr 1(1)!! r 1n (n 1)! 1 n n1 n nr1r ( nr )! ( r 1)! nr 1 rrr1 This completes the proof. Thus from Theorem 2, we see that the Narayana numbers lie symmetrically about the central vertical line formed by the numbers 1, 3, 20, 175, . .. (See Figure 1). We call the numbers 1, 3, 20, 175, . as Central Narayana numbers or Central Tribinomial coefficients. In the following property, we assure that all entries of Narayana triangle namely Narayana numbers are integers. Hence if we extend the rows of construction of Narayana triangle we are sure enough to get only particular positive integers. 4.2 Theorem 3 n The Narayana numbers are always positive integers. r Proof: We consider evaluating the following 2 × 2 determinant of binomial coefficients. n n r r 1 n n1 n n 1 n n 1 n r n n 1 n1 n 1 rr1 r 1 rrr 1 n r 1 rr 1 r r 1 1 n n1 n n r 1rr1 r Thus the Narayana numbers are precisely the determinant of four binomial coefficients which are integers. Since the determinant value of entries which are integers also result in an integer, it follows that the Narayana numbers are integers. Narayana numbers are positive because from VOLUME 11 ISSUE 8 2020 http://www.proteusresearch.org/ Page No: 12 PROTEUS JOURNAL ISSN/eISSN: 0889-6348 (3.1), they are product of three terms in which two are binomial coefficients which are positive 1 and third term which is also positive since 0r n . This completes the proof. n r 1 4.3 Getting one from another Since the entries of Pascal’s triangle are binomial coefficients, Theorem 3 provides a way of generating entries of Narayana triangle directly through the entries of Pascal’s triangle.
Recommended publications
  • Total Positivity of Narayana Matrices Can Also Be Obtained by a Similar Combinatorial Approach?

    Total Positivity of Narayana Matrices Can Also Be Obtained by a Similar Combinatorial Approach?

    Total positivity of Narayana matrices Yi Wanga, Arthur L.B. Yangb aSchool of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P.R. China bCenter for Combinatorics, LPMC, Nankai University, Tianjin 300071, P.R. China Abstract We prove the total positivity of the Narayana triangles of type A and type B, and thus affirmatively confirm a conjecture of Chen, Liang and Wang and a conjecture of Pan and Zeng. We also prove the strict total positivity of the Narayana squares of type A and type B. Keywords: Totally positive matrices, the Narayana triangle of type A, the Narayana triangle of type B, the Narayana square of type A, the Narayana square of type B AMS Classification 2010: 05A10, 05A20 1. Introduction Let M be a (finite or infinite) matrix of real numbers. We say that M is totally positive (TP) if all its minors are nonnegative, and we say that it is strictly totally positive (STP) if all its minors are positive. Total positivity is an important and powerful concept and arises often in analysis, algebra, statistics and probability, as well as in combinatorics. See [1, 6, 7, 9, 10, 13, 14, 18] for instance. n Let C(n, k)= k . It is well known [14, P. 137] that the Pascal triangle arXiv:1702.07822v1 [math.CO] 25 Feb 2017 1 1 1 1 2 1 P = [C(n, k)]n,k≥0 = 13 31 14641 . . .. Email addresses: [email protected] (Yi Wang), [email protected] (Arthur L.B. Yang) Preprint submitted to Elsevier April 12, 2018 is totally positive.
  • Entropoid Based Cryptography

    Entropoid Based Cryptography

    Entropoid Based Cryptography Danilo Gligoroski∗ April 13, 2021 Abstract The algebraic structures that are non-commutative and non-associative known as entropic groupoids that satisfy the "Palintropic" property i.e., xAB = (xA)B = (xB)A = xBA were proposed by Etherington in ’40s from the 20th century. Those relations are exactly the Diffie-Hellman key exchange protocol relations used with groups. The arithmetic for non-associative power indices known as Logarithmetic was also proposed by Etherington and later developed by others in the 50s-70s. However, as far as we know, no one has ever proposed a succinct notation for exponentially large non-associative power indices that will have the property of fast exponentiation similarly as the fast exponentiation is achieved with ordinary arithmetic via the consecutive rising to the powers of two. In this paper, we define ringoid algebraic structures (G, , ∗) where (G, ) is an Abelian group and (G, ∗) is a non-commutative and non-associative groupoid with an entropic and palintropic subgroupoid which is a quasigroup, and we name those structures as Entropoids. We further define succinct notation for non-associative bracketing patterns and propose algorithms for fast exponentiation with those patterns. Next, by an analogy with the developed cryptographic theory of discrete logarithm problems, we define several hard problems in Entropoid based cryptography, such as Discrete Entropoid Logarithm Problem (DELP), Computational Entropoid Diffie-Hellman problem (CEDHP), and Decisional Entropoid Diffie-Hellman Problem (DEDHP). We post a conjecture that DEDHP is hard in Sylow q-subquasigroups. Next, we instantiate an entropoid Diffie-Hellman key exchange protocol. Due to the non-commutativity and non-associativity, the entropoid based cryptographic primitives are supposed to be resistant to quantum algorithms.
  • Enumeration of Colored Dyck Paths Via Partial Bell Polynomials

    Enumeration of Colored Dyck Paths Via Partial Bell Polynomials

    Enumeration of Colored Dyck Paths Via Partial Bell Polynomials Daniel Birmajer, Juan B. Gil, Peter R. W. McNamara and Michael D. Weiner Abstract Weconsideraclassoflatticepathswithcertainrestrictionsontheirascents and down-steps and use them as building blocks to construct various families of Dyck paths. We let every building block Pj take on c j colors and count all of the resulting colored Dyck paths of a given semilength. Our approach is to prove a recurrence relation of convolution type, which yields a representation in terms of partial Bell polynomials that simplifies the handling of different colorings. This allows us to recover multiple known formulas for Dyck paths and related lattice paths in a unified manner. Keywords Colored Dyck paths Colored Dyck words Colored Motzkin paths Partial Bell polynomials · · · 2010 Mathematics Subject Classification Primary: 05A15 Secondary: 05A19 · 1 Introduction A Dyck path of semilength n is a lattice path in the first quadrant, which begins at the origin (0, 0),endsat(2n, 0),andconsistsofsteps(1, 1) and (1, 1).Itiscustomary to encode an up-step (1, 1) with the letter u and a down-step (1−, 1) with the letter − D. Birmajer Department of Mathematics, Nazareth College, 4245 East Ave., Rochester, NY 14618, USA e-mail: [email protected] J. B. Gil (B) M. D. Weiner Penn State Altoona,· 3000 Ivyside Park, Altoona, PA 16601, USA e-mail: [email protected] M. D. Weiner e-mail: [email protected] P. R. W. McNamara Department of Mathematics, Bucknell University, 1 Dent Drive, Lewisburg, PA 17837, USA e-mail: [email protected] ©SpringerNatureSwitzerlandAG2019 155 G. E.
  • Combinatorial Counting

    Combinatorial Counting

    COMBINATORIAL COUNTING MARTIN KLAZAR i Contents Preface iv 1 Catalan numbers 1 1.1 Definition, recurrence, parity, exponential growth . 1 1.2 What is an effective formula? For example, for n 7! cn? . 6 1.3 Recurrences, explicit formulae, asymptotics . 7 1.4 Dyck words, good bracketings and pattern-avoiding permutations 12 1.5 Can (cn) satisfy a linear recurrence with constant coefficients? . 18 1.6 Refining cn | the Narayana numbers . 22 1.7 Stanley's list and Valtr's theorem . 24 Comments and references . 29 2 Analytic intermezzo I. Stirling's formula for factorial 30 2.1 Approximating sums with integrals . 31 2.2 The gamma function . 32 2.3 Cauchy's formula . 34 2.4 Comments and references . 35 3 0 { 1 laws and the Blatter{Specker theorem 37 3.1 The Bollob´as{Thomasontheorem: thresholds exist . 38 3.2 The GKLT{F theorem: enumerative first-order 0 { 1 laws . 42 3.3 The Friedgut{Kalai theorem: thresholds are sharp . 49 3.4 The Shelah{Spencer theorem: irrational exponents are not first order . 49 3.5 The Blatter{Specker theorem: second-order binary structures are periodic . 49 4 Algebra of generating functions 50 4.1 The ring of formal power series . 50 4.2 Formal convergence in C[[x]] and C((x)) . 53 4.3 Differentiation, composition, exp and log . 61 4.4 Composition of GF: exponential GF and the Lagrange inversion formula . 68 4.5 Effective computation of modular reductions . 68 ii 4.6 More on algebra in C[[x]] and C((x)) . 68 4.7 Comments and references .
  • Generalized Chung-Feller Theorems for Lattice Paths

    Generalized Chung-Feller Theorems for Lattice Paths

    Generalized Chung-Feller Theorems for Lattice Paths A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Department of Mathematics Ira M. Gessel, Advisor In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy by Aminul Huq August, 2009 This dissertation, directed and approved by Aminul Huq's committee, has been accepted and approved by the Faculty of Brandeis University in partial fulfillment of the requirements for the degree of: DOCTOR OF PHILOSOPHY Adam Jaffe, Dean of Arts and Sciences Dissertation Committee: Ira M. Gessel, Dept. of Mathematics, Chair. Susan F. Parker, Dept. of Mathematics Richard P. Stanley, Dept. of Mathematics, Massachusetts Institute of Technology c Copyright by Aminul Huq 2009 Dedication To My Parents iv Acknowledgments I wish to express my heartful gratitude to my advisor, Professor Ira M. Gessel, for his teaching, help, guidance, patience, and support. I am grateful to the members of my dissertation defense committee Professor Richard P. Stanley and Professor Susan F. Parker. Specially I'm greatly indebted to Professor Parker for her continual encouragement and mental support. I learned a great deal from her about teaching and mentoring. I owe thanks to the faculty, specially Professor Mark Adler and Professor Daniel Ruberman, to my fellow students, and to the kind and supportive staff of the Brandeis Mathematics Department. I would like to thank all my family and friends for their love and encouragement with patience and I wish to express my boundless love to my wife, Arifun Chowdhury. This thesis is dedicated to my parents, Md.
  • RIMS-1824 Rigged Configurations and Catalan, Stretched Parabolic

    RIMS-1824 Rigged Configurations and Catalan, Stretched Parabolic

    RIMS-1824 Rigged Configurations and Catalan, Stretched Parabolic Kostka Numbers and Polynomials : Polynomiality, Unimodality and Log-concavity By Anatol N. KIRILLOV May 2015 RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES KYOTO UNIVERSITY, Kyoto, Japan Rigged Configurations and Catalan, Stretched Parabolic Kostka Numbers and Polynomials : Polynomiality, Unimodality and Log-concavity anatol n. kirillov Research Institute of Mathematical Sciences ( RIMS ) Kyoto 606-8502, Japan URL: http://www.kurims.kyoto-u.ac.jp/ ~kirillov and The Kavli Institute for the Physics and Mathematics of the Universe ( IPMU ), 5-1-5 Kashiwanoha, Kashiwa, 277-8583, Japan Abstract We will look at the Catalan numbers from the Rigged Configurations point of view originated [9] from an combinatorial analysis of the Bethe Ansatz Equations associ- ated with the higher spin anisotropic Heisenberg models . Our strategy is to take a combinatorial interpretation of Catalan numbers Cn as the number of standard Young 2 tableaux of rectangular shape (n ), or equivalently, as the Kostka number K(n2);12n , as the starting point of research. We observe that the rectangular (or multidimen- sional) Catalan numbers C(m; n) introduced and studied by P. MacMahon [21], [30], see also [31], can be identified with the Kostka number K(nm);1mn , and therefore can be treated by Rigged Configurations technique. Based on this technique we study the stretched Kostka numbers and polynomials, and give a proof of \ a strong rationality \ of the stretched Kostka polynomials. This result implies a polynomiality property of the stretched Kostka and stretched Littlewood{Richardson coefficients [7], [26], [16]. Another application of the Rigged Configuration technique presented, is a new fam- ily of counterexamples to Okounkov's log-concavity conjecture [25].
  • Arxiv:2009.04900V2 [Math.CO] 11 Sep 2020 Counting Generalized

    Arxiv:2009.04900V2 [Math.CO] 11 Sep 2020 Counting Generalized

    Counting generalized Schr¨oder paths Xiaomei Chen∗, Yuan Xiang School of Mathematics and Computational Science Hunan University of Science and Technology Xiangtan 411201, China Mathematics Subject Classifications: 05A15 Abstract A Schr¨oder path is a lattice path from (0, 0) to (2n, 0) with steps (1, 1), (1, 1) and (2, 0) that never goes below the x axis. A small − − Schr¨oder path is a Schr¨oder path with no (2, 0) steps on the x axis. − In this paper, a 3-variable generating function RL(x,y,z) is given for Schr¨oder paths and small Schr¨oder paths respectively. As corollaries, we obtain the generating functions for several kinds of generalized Schr¨oder paths counted according to the order in a unified way. Keywords: Schr¨oder path, Narayana number, generating function 1 Introduction arXiv:2009.04900v2 [math.CO] 11 Sep 2020 In this paper, we will consider the following sets of steps for lattice paths: S = (1, 1), (1, 1) , 1 { − } S = (r, r), (r, r) r N+ , 2 { − | ∈ } S = (1, 1), (1, 1), (2, 0) , 3 { − } S = (r, r), (r, r), (2r, 0) r N+ , 4 { − | ∈ } ∗Corresponding author: [email protected] 1 S = (1, 1), (1, 1), (2r, 0) r N+ , 5 { − | ∈ } S = (r, r), (r, r), (2, 0) r N+ , 6 { − | ∈ } where (r, r), (r, r), (2r, 0) are called up steps, down steps and horizontal − steps respectively. For a given set S of steps, let LS (n) denote the set of lattice paths from (0, 0) to (2n, 0) with steps in S, and never go below the x axis.
  • Some Properties and Combinatorial Implications of Weighted Small Schr

    Some Properties and Combinatorial Implications of Weighted Small Schr

    Some Properties and Combinatorial Implications of Weighted Small Schr¨oder Numbers Yu Hin (Gary) Au Department of Mathematics and Statistics University of Saskatchewan Saskatoon, SK Canada [email protected] Abstract th The n small Schr¨oder number is s(n) = k≥0 s(n, k), where s(n, k) denotes the number of plane rooted trees with n leaves and k internal nodes that each has at least P two children. In this manuscript, we focus on the weighted small Schr¨oder numbers k sd(n)= k≥0 s(n, k)d , where d is an arbitrary fixed real number. We provide recur- sive and asymptotic formulas for s (n), as well as some identities and combinatorial P d interpretations for these numbers. We also establish connections between sd(n) and several families of Dyck paths. 1 Introduction 1.1 Small Schr¨oder numbers The small Schr¨oder numbers, denoted s(n) for every n 1 gives the sequence ≥ n 12345 6 7 8 ··· s(n) 1 1 3 11 45 197 903 4279 ··· arXiv:1912.00555v1 [math.CO] 2 Dec 2019 (A001003 in the On-line Encyclopedia of Integer Sequences (OEIS) [13]). This sequence has been studied extensively and has many combinatorial interpretations (see, for instance, [16, Exercise 6.39]). We list two below: Let n denote the set of Schr¨oder trees with n leaves, which are plane rooted trees • whereT each internal node has at least 2 children. Then s(n) = for every n 1. |Tn| ≥ Figure 1 shows the s(4) = 11 Schr¨oder trees with 4 leaves.
  • Arxiv:Math/0611106V2 [Math.CO] 18 Oct 2007

    Arxiv:Math/0611106V2 [Math.CO] 18 Oct 2007

    Generalized Noncrossing Partitions and Combinatorics of Coxeter Groups Drew Armstrong Author address: Department of Mathematics, Cornell University, Ithaca, New York 14853 Current address: School of Mathematics, University of Minnesota, Minneapolis, Minnesota 55455 E-mail address: [email protected] arXiv:math/0611106v2 [math.CO] 18 Oct 2007 For Moira. Contents Abstract ix Acknowledgements xi Chapter 1. Introduction 1 1.1. Coxeter-Catalan Combinatorics 1 1.2. Noncrossing Motivation 6 1.3. Outline of the Memoir 9 Chapter 2. Coxeter Groups and Noncrossing Partitions 13 2.1. Coxeter Systems 13 2.2. Root Systems 16 2.3. Reduced Words and Weak Order 19 2.4. Absolute Order 22 2.5. Shifting and Local Self-Duality 26 2.6. Coxeter Elements and Noncrossing Partitions 29 2.7. InvariantTheoryandCatalanNumbers 35 Chapter 3. k-Divisible Noncrossing Partitions 41 3.1. Minimal Factorizations 41 3.2. Multichains and Delta Sequences 42 3.3. Definition of k-Divisible Noncrossing Partitions 46 3.4. Basic Properties of k-Divisible Noncrossing Partitions 48 3.5. Fuss-Catalan and Fuss-Narayana Numbers 59 3.6. The Iterated Construction and Chain Enumeration 66 3.7. Shellability and Euler Characteristics 72 Chapter 4. The Classical Types 81 4.1. Classical Noncrossing Partitions 81 4.2. TheClassicalKrewerasComplement 87 4.3. Classical k-Divisible Noncrossing Partitions 92 4.4. Type A 102 4.5. Type B 104 4.6. Type D 111 Chapter 5. Fuss-Catalan Combinatorics 115 5.1. Nonnesting Partitions 115 5.2. Cluster Complexes 128 5.3. Chapoton Triangles 143 5.4. Future Directions 147 vii viii CONTENTS Bibliography 155 Abstract This memoir is a refinement of the author’s PhD thesis — written at Cornell University (2006).
  • Enumeration Via Ballot Numbers Martin Aigner

    Enumeration Via Ballot Numbers Martin Aigner

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 308 (2008) 2544–2563 www.elsevier.com/locate/disc Enumeration via ballot numbers Martin Aigner Mathematics Institute, Freie Universität Berlin, Arnimallee 3, D-14195 Berlin, Germany Received 27 April 2004; received in revised form 19 June 2007; accepted 21 June 2007 Available online 22 October 2007 Abstract Several interesting combinatorial coefficients such as the Catalan numbers and the Bell numbers can be described either via a 3-term recurrence or as sums of (weighted) ballot numbers. This paper gives some general results connecting 3-term recurrences with ballot sequences with several applications to the enumeration of various combinatorial instances. © 2007 Elsevier B.V. All rights reserved. Keywords: Ballot numbers; Catalan-like numbers; Weighted sums; Combinatorial instances 1. Introduction 2n Our starting point is a two-fold description of the Catalan numbers Cn = (1/(n + 1)) n . First, consider the ballot number recurrence: a0,0 = 1,a0,k = 0 (k > 0), an,k = an−1,k−1 + an−1,k +···+an−1,n−1 (n1). Then a classical result says n an,k = Cn+1,an,0 = Cn for all n. k=0 The matrix A = (an,k) indexed by N0 is lower triangular with 1’s in the main diagonal. The following table shows the first rows of A with the 0’s omitted: 1 11 221 A = 5531 14 14 9 4 1 42 42 28 14 5 1 ... 2n−k The numbers an,k =[(k + 1)/(n + 1)] n are called the (ordinary) ballot numbers.
  • UNIVERSITY of CALIFORNIA, SAN DIEGO Flips

    UNIVERSITY of CALIFORNIA, SAN DIEGO Flips

    UNIVERSITY OF CALIFORNIA, SAN DIEGO Flips and Juggles A Dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Jay Cummings Committee in charge: Professor Ron Graham, Chair Professor Jacques Verstra¨ete,Co-Chair Professor Fan Chung Graham Professor Shachar Lovett Professor Jeff Remmel Professor Alexander Vardy 2016 Copyright Jay Cummings, 2016 All rights reserved. The Dissertation of Jay Cummings is approved, and it is acceptable in quality and form for publication on micro- film and electronically: Co-Chair Chair University of California, San Diego 2016 iii DEDICATION To mom and dad. iv EPIGRAPH We've taught you that the Earth is round, That red and white make pink. But something else, that matters more { We've taught you how to think. | Dr. Seuss v TABLE OF CONTENTS Signature Page . iii Dedication . iv Epigraph . .v Table of Contents . vi List of Figures . viii List of Tables . ix Acknowledgements . .x Vita......................................... xii Abstract of the Dissertation . xiii Chapter 1 Juggling Cards . .1 1.1 Introduction . .1 1.1.1 Juggling card sequences . .3 1.2 Throwing one ball at a time . .6 1.2.1 The unrestricted case . .7 1.2.2 Throwing each ball at least once . .9 1.3 Throwing m ≥ 2 balls at a time . 16 1.3.1 A digraph approach . 17 1.3.2 A differential equations approach . 21 1.4 Throwing different numbers of balls at different times . 23 1.4.1 Boson normal ordering . 24 1.5 Preserving ordering while throwing . 27 1.6 Juggling card sequences with minimal crossings .
  • Enumerating a Class of Lattice Paths

    Enumerating a Class of Lattice Paths

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 271 (2003) 13–28 www.elsevier.com/locate/disc Enumerating a class oflattice paths Curtis Coker Department of Mathematics, Gonzaga University, Spokane, WA, USA Received 10 February 2000; received in revised form 5 November 2002; accepted 15 November 2002 Abstract Let D0(n) denote the set oflattice paths in the xy-plane that begin at (0,0), terminate at (n; n), never rise above the line y = x and have step set S = {(k; 0) : k ∈ N+}∪{(0;k):k ∈ N+}. Let E0(n) denote the set oflattice paths with step set S that begin at (0,0) and terminate at (n; n). Using primarily the symbolic method (R. Sedgewick, P. Flajolet, An Introduction to the Analysis ofAlgorithms, Addison-Wesley, Reading, MA, 1996) and the Lagrange inversion formulawe study some enumerative problems associated with D0(n) and E0(n). c 2003 Elsevier B.V. All rights reserved. Keywords: Lattice path; Lagrange inversion formula; Narayana number 1. Introduction For any positive integer n let C0(n) denote the set oflattice paths in the xy-plane that: (i) have step set S(1) = {(1; 0); (0; 1)}, (ii) begin at (0,0) and terminate at (n; n), (iii) never rise above the line y = x. 2n It is ofcourse well known that |C0(n)|=[1=(n+1)]( n ). More generally if n ¿ k ¿ 0 n+k then the ballot number [(n − k +1)=(n + 1)]( k ) counts the lattice paths that begin at (0,0), terminate at (n; k), never rise above the line y = x and have step set S(1).