Discrete convexity and unimodularity. I.

Vladimir I. Danilov (danilovcemi.rssi.ru)
Gleb A. Koshevoy (koshevoyserv2.cemi.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)

Download: [PDF]

Entry Submitted: 03/15/2001
Entry Accepted: 03/15/2001
Entry Last Modified: 03/15/2001

Modify/Update this entry