Motzkin numbers
DOI10.1016/0097-3165(77)90020-6zbMATH Open0417.05007OpenAlexW4210335754WikidataQ56442437 ScholiaQ56442437MaRDI QIDQ5895359FDOQ5895359
Authors: Robert Donaghey, Louis W. Shapiro
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
Enumerative combinatorics (05A99) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Title not available (Why is that?)
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Correspondences between plane trees and binary sequences
- Enumeration of plane trees by branches and endpoints
- Historical Note on a Recurrent Combinatorial Problem
- Title not available (Why is that?)
- A note on plane trees
- Title not available (Why is that?)
- Solution of Certain Recurrences
- Restricted plane tree representations of four Motzkin-Catalan equations
- Binomial self-inverse sequences and tangent coefficients
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Hankel determinants of sums of consecutive Motzkin numbers
- Why Delannoy numbers?
- Deux propriétés combinatoires des nombres de Schröder
- Some identities on the Catalan, Motzkin and Schröder numbers
- Chords, trees and permutations
- A half-normal distribution scheme for generating functions
- Logarithmic behavior of some combinatorial sequences
- Some new characterizations of Hamiltonian cycles in triangular grid graphs
- Congruences of finite summations of the coefficients in certain generating functions
- Identities involving weighted Catalan, Schröder and Motzkin paths
- Riordan matrices and higher-dimensional lattice walks
- Motzkin paths, Motzkin polynomials and recurrence relations
- Motzkin algebras
- Triangular sequences, combinatorial recurrences and linear difference equations
- Bijective recurrences for Motzkin paths
- Catalan-like numbers and determinants
- Random walks with absorbing points
- Skew Dyck paths
- On the generating functions of pattern-avoiding Motzkin paths
- Catalan and Motzkin numbers modulo 4 and 8
- A methodology for plane tree enumeration
- The Riordan group
- A new combinatorial interpretation for generalized Catalan number
- Eplett's identity for renewal arrays
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Catalan, Motzkin, and Riordan numbers
- Operated semigroups, Motzkin paths and rooted trees
- Cycles in the graph of overlapping permutations avoiding barred patterns
- Some statistics on generalized Motzkin paths with vertical steps
- Taylor expansions for Catalan and Motzkin numbers
- A history and a survey of lattice path enumeration
- ECO:a methodology for the enumeration of combinatorial objects
- Maximum likelihood analysis of algorithms and data structures
- Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
- Approximating algebraic functions by means of rational ones
- Enumerating Hamiltonian cycles
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- Potts model partition functions for self-dual families of strip graphs
- Some statistics on Dyck paths
- On directed lattice paths with vertical steps
- Congruences for Catalan and Motzkin numbers and related sequences
- Pascal triangles, Catalan numbers and renewal arrays
- Automorphisms on Catalan trees and bracketings
- Combinatorics of RNA secondary structures
- The random generation of directed animals
- Relative locations of subwords in free operated semigroups and Motzkin words.
- A bijection on ordered trees and its consequences
- Annular bounds for the zeros of a polynomial
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions
- Graph invertibility and median eigenvalues
- The statistic ``number of udu's in Dyck paths
- Pattern distributions in Dyck paths with a first return decomposition constrained by height
- On the number of pseudo-triangulations of certain point sets
- Rhyming schemes: crossings and coverings
- The random generation of underdiagonal walks
- Refined Chung-Feller theorems for lattice paths
- Pattern avoidance in binary trees
- Graph invertibility
- 0-Calabi-Yau configurations and finite Auslander-Reiten quivers of Gorenstein orders
- Exact site-percolation probability on the square lattice
- Some canonical sequences of integers
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Riordan paths and derangements
- On some new sequences generalizing the Catalan and Motzkin numbers
- Orthogonal polynomials approach to the Hankel transform of sequences based on Motzkin numbers
- Two transformations of series that commute with compositional inversion
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Motzkin paths with a restricted first return decomposition
- Two explicit formulas for the generalized Motzkin numbers
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
- Normalizers of ad-nilpotent ideals
- Old and young leaves on plane trees
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
- Similarity relations on finite ordered sets
- ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
- Boundary description of microstates of the two-dimensional black hole
- On the composition of an arbitrary collection of \(\mathrm{SU}(2)\) spins: an enumerative combinatoric approach
- Vertically constrained Motzkin-like paths inspired by bobbin lace
- Narayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapes
- Analytic properties of combinatorial triangles related to Motzkin numbers
- On computing the total displacement number via weighted Motzkin paths
- Properties of Motzkin triangle and \(t\)-generalized Motzkin sequences
- Motzkin numbers: an operational point of view
- Enumeration of partial Łukasiewicz paths
- A Motzkin filter in the Tamari lattice
- Asymptotic estimate for the multinomial coefficients
- On geometry of the zeros of a polynomial
- Motzkin Sequence Spaces and Motzkin Core
- Holonomic equations and efficient random generation of binary trees
- Several explicit and recursive formulas for generalized Motzkin numbers
- Developing a mathematical model for bobbin lace
- A combinatorial interpretation for two transformations of series that commute with compositional inversion
- Regular simple queues of protein contact maps
- Set partitions and non-crossing partitions with \(\ell\)-neighbors and \(\ell\)-isolated elements
- Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity
- Effective algorithms for computing triangular operator in Schubert calculus
- Exterior corners on bargraphs of Motzkin words
- Enumerating restricted Dyck paths with context free grammars
- Ordered trees and the inorder traversal
- Motzkin and Catalan tunnel polynomials
This page was built for publication: Motzkin numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895359)