Discrete convexity and unimodularity. I.
Vladimir I. Danilov (danilovcemi.rssi.ru)
Abstract: In this article we introduce a theory of convexity for the lattices of integer points, which we call a theory of discrete convexity. In particular, we obtain generalizations of Edmonds' polymatroid intersection theorem and the Hoffman-Kruskal theorem as consequences of our constructions.
Keywords: pure systems, unimodular systems, polymatroids, dicing, laminarization
Category 1: Combinatorial Optimization (Polyhedra )
Category 2: Combinatorial Optimization (Graphs and Matroids )
Citation: Advances in Mathematics (to appear)
Entry Submitted: 03/15/2001
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|