Cargando…
Counting lattice paths using Fourier methods
This monograph introduces a novel and effective approach to counting lattice paths by using the discrete Fourier transform (DFT) as a type of periodic generating function. Utilizing a previously unexplored connection between combinatorics and Fourier analysis, this method will allow readers to move...
Autores principales: | Ault, Shaun, Kicey, Charles |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2019
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-030-26696-7 http://cds.cern.ch/record/2691302 |
Ejemplares similares
-
Lattice path counting and applications
por: Mohanty, Gopal, et al.
Publicado: (1980) -
Major counting of nonintersecting lattice paths and generating functions for tableaux
por: Krattenthaler, C
Publicado: (1995) -
Lattice path combinatorics and applications
por: Andrews, George, et al.
Publicado: (2019) -
Lattice path combinatorics with statistical applications
por: Narayana, TV
Publicado: (1979) -
Probabilistic diophantine approximation: randomness in lattice point counting
por: Beck, József
Publicado: (2014)