Motzkin numbers
From MaRDI portal
Cites work
- A note on plane trees
- Binomial self-inverse sequences and tangent coefficients
- Correspondences between plane trees and binary sequences
- Enumeration of plane trees by branches and endpoints
- Historical Note on a Recurrent Combinatorial Problem
- scientific article; zbMATH DE number 3468854 (Why is no real title available?)
- scientific article; zbMATH DE number 3512114 (Why is no real title available?)
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- scientific article; zbMATH DE number 3358536 (Why is no real title available?)
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Restricted plane tree representations of four Motzkin-Catalan equations
- Solution of Certain Recurrences
Cited in
(only showing first 100 items - show all)- Operated semigroups, Motzkin paths and rooted trees
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Maximum likelihood analysis of algorithms and data structures
- A new combinatorial interpretation for generalized Catalan number
- A combinatorial interpretation for two transformations of series that commute with compositional inversion
- Two transformations of series that commute with compositional inversion
- Rhyming schemes: crossings and coverings
- Automorphisms on Catalan trees and bracketings
- Eplett's identity for renewal arrays
- The Riordan group
- Random walks with absorbing points
- Similarity relations on finite ordered sets
- Pascal triangles, Catalan numbers and renewal arrays
- On some new sequences generalizing the Catalan and Motzkin numbers
- Combinatorics of RNA secondary structures
- Catalan-like numbers and determinants
- Catalan, Motzkin, and Riordan numbers
- The random generation of directed animals
- Some statistics on Dyck paths
- A methodology for plane tree enumeration
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
- Inverse relations in Shapiro's open questions
- Enumeration of Łukasiewicz paths modulo some patterns
- Annular bounds for the zeros of a polynomial
- Graph-indexed random walks on pseudotrees
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- Taylor expansions for Catalan and Motzkin numbers
- The statistic ``number of udu's in Dyck paths
- The random generation of underdiagonal walks
- Some canonical sequences of integers
- A bijection on ordered trees and its consequences
- Narayana number, Chebyshev polynomial and Motzkin path on RNA abstract shapes
- Triangular sequences, combinatorial recurrences and linear difference equations
- Analytic properties of combinatorial triangles related to Motzkin numbers
- Exhaustive generation of some lattice paths and their prefixes
- A combinatorial bijection on \(k\)-noncrossing partitions
- Some statistics on generalized Motzkin paths with vertical steps
- Several explicit and recursive formulas for generalized Motzkin numbers
- On the generating functions of pattern-avoiding Motzkin paths
- Properties of Motzkin triangle and \(t\)-generalized Motzkin sequences
- Beyond Göllnitz' theorem. II: Arbitrarily many primary colors
- Raney numbers, threshold sequences and Motzkin-like paths
- A half-normal distribution scheme for generating functions
- Fibonacci determinants with Cameron's operator
- Peakless Motzkin paths with marked level steps at fixed height
- Effective algorithms for computing triangular operator in Schubert calculus
- Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity
- Motzkin paths, Motzkin polynomials and recurrence relations
- A Motzkin filter in the Tamari lattice
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
- On lattice paths with four types of steps
- Regular simple queues of protein contact maps
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
- Vertically constrained Motzkin-like paths inspired by bobbin lace
- Motzkin algebras
- On the number of pseudo-triangulations of certain point sets
- Logarithmic behavior of some combinatorial sequences
- Riordan paths and derangements
- Congruences for Catalan and Motzkin numbers and related sequences
- Ordered trees and the inorder traversal
- Why Delannoy numbers?
- Refined Chung-Feller theorems for lattice paths
- On geometry of the zeros of a polynomial
- On computing the total displacement number via weighted Motzkin paths
- Graph invertibility and median eigenvalues
- Developing a mathematical model for bobbin lace
- Deux propriétés combinatoires des nombres de Schröder
- Congruences of finite summations of the coefficients in certain generating functions
- scientific article; zbMATH DE number 6989305 (Why is no real title available?)
- Motzkin numbers: an operational point of view
- Motzkin and Catalan tunnel polynomials
- Enumerating Hamiltonian cycles
- ECO:a methodology for the enumeration of combinatorial objects
- Relative locations of subwords in free operated semigroups and Motzkin words.
- 0-Calabi-Yau configurations and finite Auslander-Reiten quivers of Gorenstein orders
- Enumerating restricted Dyck paths with context free grammars
- Taylor expansions for the generating function of Catalan-like numbers
- Colored Motzkin paths of higher order
- Mean value inequalities for Motzkin numbers
- Exact site-percolation probability on the square lattice
- scientific article; zbMATH DE number 7640026 (Why is no real title available?)
- Orthogonal polynomials approach to the Hankel transform of sequences based on Motzkin numbers
- Identities involving weighted Catalan, Schröder and Motzkin paths
- Two explicit formulas for the generalized Motzkin numbers
- Asymptotic estimate for the multinomial coefficients
- Motzkin paths with a restricted first return decomposition
- ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
- The Catalan simplicial set
- On the composition of an arbitrary collection of \(\mathrm{SU}(2)\) spins: an enumerative combinatoric approach
- Set partitions and non-crossing partitions with -neighbors and -isolated elements
- 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
- 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
- Hankel determinants of sums of consecutive Motzkin numbers
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)
