On strictly separating vectors and reflexivity

It is shown that the set of strongly disjoint pairs of strictly separating vectors for an operator space is open, and an operator subspace having a strongly disjoint pair of strictly separating vectors is reflexive. Some applications are discussed.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

An integral representation for decomposable measures of measurable functions

Summary We start with a measurem on a measurable space (,A), decomposable with respect to an Archimedeant-conorm on a real interval [0,M], which generalizes an additive measure. Using the integral introduced by the second author, a Radon-Nikodym type theorem, needed in what follows, is given.The integral naturally leads to a -decomposable measurem on the space of all measurable functions from to [0, 1]. The main result of the present paper is the converse of this, namely that, under natural conditions, any -decomposable measurem on can be represented as an integral of a certain Markov-kernelK. We extend this representation to measures on which have values in a set of distribution functions.These results generalize the work done by the first author in the case of additive measures.     

Partial order complementation graphs

Two partial ordersP andQ on a setX arecomplementary (written asPQ) if they share no ordered pairs (except for loops) but the transitive closure of the union is all possible ordered pairs. For each positive integern we form a graph Pos _n consisting of all nonempty partial orders on {1, ,n} with edges denoting complementation. We investigate here properties of the graphs Pos _n . In particular, we show:

An extremal problem related to probability

Summary We consider a walk from a stateA ₁ to a stateA _n+1 in which the probability of remaining atA _i isp _i , and the probability of progressing fromA _i toA _i+1 is 1 –p _i . The probabilityW _nk of reachingA _n+1 fromA ₁ in exactlyn + k steps can then be expressed as a polynomial of degreen + k in then variablesp ₁,,p _n . We determine the maximum value ofW _nk and the (unique) choice (p ₁,,p _n ) for which this extremum occurs.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday