Riordan arrays and difference equations of subdiagonal lattice paths
From MaRDI portal
Publication:6203340
DOI10.1134/S0037446624020149OpenAlexW4393168148MaRDI QIDQ6203340FDOQ6203340
Publication date: 27 March 2024
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446624020149
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Additive difference equations (39A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Riordan group
- Recurrence relations for polynomial sequences via Riordan matrices
- Identities induced by Riordan arrays
- Linear recurrences with constant coefficients: The multivariate case
- Parametric Catalan numbers and Catalan triangles
- Generating trees and proper Riordan arrays
- Hipparchus, Plutarch, Schroder, and Hough
- Constant coefficient linear difference equations on the rational cones of the integer lattice
- Pascal triangles, Catalan numbers and renewal arrays
- The Cauchy Problem for Multidimensional Difference Equations in Lattice Cones
- Underdiagonal lattice paths with unrestricted steps
- Generating functions for vector partition functions and a basic recurrence relation
- Half of a Riordan array and restricted lattice paths
- Difference Equations and Generating Functions for some Lattice Path Problems
- Sections of the generating series of a solution to a difference equation in a simplicial cone
- Counting lattice paths by using difference equations with non-constant coefficients
This page was built for publication: Riordan arrays and difference equations of subdiagonal lattice paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203340)
