AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattice, called by minimal lattice paths, from (0,0) to a point (n, m) restricted by two parallel lines with an incline k (⩾0). We express the generating functions of the number of these distinct minimal lattice paths in terms of the polynomials ϕk(n, x) = ∑l = 0[nk]n − kll(−x)l, n⩾)Formulas obtained thus include the generating function of the so-called higher Catalan number Ck(n) or Ballot numbers as the special case.The number of minimal lattice paths for k=1 is given as an explicit form by expanding the corresponding generating function
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...
AbstractA weighted lattice path from (1, 1) to (n, m) is a path consisting of unit vertical, horizon...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
AbstractThe paper deals with minimal lattice paths from the origin to a point (n,m) which do not cro...
AbstractIf α = {α0, α1,…, αn} and β = {β0, β1,…, βn} are two non-decreasing sets of integers such th...
AbstractA lattice path is a path on lattice points (points with integer coordinates) in the plane in...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
In the present paper, a lattice path in the nonnegative orthant in the $ (k+1) $-dimensional integer...
AbstractIn this paper, restricted minimal lattice paths with horizontal, vertical, and diagonal step...
Colloque avec actes et comité de lecture. internationale.International audienceWe present a method, ...
AbstractThe number of lattice paths of fixed length consisting of unit steps in the north, south, ea...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...
AbstractA weighted lattice path from (1, 1) to (n, m) is a path consisting of unit vertical, horizon...
AbstractWe deal with non-decreasing paths on the non-negative quadrant of the integral square lattic...
AbstractThe paper deals with minimal lattice paths from the origin to a point (n,m) which do not cro...
AbstractIf α = {α0, α1,…, αn} and β = {β0, β1,…, βn} are two non-decreasing sets of integers such th...
AbstractA lattice path is a path on lattice points (points with integer coordinates) in the plane in...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
In the present paper, a lattice path in the nonnegative orthant in the $ (k+1) $-dimensional integer...
AbstractIn this paper, restricted minimal lattice paths with horizontal, vertical, and diagonal step...
Colloque avec actes et comité de lecture. internationale.International audienceWe present a method, ...
AbstractThe number of lattice paths of fixed length consisting of unit steps in the north, south, ea...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
We give bijective proofs that, when combined with one of the combinatorial proofs of the general bal...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
In this note we examine the number of integer lattice paths consisting of up-steps (1, 1) and down-s...
AbstractA weighted lattice path from (1, 1) to (n, m) is a path consisting of unit vertical, horizon...