Let (Ω,Σ) be a measurable space and let X be a Banach space. Throughout this paper G will be a countably additive vector measure G : Σ → X. Consider the space L1(G) of (classes of real) G-integrable functions, following the definition of Bartle, Dunford and Schwartz [1] and Lewis [9]. The properties of this space have been studied by Kluvánek and Knowles [7], Okada [10] and Curbera [2]. In the ...

A common measure for the uniformity of point distributions is the star discrepancy. Let λ s denote the s-dimensional Lebesgue measure. Then the star discrepancy of a mul-tiset P = {p 1 ,. .. , p N } ⊂ [0, 1] s is given by D * N (P) := sup α∈[0,1] s λ s ([0, α)) − 1 N N k=1 1 [0,α) (p k) ; here [0, α) denotes the s-dimensional axis-parallel box [0, α 1) × · · · × [0, α s) and 1 [0,α) its charact...

Cooperation structures without any a priori assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for marginal values, cores and convexity is established. The theory is based on the notion of a Monge extension of a general characteristic function, which is equivalent to the Lovász extension in the special situation of a classical cooperative game. It...

We present a characterization of supercompactness measures for ω1 in L(R), and of countable products of such measures, using inner models. We give two applications of this characterization, the first obtaining the consistency of δ13 = ω2 with ZFC+AD , and the second proving the uniqueness of the supercompactness measure over Pω1 (λ) in L(R) for λ > δ21. Starting with the work of Steel [13] it b...

The N basis functions are typically chosen so that Surface reflectance functions(SRFs) and spectral power distributions (SPDs) can be accurately reconstructed from their N-dimensional vector codes. Typical rendering applications assume that the resulting mapping is an isomorphism where vector operations of addition, scalar multiplication, component-wise multiplication on the N-vectors can be us...

The core is a central solution concept in cooperative game theory, and therefore it is important to know under what conditions the core of a game is guaranteed to be non-empty. Two notions that prove to be very useful in this context are Linear Programming (LP) duality and convexity. In this work, we apply these tools to identify games with overlapping coalitions (OCF games) that admit stable o...

In this paper, we introduce a concept of a farsighted stable set for a partition function game and interpret the union of all farsighted stable sets as the core of the game, to be called the strongcore, which reduces to the traditional core if the worth of every coalition is independent of the partition to which it belongs and the game is adequately represented by a characteristic function. We ...

We prove that a sectorial operator admits an H∞functional calculus if and only if it has a functional model of NagyFoiaş type. Furthermore, we give a concrete formula for the characteristic function (in a generalized sense) of such an operator. More generally, this approach applies to any sectorial operator by passing to a different norm (the McIntosh square function norm). We also show that th...

A refinable set is a compact set with positive Lebesgue measure whose characteristic function satisfies a refinement equation. Refinable sets are a generalization of self-affine tiles. But unlike the latter, the refinement equations defining refinable sets may have negative coefficients, and a refinable set may not tile. In this paper, we establish some fundamental properties of these sets.