Title
Counting Integer Flows in Networks
Abstract
This paper discusses analytic algorithms and software for the enumeration of all integer flows inside a network. Concrete applications abound in graph theory, representation theory, and statistics. Our methods are based on the study of rational functions with poles on arrangements of hyperplanes; they surpass traditional exhaustive enumeration and can even yield formulas when the input data contains some parameters. We also discuss the calculation of chambers in detail because it is a necessary subroutine.
Year
DOI
Venue
2004
10.1007/s10208-003-0088-8
Foundations of Computational Mathematics
Keywords
Field
DocType
Integral flows,Flow polytopes,Lattice points,Rational function manipulation,Hyperplane arrangements,Residues,Transportation problems,Kostant partition function,Chambers
Integer,Subroutine,Mathematical analysis,Representation theory,Software,Hyperplane,Graph theory,Mathematical optimization,Algebra,Enumeration,Algorithm,Rational function,Mathematics
Journal
Volume
Issue
ISSN
4
3
1615-3375
Citations 
PageRank 
References 
8
0.81
8
Authors
3
Name
Order
Citations
PageRank
M. Welleda Baldoni-silva1141.62
J. A. De Loera2727.06
Michèle Vergne3598.21