Higher dimensional restricted lattice paths with diagonal steps

DOI10.1016/0166-218X(91)90055-2zbMath0754.05004MaRDI QIDQ1175795

H. Raghav Rao, Shashidhar Kaparthi

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Delannoy numbers; Andre's reflection principle; restricted lattice paths

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

Related Items

A reduction theorem for Dade's projective conjecture, An information and preference theory approach to a discrete resource allocation problem, \(P\)-orderings of finite subsets of Dedekind domains, Two schemes for information acquisition: An entropic assessment, S-arrangements with repetitions, From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns, Counting lattice chains and Delannoy paths in higher dimensions, A note on lattice chains and Delannoy numbers, Why Delannoy numbers?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of higher-dimensional paths under restrictions
• Higher dimensional lattice paths with diagonal steps
• Andre's reflection proof generalized to the many-candidate ballot problem
• Discrete Mathematics in Voting and Group Choice
• Some Monotonicity Properties of Partial Orders