The following pages link to Dyck path enumeration (Q1300974):
Displaying 50 items.
- All exponential moments of the Dyck paths' maxima (scaled by root of path length) are uniformly bounded: an elementary proof (Q261656) (← links)
- Equivalence classes of ballot paths modulo strings of length 2 and 3 (Q294567) (← links)
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths (Q394358) (← links)
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- Nonleft peaks in Dyck paths: a combinatorial approach (Q465280) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Enumeration of chains and saturated chains in Dyck lattices. (Q472925) (← links)
- Equivalence classes of Dyck paths modulo some statistics (Q488296) (← links)
- Some enumerations on non-decreasing Dyck paths (Q490298) (← links)
- Bounded height interlaced pairs of parking functions (Q512593) (← links)
- Dyck paths of knight moves (Q582294) (← links)
- A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths (Q618174) (← links)
- Counting strings at height \(j\) in Dyck paths (Q630940) (← links)
- On an involution on the Dyck paths (Q688700) (← links)
- On three and four vicious walkers (Q710757) (← links)
- Cycles in the graph of overlapping permutations avoiding barred patterns (Q727057) (← links)
- Generalized Dyck paths (Q757416) (← links)
- Counting humps in Motzkin paths (Q765354) (← links)
- Pattern distributions in Dyck paths with a first return decomposition constrained by height (Q776321) (← links)
- Counting upper interactions in Dyck paths (Q817946) (← links)
- Application of Faà di Bruno's formula in characterization of inverse relations (Q818249) (← links)
- Dyck paths and pattern-avoiding matchings (Q854822) (← links)
- Matrix identities on weighted partial Motzkin paths (Q875057) (← links)
- Area of Catalan paths on a checkerboard (Q875068) (← links)
- On directed lattice paths with vertical steps (Q897305) (← links)
- Rooted planar maps modulo some patterns (Q906462) (← links)
- A note on maxima in random walks (Q907270) (← links)
- Dyck paths with coloured ascents (Q925029) (← links)
- Lattice paths and generalized cluster complexes (Q958726) (← links)
- Seven (lattice) paths to log-convexity (Q970521) (← links)
- Skew Dyck paths (Q972821) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Pattern avoiding ballot paths and finite operator calculus (Q972837) (← links)
- The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 (Q976157) (← links)
- Minimal permutations with \(d\) descents (Q976167) (← links)
- Pattern avoidance in binary trees (Q986111) (← links)
- Staircase tilings and \(k\)-Catalan structures (Q998328) (← links)
- On the combinatorics of the Pfaff identity (Q1025474) (← links)
- Enumeration of strings in Dyck paths: A bijective approach (Q1025920) (← links)
- Identities involving Narayana polynomials and Catalan numbers (Q1043577) (← links)
- Partitions of a set satisfying certain set of conditions (Q1043979) (← links)
- On pairs of non-crossing generalized Dyck paths (Q1209653) (← links)
- Underdiagonal lattice paths with unrestricted steps (Q1283795) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Moments of Dyck paths (Q1300968) (← links)
- An involution on Dyck paths and its consequences (Q1300973) (← links)
- On the diagram of 132-avoiding permutations (Q1405003) (← links)
- Bicoloured Dyck paths and the contact polynomial for \(n\) non-intersecting paths in a half-plane lattice (Q1408540) (← links)
- Enumerating a class of lattice paths (Q1408864) (← links)
- Jumping succession rules and their generating functions (Q1408865) (← links)
