Partial skew Dyck paths: a kernel method approach
From MaRDI portal
Abstract: Skew Dyck are a variation of Dyck paths, where additionally to steps and a south-west step is also allowed, provided that the path does not intersect itself. Replacing the south-west step by a red south-east step, we end with decorated Dyck paths. We analyze partial versions of them where the path ends on a fixed level , not necessarily at level 0. We exclusively use generating functions and derive them with the celebrated kernel method. In the second part of the paper, a dual version is studied, where the paths are read from right to left. In this way, we have two types of up-steps, not two types of down-steps, as before. A last section deals with the variation that the negative territory (below the -axis) is also allowed. Surprisingly, this is more involved in terms of computations.
Recommendations
Cites work
Cited in
(11)- Prefixes of bargraph paths
- S-Motzkin paths with catastrophes and air pockets
- Skew Dyck paths without up–down–left
- On pairs of non-crossing generalized Dyck paths
- Partial Dyck paths with Air Pockets
- Fibonacci and Catalan paths in a wall
- Skew Dyck paths, area, and superdiagonal bargraphs
- Dispersed Dyck paths revisited
- Skew Dyck paths having no peaks at level 1
- Letters of a given size in Catalan words
- Skew Dyck Paths With Catastrophes
This page was built for publication: Partial skew Dyck paths: a kernel method approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163802)