Counting integer flows in networks (Q1767489)
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: Counting integer flows in networks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting integer flows in networks |
scientific article |
Statements
Counting integer flows in networks (English)
0 references
11 March 2005
0 references
Integral flows
0 references
Flow polytopes
0 references
Lattice points
0 references
Rational function manipulation
0 references
Hyperplane arrangements
0 references
Residues
0 references
Transportation problems
0 references
Kostant partition function
0 references
Chambers
0 references
0.7315680384635925
0 references
0.7211467027664185
0 references
0.720768928527832
0 references
0.7172684669494629
0 references
