Abstract
Koroljuk gave a summation formula for counting the number of lattice paths from to with -steps in the plane that stay strictly above the line , where and are positive integers. In this paper we obtain an explicit formula for the number of lattice paths from to above the diagonal , where is a rational number. Our result slightly generalizes Koroljuk's formula, while the former can be essentially derived from the latter. However, our proof uses a recurrence with respect to the starting points, and hereby presents a new approach to Koroljuk's formula.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.