Motzkin numbers

DOI10.1016/0097-3165(77)90020-6zbMath0417.05007OpenAlexW4210335754WikidataQ56442437 ScholiaQ56442437MaRDI QIDQ5895359

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90020-6

zbMATH Keywords

Catalan numbers Motzkin numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Enumerative combinatorics (05A99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Exact site-percolation probability on the square lattice, Unnamed Item, ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE, Unnamed Item, A construction for enumerating k-coloured Motzkin paths, The \(\mathfrak{uvu}\)-avoiding \((a, b, c)\)-generalized Motzkin paths with vertical steps: bijections and statistic enumerations, Determinant identities for the Catalan, Motzkin and Schröder numbers, Enumeration of partial Łukasiewicz paths, Unnamed Item, The Catalan simplicial set, On the composition of an arbitrary collection of SU(2) spins: an enumerative combinatoric approach, Unnamed Item, Unnamed Item, Structural properties of Potts model partition functions and chromatic polynomials for lattice strips, Potts model partition functions for self-dual families of strip graphs, Bijective recurrences for Motzkin paths, Approximating algebraic functions by means of rational ones, A combinatorial equivalence relation for formal power series, Normalizers of ad-nilpotent ideals, Old and young leaves on plane trees, Regular simple queues of protein contact maps, Enumerating Restricted Dyck Paths with Context-Free Grammars, Several explicit and recursive formulas for generalized Motzkin numbers, On the generating functions of pattern-avoiding Motzkin paths, The statistic ``number of udu's in Dyck paths, The random generation of directed animals, A new combinatorial interpretation for generalized Catalan number, Developing a mathematical model for bobbin lace, Properties of Motzkin triangle and \(t\)-generalized Motzkin sequences, Some statistics on Dyck paths, The random generation of underdiagonal walks, Some canonical sequences of integers, Beyond Göllnitz' theorem. II: Arbitrarily many primary colors, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial, Graph invertibility and median eigenvalues, Colored Motzkin Paths of Higher Order, Raney numbers, threshold sequences and Motzkin-like paths, A methodology for plane tree enumeration, A half-normal distribution scheme for generating functions, A combinatorial interpretation for two transformations of series that commute with compositional inversion, Two transformations of series that commute with compositional inversion, Vertically constrained Motzkin-like paths inspired by bobbin lace, Hankel determinants of sums of consecutive Motzkin numbers, Congruences of finite summations of the coefficients in certain generating functions, Inverse relations in Shapiro's open questions, On directed lattice paths with vertical steps, Rhyming schemes: crossings and coverings, Automorphisms on Catalan trees and bracketings, Some new characterizations of Hamiltonian cycles in triangular grid graphs, Unnamed Item, Eplett's identity for renewal arrays, Fibonacci determinants with Cameron's operator, Motzkin algebras, Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions, Enumerating Hamiltonian cycles, Peakless Motzkin paths with marked level steps at fixed height, Enumeration of Łukasiewicz paths modulo some patterns, Enumerating \(r\)c-invariant permutations with no long decreasing subsequences, Catalan and Motzkin numbers modulo 4 and 8, The Riordan group, A bijection on ordered trees and its consequences, Relative locations of subwords in free operated semigroups and Motzkin words., 0-Calabi-Yau configurations and finite Auslander-Reiten quivers of Gorenstein orders, Orthogonal polynomials approach to the Hankel transform of sequences based on Motzkin numbers, Some identities on the Catalan, Motzkin and Schröder numbers, Deux propriétés combinatoires des nombres de Schröder, Identities involving weighted Catalan, Schröder and Motzkin paths, Two explicit formulas for the generalized Motzkin numbers, Annular bounds for the zeros of a polynomial, On the number of pseudo-triangulations of certain point sets, Chords, trees and permutations, Random walks with absorbing points, Narayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapes, Triangular sequences, combinatorial recurrences and linear difference equations, Logarithmic behavior of some combinatorial sequences, Riordan paths and derangements, Analytic properties of combinatorial triangles related to Motzkin numbers, Effective algorithms for computing triangular operator in Schubert calculus, Skew Dyck paths, A history and a survey of lattice path enumeration, Riordan matrices and higher-dimensional lattice walks, Congruences for Catalan and Motzkin numbers and related sequences, Motzkin Numbers: an Operational Point of View, Pattern avoidance in binary trees, Unnamed Item, Ordered trees and the inorder traversal, On Geometry of the Zeros of a Polynomial, Similarity relations on finite ordered sets, Cycles in the graph of overlapping permutations avoiding barred patterns, Graph-indexed random walks on pseudotrees, Pascal triangles, Catalan numbers and renewal arrays, ECO:a methodology for the enumeration of combinatorial objects, Exhaustive generation of some lattice paths and their prefixes, On some new sequences generalizing the Catalan and Motzkin numbers, Graph invertibility, Taylor expansions for the generating function of Catalan-like numbers, Operated semigroups, Motzkin paths and rooted trees, On Computing the Total Displacement Number via Weighted Motzkin Paths, Combinatorics of RNA secondary structures, Ordered trees with prescribed root degrees, node degrees, and branch lengths, Unnamed Item, Pattern distributions in Dyck paths with a first return decomposition constrained by height, The relevant prefixes of coloured Motzkin walks: an average case analysis, Maximum likelihood analysis of algorithms and data structures, Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity, Why Delannoy numbers?, Catalan-like numbers and determinants, Refined Chung-Feller theorems for lattice paths, Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions, Catalan, Motzkin, and Riordan numbers, A combinatorial bijection on \(k\)-noncrossing partitions, Motzkin paths, Motzkin polynomials and recurrence relations, A Motzkin filter in the Tamari lattice, Some statistics on generalized Motzkin paths with vertical steps, Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem, Motzkin subposets and Motzkin geodesics in Tamari lattices., Taylor expansions for Catalan and Motzkin numbers, On lattice paths with four types of steps

Cites Work