On the geometry of graph arrangements
Combinatorics
2007-05-23 v2 Algebraic Geometry
Abstract
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.
Cite
@article{arxiv.math/0412130,
title = {On the geometry of graph arrangements},
author = {C. De Concini and C. Procesi},
journal= {arXiv preprint arXiv:math/0412130},
year = {2007}
}
Comments
18 pages