More on discrete convexity
Combinatorics
2024-02-05 v3
Abstract
In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some discrete objects that share this property and provide several examples of convex families related to graphs and to two-person games in normal form.
Cite
@article{arxiv.2306.10948,
title = {More on discrete convexity},
author = {Vladimir Gurvich and Mariya Naumova},
journal= {arXiv preprint arXiv:2306.10948},
year = {2024}
}