Separation of two convex sets in convexity structures (Q1331267): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Separation of two convex sets in convexity spaces and in straight line spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with intrinsic s3 convexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Helly theorem in weakly modular space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-modular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity spaces. II: Separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric subgraphs of Hamming graphs and d-convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-preserving subgraphs of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4069907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general set-separation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ternary spaces, media, and Chebyshev sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subbases, convex sets, and hyperspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Helly property working as a compactness criterion on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collapse of the metric hierarchy for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for invariance of set diameters under d-convexification in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3310512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Convexities and Distributive Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank

Latest revision as of 16:22, 22 May 2024

scientific article
Language Label Description Also known as
English
Separation of two convex sets in convexity structures
scientific article

    Statements

    Separation of two convex sets in convexity structures (English)
    0 references
    0 references
    19 February 1995
    0 references
    The well known notion of convex structure is a generalization of the classical notion of convexity in affine spaces: Let \(X\) be a nonempty set and \({\mathcal C}\) a collection of its subsets. The pair \((X, {\mathcal C})\) is a convex structure (called also a convexity structure) provided that \(\emptyset, X \in {\mathcal C}\) and \({\mathcal C}\) is closed under intersection of arbitrary subfamilies. The paper presents a survey of various classes of convexity structures, such as alignments, \(n\)-ary convexities, interval convexities. Its main purpose is to characterize \(S_ 4\)-convexity structures, i.e., structures satisfying the following axiom \(S_ 4\): any two disjoint sets \(A,B \in {\mathcal C}\) can be separated by a half-space. (A set \(H\) is a half-space provided that both \(H\) and \(X \backslash H\) belong to \(C)\). The abstract is unclear.
    0 references
    \(n\)-ary convexity
    0 references
    interval-convexity
    0 references
    separation
    0 references
    convexity structures
    0 references
    alignments
    0 references

    Identifiers