DOCSLIB.ORG

Statistics on Pattern-Avoiding Permutations Sergi Elizalde

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Statistics on Pattern-Avoiding Permutations Sergi Elizalde Statistics on Pattern-avoiding Permutations by Sergi Elizalde B.S., Technical University of Catalonia (UPC), 2000 Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2004 c Sergi Elizalde, MMIV. All rights reserved. The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis document in whole or in part. Author . Department of Mathematics April 22, 2004 Certified by. Richard P. Stanley Norman Levinson Professor of Applied Mathematics Thesis Supervisor Accepted by . Pavel Etingof Chairman, Department Committee on Graduate Students 2 Statistics on Pattern-avoiding Permutations by Sergi Elizalde Submitted to the Department of Mathematics on April 22, 2004, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics `number of fixed points' and `number of excedances' is the same in 321-avoiding as in 132-avoiding permuta- tions. This generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, more direct proof. The key ideas are to introduce a new class of statis- tics on Dyck paths, based on what we call a tunnel, and to use a new technique involving diagonals of non-rational generating functions. Next we present a new statistic-preserving family of bijections from the set of Dyck paths to itself. They map statistics that appear in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. In particular, this gives a simple bijective proof of the equidistribution of fixed points in the above two sets of restricted permutations. Then we introduce a bijection between 321- and 132-avoiding permutations that pre- serves the number of fixed points and the number of excedances. A part of our bijection is based on the Robinson-Schensted-Knuth correspondence. We also show that our bijection preserves additional parameters. Next, motivated by these results, we study the distribution of fixed points and ex- cedances in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions which enu- merate them. Some cases are generalized to patterns of arbitrary length. For avoidance of one single pattern we give partial results. We also describe the distribution of these statis- tics in involutions avoiding any subset of patterns of length 3. The main technique consists in using bijections between pattern-avoiding permutations and certain kinds of Dyck paths, in such a way that the statistics in permutations that we consider correspond to statistics on Dyck paths which are easier to enumerate. Finally, we study another kind of restricted permutations, counted by the Motzkin num- bers. By constructing a bijection into Motzkin paths, we enumerate them with respect to some parameters, including the length of the longest increasing and decreasing subsequences and the number of ascents. Thesis Supervisor: Richard P. Stanley Title: Norman Levinson Professor of Applied Mathematics 3 4 Acknowledgments There are many people who have made this thesis possible. First I would like to thank my advisor, Richard Stanley, for his guidance and advice, and for always pointing me in the right direction. I feel very lucky to have been one of his students. I admire not only his tremendous knowledge, but also his outstanding humbleness. I will try to follow his model, wishing that one day I can be such a good advisor. The stimulating environment at MIT has allowed me to learn from many people, both professors and students. In particular, I want to thank Igor Pak for mathematical dis- cussions and collaboration, and for his liveliness and sense of humor. It has also been a pleasure to collaborate with Emeric Deutsch and Toufik Mansour. Other mathematicians who have offered valuable suggestions are Sara Billey, Miklos B´ona, Alex Burstein, Richard Ehrenborg, Ira Gessel, Olivier Guibert, David Jackson, Sergey Kitaev, Danny Kleitman, Rom Pinchasi, Alex Postnikov, Astrid Reifegerste and Douglas Rogers. Outside of MIT, I am very grateful to Marc Noy for previous collaboration, and for following my work and giving me priceless advice in my frequent visits to Barcelona. He awakened my interest for combinatorics, soon after Josep Gran´e and Sebasti`a Xamb´o had introduced me to the wonders of mathematics. These four years at MIT have been one of the best periods of my life, both scientifically and at a personal level. I owe this to the exceptional people that I have met in Boston. I am indebted to Jan and Radoˇs for being such supportive friends, with whom one can talk about everything. From Federico I learned how to enjoy being a graduate student. I owe to Mark having given me the encouragement I needed to come to MIT, as well as other good advice. Peter has been much more than a \cofactor". Fumei has made the office more lively. Anna has helped me keep things in perspective, and has made me feel closer to UPC. My stay at MIT has been a great experience also thanks to Etienne, Carly, Bridget, Lauren, Cilanne, Thomas, Ed and Jason, and outside the math department, to Pinar, Hazhir, Parisa, Charlotte, Samantha, Kalina, Martin, V´ıctor, Rafal, Felipe, Cornelius, Jos´e Manuel, Mika, Nuria,´ Ram´on, Marta, Paulina, Juan, Carina, Anya, Han, Alessandra, Karolina, Stephanie, and the ones that I shamefully forgot. Finalment, l'agra¨ıment m´es especial ´es pels meus pares Emili i Maria Carme, sense els quals tot aix`o no hauria estat possible. A ells els dec l’educaci´o que m'han donat, haver-me format com a persona, i especialment l'amor que han demostrat i el seu suport incondicional en tot moment. Tamb´e ´es un orgull tenir un germ`a com l'Aleix, sabent que puc comptar amb ell sempre que el necessiti. Per acabar, vull donar gr`acies als meus amics de la carrera: Diego, Sergi, Javi, Marta, Agus, Teresa, Ariadna, Carles, Ana, Fernando, V´ıctor, Carme, Josep Joan, Montse, Toni, Edgar, Jordi, Maite, Esther, Desi, Elena i tots els altres, per fer-me sentir com si el temps no pass´es cada vegada que vaig a Barcelona. 5 6 Contents Introduction 13 1 Definitions and preliminaries 15 1.1 Permutations . 15 1.1.1 Pattern avoidance . 15 1.1.2 Permutation statistics . 15 1.1.3 Trivial operations . 16 1.2 Dyck paths . 17 1.2.1 Standard statistics . 18 1.2.2 Tunnels . 18 1.3 Combinatorial classes and generating functions . 21 1.3.1 The Lagrange inversion formula . 21 1.3.2 Chebyshev polynomials . 22 1.4 Patterns of length 3 . 22 1.4.1 Equidistribution of fixed points . 22 2 Equidistribution of fixed points and excedances 25 2.1 The bijection x . 25 2.2 The bijection ' . 28 2.2.1 Enumeration of centered tunnels . 30 2.2.2 Enumeration of shifted tunnels . 31 2.3 Enumeration of right tunnels: the method of the diagonal of a power series 32 2.4 Some other bijections between (321) and . 38 Sn Dn 3 A simple and unusual bijection for Dyck paths 41 3.1 The bijection Φ . 41 3.2 Properties of Φ . 44 3.3 Generalizations . 47 3.4 Connection to pattern-avoiding permutations . 50 3.5 Some new interpretations of the Catalan numbers . 54 4 A direct bijection preserving fixed points and excedances 57 4.1 A composition of bijections into Dyck paths . 57 4.1.1 The bijection Ψ . 58 4.2 Properties of Ψ . 59 4.3 Properties of the matching algorithm . 61 4.4 Further applications . 63 7 5 Avoidance of subsets of patterns of length 3 65 5.1 More properties of ' . 65 5.2 Single restrictions . 67 5.2.1 a) 123 . 67 5.2.2 b) 132 213 321 . 70 ≈ ≈ 5.2.3 c, c') 231 312 . 73 ∼ 5.3 Double restrictions . 77 5.3.1 a) 123; 132 123; 213 . 77 f g ≈ f g 5.3.2 b, b') 231; 321 312; 321 . 81 f g ∼ f g 5.3.3 c) 132; 213 . 82 f g 5.3.4 d) 231; 312 . 84 f g 5.3.5 e, e') 132; 231 213; 231 132; 312 213; 312 . 84 f g ≈ f g ∼ f g ≈ f g 5.3.6 f) 132; 321 213; 321 . 85 f g ≈ f g 5.3.7 g, g') 123; 231 123; 312 . 86 f g ∼ f g 5.3.8 h) 123; 321 . 88 f g 5.4 Triple restrictions . 88 5.5 Pattern-avoiding involutions . 94 5.5.1 Single restrictions . 95 5.5.2 Multiple restrictions . 96 5.6 Expected number of fixed points . 97 5.6.1 a) 123 . 98 5.6.2 b) 132 213 321 . 98 ≈ ≈ 5.6.3 c, c') 231 312 . 99 ∼ 5.6.4 Other cases . 99 5.7 Final remarks and possible extensions . 100 5.7.1 Cycle structure . 100 6 Motzkin permutations 103 6.1 Preliminaries . 103 6.1.1 Generalized patterns . 103 6.1.2 Motzkin paths . 104 6.2 The bijection Υ . 104 6.2.1 Definition of Υ . 104 6.2.2 Statistics on Mn . 105 6.3 Fixed points in the reversal of Motzkin permutations . 107 8 List of Figures 1-1 The array of π = 63528174. 16 1-2 One centered and four right tunnels. 19 1-3 Five centered multitunnels, two of which are centered tunnels.
Load more

Recommended publications
  • A Historical Perspective of Spectrum Estimation
    PROCEEDINGSIEEE, OF THE VOL. 70, NO. 9, SEPTEMBER885 1982 A Historical Perspective of Spectrum Estimation ENDERS A. ROBINSON Invited Paper Alwhrct-The prehistory of spectral estimation has its mots in an- times, credit for the empirical discovery of spectra goes to the cient times with the development of the calendar and the clock The diversified genius of Sir Isaac Newton [ 11. But the great in- work of F’ythagom in 600 B.C. on the laws of musical harmony found mathematical expression in the eighteenthcentury in terms of the wave terest in spectral analysis made its appearanceonly a little equation. The strueto understand the solution of the wave equation more than a century ago. The prominent German chemist was fhlly resolved by Jean Baptiste Joseph de Fourier in 1807 with Robert Wilhelm Bunsen (18 1 1-1899) repeated Newton’s his introduction of the Fourier series TheFourier theory was ex- experiment of the glass prism. Only Bunsen did not use the tended to the case of arbitrary orthogollpl functions by Stmn and sun’s rays Newton did. Newtonhad found that aray of Liowillein 1836. The Stum+Liouville theory led to the greatest as empirical sum of spectral analysis yet obbhed, namely the formulo sunlight is expanded into a band of many colors, the spectrum tion of quantum mechnnics as given by Heisenberg and SchrMngm in of the rainbow. In Bunsen’s experiment, the role of pure sun- 1925 and 1926. In 1929 John von Neumann put the spectral theory of light was replaced by the burning of an old rag that had been the atom on a Turn mathematical foundation in his spectral represent, soaked in a salt solution (sodium chloride).
    [Show full text]
  • Martin Gardner Receives JPBM Communications Award
    THE NEWSLETTER OF THE MATHEMATICAL ASSOCIAnON OF AMERICA Martin Gardner Receives JPBM voIome 14, Number 4 Communications Award Martin Gardner has been named the 1994 the United States Navy recipient of the Joint Policy Board for Math­ and served until the end ematics Communications Award. Author of of the Second World In this Issue numerous books and articles about mathemat­ War. He began his Sci­ ics' Gardner isbest known for thelong-running entific Americancolumn "Mathematical Games" column in Scientific in December 1956. 4 CD-ROM American. For nearly forty years, Gardner, The MAA is proud to count Gardneras one of its Textbooks and through his column and books, has exertedan authors. He has published four books with the enormous influence on mathematicians and Calculus Association, with three more in thepipeline. This students of mathematics. September, he begins "Gardner's Gatherings," 6 Open Secrets When asked about the appeal of mathemat­ a new column in Math Horizons. ics, Gardner said, "It's just the patterns, and Previous JPBM Communications Awards have their order-and their beauty: the way it all gone to James Gleick, author of Chaos; Hugh 8 Section Awards fits together so it all comes out right in the Whitemore for the play Breaking the Code; Ivars end." for Distinguished Peterson, author of several books and associate Teaching Gardner graduated Phi Beta Kappa in phi­ editor of Science News; and Joel Schneider, losophy from the University of Chicago in content director for the Children's Television 10 Personal Opinion 1936, and then pursued graduate work in the Workshop's Square One TV.
    [Show full text]
  • Publications of Members, 1930-1954
    THE INSTITUTE FOR ADVANCED STUDY PUBLICATIONS OF MEMBERS 1930 • 1954 PRINCETON, NEW JERSEY . 1955 COPYRIGHT 1955, BY THE INSTITUTE FOR ADVANCED STUDY MANUFACTURED IN THE UNITED STATES OF AMERICA BY PRINCETON UNIVERSITY PRESS, PRINCETON, N.J. CONTENTS FOREWORD 3 BIBLIOGRAPHY 9 DIRECTORY OF INSTITUTE MEMBERS, 1930-1954 205 MEMBERS WITH APPOINTMENTS OF LONG TERM 265 TRUSTEES 269 buH FOREWORD FOREWORD Publication of this bibliography marks the 25th Anniversary of the foundation of the Institute for Advanced Study. The certificate of incorporation of the Institute was signed on the 20th day of May, 1930. The first academic appointments, naming Albert Einstein and Oswald Veblen as Professors at the Institute, were approved two and one- half years later, in initiation of academic work. The Institute for Advanced Study is devoted to the encouragement, support and patronage of learning—of science, in the old, broad, undifferentiated sense of the word. The Institute partakes of the character both of a university and of a research institute j but it also differs in significant ways from both. It is unlike a university, for instance, in its small size—its academic membership at any one time numbers only a little over a hundred. It is unlike a university in that it has no formal curriculum, no scheduled courses of instruction, no commitment that all branches of learning be rep- resented in its faculty and members. It is unlike a research institute in that its purposes are broader, that it supports many separate fields of study, that, with one exception, it maintains no laboratories; and above all in that it welcomes temporary members, whose intellectual development and growth are one of its principal purposes.
    [Show full text]
  • 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.
    [Show full text]
  • Motzkin Paths, Motzkin Polynomials and Recurrence Relations
    Motzkin paths, Motzkin polynomials and recurrence relations Roy Oste and Joris Van der Jeugt Department of Applied Mathematics, Computer Science and Statistics Ghent University B-9000 Gent, Belgium [email protected], [email protected] Submitted: Oct 24, 2014; Accepted: Apr 4, 2015; Published: Apr 21, 2015 Mathematics Subject Classifications: 05A10, 05A15 Abstract We consider the Motzkin paths which are simple combinatorial objects appear- ing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polyno- mials) have been studied before, but here we deduce some properties based on recurrence relations. The recurrence relations proved here also allow an efficient computation of the Motzkin polynomials. Finally, we show that the matrix en- tries of powers of an arbitrary tridiagonal matrix are essentially given by Motzkin polynomials, a property commonly known but usually stated without proof. 1 Introduction Catalan numbers and Motzkin numbers have a long history in combinatorics [19, 20]. 1 2n A lot of enumeration problems are counted by the Catalan numbers Cn = n+1 n , see e.g. [20]. Closely related to Catalan numbers are Motzkin numbers M , n ⌊n/2⌋ n M = C n 2k k Xk=0 similarly associated to many counting problems, see e.g. [9, 1, 18]. For example, the number of different ways of drawing non-intersecting chords between n points on a circle is counted by the Motzkin numbers.
    [Show full text]
  • Motzkin Paths
    Discrete Math. 312 (2012), no. 11, 1918-1922 Noncrossing Linked Partitions and Large (3; 2)-Motzkin Paths William Y.C. Chen1, Carol J. Wang2 1Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.R. China 2Department of Mathematics Beijing Technology and Business University Beijing 100048, P.R. China emails: [email protected], wang [email protected] Abstract. Noncrossing linked partitions arise in the study of certain transforms in free probability theory. We explore the connection between noncrossing linked partitions and (3; 2)-Motzkin paths, where a (3; 2)-Motzkin path can be viewed as a Motzkin path for which there are three types of horizontal steps and two types of down steps. A large (3; 2)-Motzkin path is a (3; 2)-Motzkin path for which there are only two types of horizontal steps on the x-axis. We establish a one-to-one correspondence between the set of noncrossing linked partitions of f1; : : : ; n + 1g and the set of large (3; 2)- Motzkin paths of length n, which leads to a simple explanation of the well-known relation between the large and the little Schr¨odernumbers. Keywords: Noncrossing linked partition, Schr¨oderpath, large (3; 2)-Motzkin path, Schr¨odernumber AMS Classifications: 05A15, 05A18. 1 1 Introduction The notion of noncrossing linked partitions was introduced by Dykema [5] in the study of the unsymmetrized T-transform in free probability theory. Let [n] denote f1; : : : ; ng. It has been shown that the generating function of the number of noncrossing linked partitions of [n + 1] is given by 1 p X 1 − x − 1 − 6x + x2 F (x) = f xn = : (1.1) n+1 2x n=0 This implies that the number of noncrossing linked partitions of [n + 1] is equal to the n-th large Schr¨odernumber Sn, that is, the number of large Schr¨oderpaths of length 2n.
    [Show full text]
  • 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.
    [Show full text]
  • A Century of Mathematics in America, Peter Duren Et Ai., (Eds.), Vol
    Garrett Birkhoff has had a lifelong connection with Harvard mathematics. He was an infant when his father, the famous mathematician G. D. Birkhoff, joined the Harvard faculty. He has had a long academic career at Harvard: A.B. in 1932, Society of Fellows in 1933-1936, and a faculty appointmentfrom 1936 until his retirement in 1981. His research has ranged widely through alge­ bra, lattice theory, hydrodynamics, differential equations, scientific computing, and history of mathematics. Among his many publications are books on lattice theory and hydrodynamics, and the pioneering textbook A Survey of Modern Algebra, written jointly with S. Mac Lane. He has served as president ofSIAM and is a member of the National Academy of Sciences. Mathematics at Harvard, 1836-1944 GARRETT BIRKHOFF O. OUTLINE As my contribution to the history of mathematics in America, I decided to write a connected account of mathematical activity at Harvard from 1836 (Harvard's bicentennial) to the present day. During that time, many mathe­ maticians at Harvard have tried to respond constructively to the challenges and opportunities confronting them in a rapidly changing world. This essay reviews what might be called the indigenous period, lasting through World War II, during which most members of the Harvard mathe­ matical faculty had also studied there. Indeed, as will be explained in §§ 1-3 below, mathematical activity at Harvard was dominated by Benjamin Peirce and his students in the first half of this period. Then, from 1890 until around 1920, while our country was becoming a great power economically, basic mathematical research of high quality, mostly in traditional areas of analysis and theoretical celestial mechanics, was carried on by several faculty members.
    [Show full text]
  • Some Identities on the Catalan, Motzkin and Schr¨Oder Numbers
    Discrete Applied Mathematics 156 (2008) 2781–2789 www.elsevier.com/locate/dam Some identities on the Catalan, Motzkin and Schroder¨ numbers Eva Y.P. Denga,∗, Wei-Jun Yanb a Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, PR China b Department of Foundation Courses, Neusoft Institute of Information, Dalian 116023, PR China Received 19 July 2006; received in revised form 1 September 2007; accepted 18 November 2007 Available online 3 January 2008 Abstract In this paper, some identities between the Catalan, Motzkin and Schroder¨ numbers are obtained by using the Riordan group. We also present two combinatorial proofs for an identity related to the Catalan numbers with the Motzkin numbers and an identity related to the Schroder¨ numbers with the Motzkin numbers, respectively. c 2007 Elsevier B.V. All rights reserved. Keywords: Catalan number; Motzkin number; Schroder¨ number; Riordan group 1. Introduction The Catalan, Motzkin and Schroder¨ numbers have been widely encountered and widely investigated. They appear in a large number of combinatorial objects, see [11] and The On-Line Encyclopedia of Integer Sequences [8] for more details. Here we describe them in terms of certain lattice paths. A Dyck path of semilength n is a lattice path from the origin (0, 0) to (2n, 0) consisting of up steps (1, 1) and down steps (1, −1) that never goes below the x-axis. The set of Dyck paths of semilength n is enumerated by the n-th Catalan number 1 2n cn = n + 1 n (sequence A000108 in [8]). The generating function for the Catalan numbers (cn)n∈N is √ 1 − 1 − 4x c(x) = .
    [Show full text]
  • Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression
    1 2 Journal of Integer Sequences, Vol. 10 (2007), 3 Article 07.7.4 47 6 23 11 Motzkin Numbers of Higher Rank: Generating Function and Explicit Expression Toufik Mansour Department of Mathematics University of Haifa Haifa 31905 Israel [email protected] Matthias Schork1 Camillo-Sitte-Weg 25 60488 Frankfurt Germany [email protected] Yidong Sun Department of Mathematics Dalian Maritime University 116026 Dalian P. R. China [email protected] Abstract The generating function for the (colored) Motzkin numbers of higher rank intro- duced recently is discussed. Considering the special case of rank one yields the corre- sponding results for the conventional colored Motzkin numbers for which in addition a recursion relation is given. Some explicit expressions are given for the higher rank case in the first few instances. 1All correspondence should be directed to this author. 1 1 Introduction The classical Motzkin numbers (A001006 in [1]) count the numbers of Motzkin paths (and are also related to many other combinatorial objects, see Stanley [2]). Let us recall the definition of Motzkin paths. We consider in the Cartesian plane Z Z those lattice paths starting from (0, 0) that use the steps U, L, D , where U = (1, 1) is× an up-step, L = (1, 0) a level-step and D = (1, 1) a down-step.{ Let} M(n, k) denote the set of paths beginning in (0, 0) and ending in (n,− k) that never go below the x-axis. Paths in M(n, 0) are called Motzkin paths and m := M(n, 0) is called n-th Motzkin number.
    [Show full text]
  • 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.
    [Show full text]
  • Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected]
    Transformations Volume 2 Article 5 Issue 2 Winter 2016 12-27-2016 Number Pattern Hui Fang Huang Su Nova Southeastern University, [email protected] Denise Gates Janice Haramis Farrah Bell Claude Manigat See next page for additional authors Follow this and additional works at: https://nsuworks.nova.edu/transformations Part of the Curriculum and Instruction Commons, Science and Mathematics Education Commons, Special Education and Teaching Commons, and the Teacher Education and Professional Development Commons Recommended Citation Su, Hui Fang Huang; Gates, Denise; Haramis, Janice; Bell, Farrah; Manigat, Claude; Hierpe, Kristin; and Da Silva, Lourivaldo (2016) "Number Pattern," Transformations: Vol. 2 : Iss. 2 , Article 5. Available at: https://nsuworks.nova.edu/transformations/vol2/iss2/5 This Article is brought to you for free and open access by the Abraham S. Fischler College of Education at NSUWorks. It has been accepted for inclusion in Transformations by an authorized editor of NSUWorks. For more information, please contact [email protected]. Number Pattern Cover Page Footnote This article is the result of the MAT students' collaborative research work in the Pre-Algebra course. The research was under the direction of their professor, Dr. Hui Fang Su. The ap per was organized by Team Leader Denise Gates. Authors Hui Fang Huang Su, Denise Gates, Janice Haramis, Farrah Bell, Claude Manigat, Kristin Hierpe, and Lourivaldo Da Silva This article is available in Transformations: https://nsuworks.nova.edu/transformations/vol2/iss2/5 Number Patterns Abstract In this manuscript, we study the purpose of number patterns, a brief history of number patterns, and classroom uses for number patterns and magic squares.
    [Show full text]