Abstract
We describe an involution on a set of sequences associated with lattice paths with north or east steps constrained to lie between two arbitrary boundaries. This involution yields recursions (from which determinantal formulas can be derived) for the number and area enumerator of such paths. An analogous involution can be defined for parking functions with arbitrary lower and upper bounds. From this involution, we obtained determinantal formulas for the number and sum enumerator of such parking functions. For parking functions, there is an alternate combinatorial inclusion–exclusion approach. The recursions also yield Appell relations. In certain special cases, these Appell relations can be converted into rational or algebraic generating functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
