Abstract
Extending the 'walks' of van Lint and Wilson, we introduce a new kind of weighted lattice paths and show that the number of lattice paths with weight ν + m - 1 (0 ≤ m ≤ ν - 1) equals the number of n-colour compositions of ν. Two new binomial identities with their combinatorial meaning are also obtained. © 2007.
Author supplied keywords
Cite
CITATION STYLE
APA
Narang, G., & Agarwal, A. K. (2008). Lattice paths and n-colour compositions. Discrete Mathematics, 308(9), 1732–1740. https://doi.org/10.1016/j.disc.2007.04.022
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free