Abstract
A formula for counting lattice paths in the plane from μ = (μ1, μ2) to λ = (λ1, λ2) which do not cross the lines y = x + d and y = x + c, where c, d ϵ Z and d >c, by descents and major index is given. The proof, which is purely combinatorial, uses a bijection on certain two-rowed tableaux. As applications, formulas for the joint distribution of Kolmogorov-Smirnov and run statistics are derived.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
