• Source: Delannoy number

In mathematics, a Delannoy number



D


{\displaystyle D}

counts the paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (m, n), using only single steps north, northeast, or east. The Delannoy numbers are named after French army officer and amateur mathematician Henri Delannoy.
The Delannoy number



D
(
m
,
n
)


{\displaystyle D(m,n)}

also counts the global alignments of two sequences of lengths



m


{\displaystyle m}

and



n


{\displaystyle n}

, the points in an m-dimensional integer lattice or cross polytope which are at most n steps from the origin, and, in cellular automata, the cells in an m-dimensional von Neumann neighborhood of radius n.




Example


The Delannoy number D(3, 3) equals 63. The following figure illustrates the 63 Delannoy paths from (0, 0) to (3, 3):

The subset of paths that do not rise above the SW–NE diagonal are counted by a related family of numbers, the Schröder numbers.




Delannoy array


The Delannoy array is an infinite matrix of the Delannoy numbers:

In this array, the numbers in the first row are all one, the numbers in the second row are the odd numbers, the numbers in the third row are the centered square numbers, and the numbers in the fourth row are the centered octahedral numbers. Alternatively, the same numbers can be arranged in a triangular array resembling Pascal's triangle, also called the tribonacci triangle, in which each number is the sum of the three numbers above it:

1
1 1
1 3 1
1 5 5 1
1 7 13 7 1
1 9 25 25 9 1
1 11 41 63 41 11 1




Central Delannoy numbers


The central Delannoy numbers D(n) = D(n, n) are the numbers for a square n × n grid. The first few central Delannoy numbers (starting with n = 0) are:

1, 3, 13, 63, 321, 1683, 8989, 48639, 265729, ... (sequence A001850 in the OEIS).




Computation






= Delannoy numbers

=
For



k


{\displaystyle k}

diagonal (i.e. northeast) steps, there must be



m
−
k


{\displaystyle m-k}

steps in the



x


{\displaystyle x}

direction and



n
−
k


{\displaystyle n-k}

steps in the



y


{\displaystyle y}

direction in order to reach the point



(
m
,
n
)


{\displaystyle (m,n)}

; as these steps can be performed in any order, the number of such paths is given by the multinomial coefficient







(



m
+
n
−
k


k
,
m
−
k
,
n
−
k



)



=



(



m
+
n
−
k

m


)






(


m
k


)





{\displaystyle {\binom {m+n-k}{k,m-k,n-k}}={\binom {m+n-k}{m}}{\binom {m}{k}}}

. Hence, one gets the closed-form expression




D
(
m
,
n
)
=

∑

k
=
0


min
(
m
,
n
)





(



m
+
n
−
k

m


)






(


m
k


)



.


{\displaystyle D(m,n)=\sum _{k=0}^{\min(m,n)}{\binom {m+n-k}{m}}{\binom {m}{k}}.}


An alternative expression is given by




D
(
m
,
n
)
=

∑

k
=
0


min
(
m
,
n
)





(


m
k


)






(


n
k


)




2

k




{\displaystyle D(m,n)=\sum _{k=0}^{\min(m,n)}{\binom {m}{k}}{\binom {n}{k}}2^{k}}


or by the infinite series




D
(
m
,
n
)
=

∑

k
=
0


∞




1

2

k
+
1







(


k
n


)






(


k
m


)



.


{\displaystyle D(m,n)=\sum _{k=0}^{\infty }{\frac {1}{2^{k+1}}}{\binom {k}{n}}{\binom {k}{m}}.}


And also




D
(
m
,
n
)
=

∑

k
=
0


n


A
(
m
,
k
)
,


{\displaystyle D(m,n)=\sum _{k=0}^{n}A(m,k),}


where



A
(
m
,
k
)


{\displaystyle A(m,k)}

is given with (sequence A266213 in the OEIS).
The basic recurrence relation for the Delannoy numbers is easily seen to be




D
(
m
,
n
)
=


{



1



if

m
=
0

or

n
=
0




D
(
m
−
1
,
n
)
+
D
(
m
−
1
,
n
−
1
)
+
D
(
m
,
n
−
1
)



otherwise









{\displaystyle D(m,n)={\begin{cases}1&{\text{if }}m=0{\text{ or }}n=0\\D(m-1,n)+D(m-1,n-1)+D(m,n-1)&{\text{otherwise}}\end{cases}}}


This recurrence relation also leads directly to the generating function





∑

m
,
n
=
0


∞


D
(
m
,
n
)

x

m



y

n


=
(
1
−
x
−
y
−
x
y

)

−
1


.


{\displaystyle \sum _{m,n=0}^{\infty }D(m,n)x^{m}y^{n}=(1-x-y-xy)^{-1}.}





= Central Delannoy numbers

=
Substituting



m
=
n


{\displaystyle m=n}

in the first closed form expression above, replacing



k
↔
n
−
k


{\displaystyle k\leftrightarrow n-k}

, and a little algebra, gives




D
(
n
)
=

∑

k
=
0


n





(


n
k


)






(



n
+
k

k


)



,


{\displaystyle D(n)=\sum _{k=0}^{n}{\binom {n}{k}}{\binom {n+k}{k}},}


while the second expression above yields




D
(
n
)
=

∑

k
=
0


n






(


n
k


)




2



2

k


.


{\displaystyle D(n)=\sum _{k=0}^{n}{\binom {n}{k}}^{2}2^{k}.}


The central Delannoy numbers satisfy also a three-term recurrence relationship among themselves,




n
D
(
n
)
=
3
(
2
n
−
1
)
D
(
n
−
1
)
−
(
n
−
1
)
D
(
n
−
2
)
,


{\displaystyle nD(n)=3(2n-1)D(n-1)-(n-1)D(n-2),}


and have a generating function





∑

n
=
0


∞


D
(
n
)

x

n


=
(
1
−
6
x
+

x

2



)

−
1

/

2


.


{\displaystyle \sum _{n=0}^{\infty }D(n)x^{n}=(1-6x+x^{2})^{-1/2}.}


The leading asymptotic behavior of the central Delannoy numbers is given by




D
(
n
)
=



c


α

n




n




(
1
+
O
(

n

−
1


)
)


{\displaystyle D(n)={\frac {c\,\alpha ^{n}}{\sqrt {n}}}\,(1+O(n^{-1}))}


where




α
=
3
+
2


2


≈
5.828


{\displaystyle \alpha =3+2{\sqrt {2}}\approx 5.828}


and




c
=
(
4
π
(
3


2


−
4
)

)

−
1

/

2


≈
0.5727


{\displaystyle c=(4\pi (3{\sqrt {2}}-4))^{-1/2}\approx 0.5727}

.




See also


Motzkin number
Narayana number
Schroder-Hipparchus number
Schroder number




References






External links


Weisstein, Eric W. "Delannoy Number". MathWorld.

Kata Kunci Pencarian:

• Film Terbaik (BAFTA)
• Delannoy number
• 63 (number)
• Catalan number
• Dynamic time warping
• 300 (number)
• Binomial coefficient
• Motzkin number
• Fibonacci sequence
• Natural number
• Von Neumann neighborhood