A Continuous Analogue of Lattice Path Enumeration
Keyword(s):
Following the work of Cano and Díaz, we consider a continuous analog of lattice path enumeration. This process allows us to define a continuous version of many discrete objects that count certain types of lattice paths. As an example of this process, we define continuous versions of binomial and multinomial coefficients, and describe some identities and partial differential equations that they satisfy. Finally, as an important byproduct of these continuous analogs, we illustrate a general method to recover discrete combinatorial quantities from their continuous analogs, via an application of the Khovanski-Puklikov discretizing Todd operators.
2002 ◽
Vol 13
(5)
◽
pp. 567-585
◽
1931 ◽
Vol 2
(4)
◽
pp. 205-219
◽
2016 ◽
Vol 30
(28n29)
◽
pp. 1640003
◽
1879 ◽
Vol s1-11
(1)
◽
pp. 72-83
2017 ◽
Vol 29
(1)
◽
pp. 78-117
◽
1985 ◽
Vol 27
(1)
◽
pp. 73-87
◽
1932 ◽
Vol 51
◽
pp. 176-189
◽
1877 ◽
Vol s1-9
(1)
◽
pp. 76-90