On the geometry of graph arrangements
classification
🧮 math.CO
math.AG
keywords
discussarrangementsbasesbrokencellscircuitcorrespondingcounting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.