Koroljuk's formula for counting lattice paths revisited

preprint2013arXivOpen access

Abstract

Koroljuk gave a summation formula for counting the number of lattice paths from (0,0)(0,0) to (m,n)(m,n) with (1,0),(0,1)(1,0), (0,1)-steps in the plane that stay strictly above the line y=k(x−d)y=k(x-d), where kk and dd are positive integers. In this paper we obtain an explicit formula for the number of lattice paths from (a,b)(a,b) to (m,n)(m,n) above the diagonal y=kx−ry=kx-r, where rr 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.