A continuous analogue of lattice path enumeration

Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions of binomials and multinomials, and describe some identities and partial differential equations they satisfy. Finally, we illustrate a general process to recover discrete combinatorial quantities from their continuous analogs.
Comment: 10 pages