Counting Integer flows in Networks

Simple item page
dc.creatorBaldoni-Silva, W.
dc.creatorDe Loera, J. A.
dc.creatorVergne, M.
dc.date2003-03-19
dc.date.accessioned2026-07-07T04:56:11Z
dc.date.available2026-07-07T04:56:11Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/math/0303228
dc.identifierhttp://arxiv.org/abs/math/0303228
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66830
dc.subjectCombinatorics
dc.subject52B
dc.titleCounting Integer flows in Networks
dc.typetext

Files

Collections

arXiv