Counting lattice paths using Fourier methods

DOI10.1007/978-3-030-26696-7MaRDI QIDQ5228812zbMATH OpenOpenAlexFDO

Authors Shaun V. Ault, Charles Kicey

Publication date 13 August 2019

Published in Applied and Numerical Harmonic Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-26696-7

zbMATH Keywords

algebraic properties of the discrete Fourier transformperiodic generating function

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to harmonic analysis on Euclidean spaces (42-02) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)

Recommendations

• Discrete calculus. Methods for counting
• Counting with symmetric functions
• scientific article; zbMATH DE number 51453
• Combinatorics, Second Edition
• Introduction to enumerative and analytic combinatorics. With a foreword by Richard Stanley

Cited in

(4)

• Combinatorics of a discrete trajectory space for robot motion planning
• Lattice paths in corridors and cyclic corridors
• Lattice path combinatorics and special counting sequences. From an enumerative perspective
• Enumeration of lattice paths using vieta polynomials

This page was built for publication: Counting lattice paths using Fourier methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228812)