Add to ORKGWe present here a survey of most notable Delannoy's works. These works are related to lattice paths enumeration, to the so-called Delannoy numbers, and were the rst general way to solve Ballot-like problems. We also give a tentative short biography
Centralna Delannoyeva števila $(d_n)_{n ge 0} = 1, 3, 13, 63, 321, 1683, 8989, ldots$ preštejejo pot...
A lattice path is called \emph{Delannoy} if its every step belongs to $\left\{N, E, D\right\}$, wher...
Abstractn-dimensional lattice paths which do not touch the hyperplanes xi − xi+1=⇔-1,i = 1,2,…,n − 1...
Abstract. This article is not a research paper, but a little note on the history of combinatorics: W...
A preliminary version of this article constituted a part of Cryil Banderier's talk at the conference...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
A preferential arrangement on [ [ n ] ] = { 1 , 2 , … , n } is a ranking of the ele...
Fix nonnegative integers n1 , . . ., nd, and let L denote the lattice of points (a1 , . . ., ad) ∈ ℤ...
(A001850 of The On-Line Encyclopedia of Integer Sequences) will be defined so that dn counts the lat...
AbstractLattice chains and Delannoy paths represent two different ways to progress through a lattice...
Fix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd satisf...
Knowledge about combinatorics, fractals, generation of form, graph theory, nested patterns, recursio...
AbstractFix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd...
The Delannoy number D(x,y) is the number of ways to reach point {x,y}, starting at the origin, by a ...
The Delannoy number D(x,y) is the number of ways to reach point {x,y}, starting at the origin, by a ...
Centralna Delannoyeva števila $(d_n)_{n ge 0} = 1, 3, 13, 63, 321, 1683, 8989, ldots$ preštejejo pot...
A lattice path is called \emph{Delannoy} if its every step belongs to $\left\{N, E, D\right\}$, wher...
Abstractn-dimensional lattice paths which do not touch the hyperplanes xi − xi+1=⇔-1,i = 1,2,…,n − 1...
Abstract. This article is not a research paper, but a little note on the history of combinatorics: W...
A preliminary version of this article constituted a part of Cryil Banderier's talk at the conference...
In this bachelor thesis, we introduce the Catalan, Schröder, Motzkin, Narayana and Delannoy numbers....
A preferential arrangement on [ [ n ] ] = { 1 , 2 , … , n } is a ranking of the ele...
Fix nonnegative integers n1 , . . ., nd, and let L denote the lattice of points (a1 , . . ., ad) ∈ ℤ...
(A001850 of The On-Line Encyclopedia of Integer Sequences) will be defined so that dn counts the lat...
AbstractLattice chains and Delannoy paths represent two different ways to progress through a lattice...
Fix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd satisf...
Knowledge about combinatorics, fractals, generation of form, graph theory, nested patterns, recursio...
AbstractFix nonnegative integers n1,…,nd and let L denote the lattice of integer points (a1,…,ad)∈Zd...
The Delannoy number D(x,y) is the number of ways to reach point {x,y}, starting at the origin, by a ...
The Delannoy number D(x,y) is the number of ways to reach point {x,y}, starting at the origin, by a ...
Centralna Delannoyeva števila $(d_n)_{n ge 0} = 1, 3, 13, 63, 321, 1683, 8989, ldots$ preštejejo pot...
A lattice path is called \emph{Delannoy} if its every step belongs to $\left\{N, E, D\right\}$, wher...
Abstractn-dimensional lattice paths which do not touch the hyperplanes xi − xi+1=⇔-1,i = 1,2,…,n − 1...