Pages that link to "Item:Q1175795"
From MaRDI portal
The following pages link to Higher dimensional restricted lattice paths with diagonal steps (Q1175795):
Displaying 9 items.
- A reduction theorem for Dade's projective conjecture (Q522510) (← links)
- An information and preference theory approach to a discrete resource allocation problem (Q807607) (← links)
- \(P\)-orderings of finite subsets of Dedekind domains (Q835655) (← links)
- Two schemes for information acquisition: An entropic assessment (Q1328045) (← links)
- S-arrangements with repetitions (Q1598448) (← links)
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
- Counting lattice chains and Delannoy paths in higher dimensions (Q2275403) (← links)
- A note on lattice chains and Delannoy numbers (Q2427526) (← links)
- Why Delannoy numbers? (Q2568419) (← links)
