A combinatorial interpretation of the area of Schröder paths
Summary: An elevated Schröder path is a lattice path that uses the steps \((1,1)\), \((1,-1)\), and \((2,0)\), that begins and ends on the \(x\)-axis, and that remains strictly above the \(x\)-axis otherwise. The total area of elevated Schröder paths of length \(2n+2\) satisfies the recurrence \(f_{n+1}=6f_n-f_{n-1}\), \(n \geq 2\), with the initial conditions \(f_0=1\), \(f_1=7\). A combinatorial interpretation of this recurrence is given, by first introducing sets of unrestricted paths whose cardinality also satisfies the recurrence relation and then establishing a bijection between the set of these paths and the set of triangles constituting the total area of elevated Schröder paths.
- Limits of areas under lattice paths
- Bijective recurrences concerning Schröder paths
- Area of Catalan paths
- Some bijective results about the area of Schröder paths
- Non-uniform random generation of generalized Motzkin paths
- scientific article; zbMATH DE number 1196088 (Why is no real title available?)
- The combinatorial proofs of several recurrences about the enumeration of Schröder paths
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- Some linear recurrences and their combinatorial interpretation by means of regular languages
- A bijective approach to the area of generalized Motzkin paths
- Area of Catalan paths on a checkerboard
This page was built for publication: A combinatorial interpretation of the area of Schröder paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806355)
