Kazuo Murota, Akihisa Tamura
Published 2023-12-04Version 1
This short note gives an elementary alternative proof for a theorem of Danilov and Koshevoy on Minkowski summation and unimodularity in discrete convex analysis. It is intended to disseminate this fundamental theorem and make its proof accessible to researchers in optimization and operations research.
Sets with no solutions to $x+y=3z$
Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis
Discrete Convex Analysis: A Tool for Economics and Game Theory
![QR code for arXiv:2312.01822 [math.CO]](http://oss.arxitics.com/images/favicon.svg)