Counting Integer flows in Networks
Skip to main content
eScholarship
Open Access Publications from the University of California

Counting Integer flows in Networks

  • Author(s): Baldoni-Silva, W.
  • De Loera, J. A.
  • Vergne, M.
  • et al.

Published Web Location

https://arxiv.org/pdf/math/0303228.pdf
No data is associated with this publication.
Abstract

This paper discusses new analytic algorithms and software for the enumeration of all integer flows inside a network. Concrete applications abound in graph theory \cite{Jaeger}, representation theory \cite{kirillov}, and statistics \cite{persi}. Our methods clearly surpass traditional exhaustive enumeration and other algorithms and can even yield formulas when the input data contains some parameters. These methods are based on the study of rational functions with poles on arrangements of hyperplanes.

Item not freely available? Link broken?
Report a problem accessing this item