Generating functions for the number of lattice paths restricted by two parallel hyperplanes (Q1209657)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating functions for the number of lattice paths restricted by two parallel hyperplanes |
scientific article; zbMATH DE number 168243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating functions for the number of lattice paths restricted by two parallel hyperplanes |
scientific article; zbMATH DE number 168243 |
Statements
Generating functions for the number of lattice paths restricted by two parallel hyperplanes (English)
0 references
16 May 1993
0 references
The following enumeration problem is considered: What is the number of lattice paths in the non-negative orthant of the \((k+1)\)-dimensional integer lattice between the origin and an arbitrary lattice point, if the paths must stay between two parallel hyperplanes of rational normal vectors. The corresponding generating function is shown to be a rational function in \(k\) variables.
0 references
enumeration problem
0 references
lattice paths
0 references
generating function
0 references
0.9188628
0 references
0.9066236
0 references
0.9015635
0 references
0.89042693
0 references
0.88639784
0 references
