10 citations · 14 across the 4 of their papers we have counts for
Showing 2004Show all
2 papers · 1 filter
math.CO2004★ 2 cited
On the geometry of graph arrangements
C. De Concini, C. Procesi
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…
math.AG2004★ 10 cited
Nested sets and Jeffrey Kirwan cycles
Corrado De Concini, Claudio Procesi
For the complement of a hyperplane arrangement we construct a dual homology basis to the no broken circuit basis of cohomology. This is based on the theory of wonderful embeddings…