On the geometry of graph arrangements

Simple item page
dc.creatorDe Concini, C.
dc.creatorProcesi, C.
dc.date2004-12-07
dc.date2004-12-14
dc.date.accessioned2026-07-07T05:15:01Z
dc.date.available2026-07-07T05:15:01Z
dc.descriptionWe 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.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/math/0412130
dc.identifierhttp://arxiv.org/abs/math/0412130
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73503
dc.subjectCombinatorics
dc.subjectAlgebraic Geometry
dc.titleOn the geometry of graph arrangements
dc.typetext

Files

Collections

arXiv