Lattice path combinatorics for multiple product identities
DOI10.1016/J.JSPI.2010.01.017zbMATH Open1204.05014OpenAlexW1964990144WikidataQ60692250 ScholiaQ60692250MaRDI QIDQ972824FDOQ972824
Authors: Larry Ericksen 
Publication date: 21 May 2010
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2010.01.017
Recommendations
- Generalizing Delannoy numbers via counting weighted lattice paths
- On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths
- scientific article; zbMATH DE number 7199605
- A generalization of Lucas polynomial sequence
- scientific article
generating functionlattice pathChebyshev polynomialrecursionFibonacci numberJacobi polynomialLucas numbertheta functionLegendre polynomialJacobi triple productdelannoy numberWatson quintuple productZernike polynomialSchröder number
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primality testing and prime constellations
- Title not available (Why is that?)
- Golden tuple products
- Multiple product identities: balanced weights, thetas, finite gold
- Title not available (Why is that?)
- Combinatorial trigonometry with Chebyshev polynomials
- A new proof of Windquist's identity
- Iterated digit sums, recursions and primality
Cited In (4)
Uses Software
This page was built for publication: Lattice path combinatorics for multiple product identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972824)
