On the geometry of graph arrangements

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells using the theory of non broken circuit bases.
18 pages

Keywords

Combinatorics, Algebraic Geometry

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv