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 numbersAndre's reflection principlerestricted lattice paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (9)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher dimensional restricted lattice paths with diagonal steps