, , , ,
The paper "More on discrete convexity" by Vladimir Gurvich and Mariya Naumova delves into the extension of concepts from convex analysis to discrete sets. The authors build upon previous research in this area to explore the relationship between local and global minima in convex functions and how this property extends to certain discrete objects. They focus on identifying discrete objects that exhibit similar properties to convex functions, particularly in relation to graphs and two-person games in normal form. In a significant contribution, the authors introduce the concept of very weakly hereditary families within the context of convexity. This modification is explored further in specific subsections of the paper, highlighting its relevance and implications for understanding discrete convexity. The paper also discusses various examples related to directed and non-directed graphs, complete edge-chromatic graphs, and two-person game forms. By surveying known results and deriving new ones, the authors provide valuable insights into the application of discrete convexity in different domains. Notably, they discuss the modular decomposition of Π- and ∆-free d-graphs and its significance in positional n-person games modelled by trees. Furthermore, "More on discrete convexity" touches upon the intriguing ∆-conjecture which posits that all CIS d-graphs are Gallai's or do not contain ∆ as a subgraph. This conjecture has important implications for understanding graph structures within the context of discrete convexity. Overall, "More on discrete convexity" offers a comprehensive exploration of extending convex analysis concepts to discrete sets, providing valuable insights into the properties of discrete objects related to graphs and two-person games. The paper contributes significantly to advancing our understanding of convexity principles in a discrete setting.
Summary- The paper looks at how certain math ideas can be applied to groups of things that are separate.
- It talks about how the smallest and biggest points in certain math shapes are connected, even when the shapes are made of separate parts.
- The authors introduce a new idea called very weakly hereditary families in this math context.
- They talk about different examples involving different kinds of graphs and games for two people.
- The paper also mentions something called the ∆-conjecture which helps us understand how shapes are connected in math.
Definitions
- Convex analysis: A type of math that deals with specific shapes where any line connecting two points on the shape lies entirely within the shape.
- Discrete sets: Groups of separate items or objects that can be counted individually.
- Hereditary: Something passed down from one generation to another or related through family ties.
- Graphs: Diagrams showing connections between different points or nodes using lines and vertices.
- Conjecture: An educated guess or theory based on evidence but not proven yet.
Introduction:
The concept of convexity has been extensively studied in mathematics and has found applications in various fields such as optimization, economics, and game theory. Convex functions are characterized by their unique global minimum, which is also a local minimum. In recent years, there has been a growing interest in extending the principles of convex analysis to discrete sets. This paper by Vladimir Gurvich and Mariya Naumova titled "More on discrete convexity" explores this extension further and provides valuable insights into the properties of discrete objects related to graphs and two-person games.
Background:
The authors begin by providing an overview of previous research on discrete convexity, highlighting its relevance in different domains. They then introduce the concept of very weakly hereditary families within the context of convexity. This modification is explored further in specific subsections of the paper, emphasizing its significance for understanding discrete convexity.
Local and Global Minima:
One of the key contributions of this paper is its exploration of the relationship between local and global minima in convex functions and how this property extends to certain discrete objects. The authors discuss various examples related to directed and non-directed graphs, complete edge-chromatic graphs, and two-person game forms. By surveying known results and deriving new ones, they provide valuable insights into the application of discrete convexity in different domains.
Modular Decomposition:
In another significant contribution, "More on discrete convexity" discusses modular decomposition within the context of Π- and ∆-free d-graphs. The authors highlight its importance in positional n-person games modelled by trees.
∆-Conjecture:
The article also touches upon an intriguing conjecture known as ∆-conjecture which states that all CIS d-graphs are either Gallai's or do not contain ∆ as a subgraph. This conjecture has important implications for understanding graph structures within the context of discrete convexity.
Conclusion:
In conclusion, "More on discrete convexity" offers a comprehensive exploration of extending convex analysis concepts to discrete sets. The paper provides valuable insights into the properties of discrete objects related to graphs and two-person games, making significant contributions to advancing our understanding of convexity principles in a discrete setting. Further research in this area has the potential to lead to new applications and developments in various fields.
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.
