Subword patterns in smooth words
From MaRDI portal
Cites work
- A combinatorial proof of a recursive relation of the Motzkin sequence by lattice paths
- Bijective recurrences for Motzkin paths
- Catalan Numbers
- Catalan words avoiding pairs of length three patterns
- Consecutive patterns in Catalan words and the descent distribution
- Counting \(l\)-letter subwords in compositions
- Counting peaks and valleys in \(k\)-colored Motzkin paths
- Counting strings in Dyck paths
- Counting subword patterns in Catalan words
- Counting subwords in a partition of a set
- Descent distribution on Catalan words avoiding a pattern of length at most three
- Determinant identities for the Catalan, Motzkin and Schröder numbers
- Dyck path enumeration
- Enumeration of r-smooth words over a finite alphabet
- Enumeration of smooth inversion sequences and proof of a recent related conjecture
- General results on the enumeration of strings in Dyck paths
- scientific article; zbMATH DE number 2186880 (Why is no real title available?)
- scientific article; zbMATH DE number 2186895 (Why is no real title available?)
- scientific article; zbMATH DE number 1919509 (Why is no real title available?)
- Identities from weighted Motzkin paths
- Kernel method and linear recurrence system
- Motzkin numbers
- Motzkin paths with a restricted first return decomposition
- Peaks and valleys in Motzkin paths
- Smooth compositions and smooth words
This page was built for publication: Subword patterns in smooth words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034001)
