Counting Integer flows in Networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Combinatorics, 52B

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/66830

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0303228
 http://arxiv.org/abs/math/0303228

Collections

arXiv