Known properties of ‘‘canonical connections’’ from database theory and of ‘‘closed sets’’ from statistics implicitly define a hypergraph convexity, here called canonical convexity (cconvexity), and provide an efficient algorithm to compute c-convex hulls. We characterize the class of hypergraphs in which c-convexity enjoys the Minkowski–Krein–Milman property. Moreover, we compare c-convexity wi...

Let A and B be C∗-algebras. We consider a noncommutative convexity in Hilbert A -B-bimodules, called A -B-convexity, as a generalization of C∗-convexity in C∗-algebras. We show that if X is a Hilbert A -B-bimodule, then Mn(X ) is a Hilbert Mn(A )-Mn(B)-bimodule and apply it to show that the closed unit ball of every Hilbert A -B-bimodule is A -B-convex. Some properties of this kind of convexity...

Convexity invariants like Caratheodory, Helly and Radon numbers are computed for triangle path convexity in graphs. Unlike minimal path convexities, the Helly and Radon numbers behave almost uniformly for triangle path convexity. c © 1999 Elsevier Science B.V. All rights reserved

Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...

The generalized state space of a commutative C-algebra, denoted SH(C(X)), is the set of positive unital maps from C(X) to the algebra B(H) of bounded linear operators on a Hilbert space H. C-convexity is one of several non-commutative analogs of convexity which have been discussed in this context. In this paper we show that a C-extreme point of SH(C(X)) satisfies a certain spectral condition on...

Convexity is a classical idea. Archimedes used a version of convexity in his considerations of arc length. Yet the idea was not formalized until 1934 in the monograph of Bonneson and Fenchel [BOF]. The classical definition of convexity is this: An open domain Ω ⊆ R is convex if, whenever P,Q ∈ Ω, then the segment PQ connecting P to Q lies in Ω. We call this the synthetic definition of convexity...

This article deals with the different classes of convexity and generalizations. Firstly, we reveal the new generalization of the definition of convexity that can reduce many order of convexity. We have showed features of algebra for this new convex function. Then after we have constituted Hermite-Hadamard type inequalities for this class of functions. Finally the identity has been revealed for ...