A Continuous Analogue of Lattice Path Enumeration

  • Quang-Nhat Le
  • Sinai Robins
  • Christophe Vignat
  • Tanay Wakhare


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.  

Article Number