More on discrete convexity
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.