A central limit theorem for convex sets

We show that there exists a sequence for which the following holds: Let K⊂ℝⁿ be a compact, convex set with a non-empty interior. Let X be a random vector that is distributed uniformly in K. Then there exist a unit vector θ in ℝⁿ, t₀∈ℝ and σ>0 such that

A very special nonexistence theorem for abelian difference sets

It is wellknown that the technique of character sums together with the tools of algebraic number theory is the adequate method for the study of difference sets in abelian groups, compare for instance Ott [5] or Turyn [6]. In this paper we use this method to prove a new non-existence theorem for certain difference sets in abelian groups of order rp^a rp^a , where r 1 2 r \neq 2 and p are distinct primes.     

A fractional Helly theorem for convex lattice sets

A set of the form , where is convex and denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of d-dimensional convex lattice sets is 2^d. We prove that the fractional Helly number is only d+1: For every d and every α∈(0,1] there exists β>0 such that whenever F₁,…,F_n are convex lattice sets in such that for at least index sets I⊆{1,2,…,n} of size d+1, then there exists a (lattice) point common to at least βn of the F_i. This implies a (p,d+1)-theorem for every p?d+1; that is, if is a finite family of convex lattice sets in such that among every p sets of , some d+1 intersect, then has a transversal of size bounded by a function of d and p.     

A joint spectral mapping theorem for sets of semigroup generators

In the context of the multidimensional functional calculus of semigroup generators, which is based on the class of Bernstein functions in several variables (and is also known as Bochner-Phillips multidimensional functional calculus), a spectral mapping theorem for the Taylor spectrum of a set of commuting generators is proved.     

Minkowski’s theorem for arbitrary convex sets

V. Klee extended a well-known theorem of Minkowski to non-compact convex sets. We generalize Minkowski’s theorem to convex sets which are not necessarily closed.     

Power-law estimates for the central limit theorem for convex sets

We investigate the rate of convergence in the central limit theorem for convex sets established in [B. Klartag, A central limit theorem for convex sets, Invent. Math., in press. [8]]. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the original proof of the central limit theorem for convex sets.     

A separation theorem for nonlinear inverse images of convex sets

This paper offers first- and higher-order necessary conditions for the local disjointness of a finite system of sets that are nonlinear inverse images of convex sets. The proof is based on the characterizations of α-admissible and α-tangent variations to nonlinear inverse images of convex sets and a necessary condition for the local disjointness in terms of these variations. As an application, the results are used to obtain first- and higher-order necessary conditions of optimality in constrained optimization problems.     

Frank separation of two convex sets and Hahn-Banach theorem

First we give some elementary properties of the core of a subset relative to a linear subspace. Then we prove a theorem on the frank separation of two convex sets. This theorem admits as particular cases the known theorems on the frank separation and introduces new cases. Finally, we provide a very general version of the Hahn-Banach theorem in an analytic form.     

Convexity and level sets for interval-valued fuzzy sets

Fuzzy Optimization and Decision Making - Convexity is a deeply studied concept since it is very useful in many fields of mathematics, like optimization. When we deal with imprecision, the convexity...     

A colorful theorem on transversal lines to plane convex sets

We prove a colorful version of Hadwiger’s transversal line theorem: if a family of colored and numbered convex sets in the plane has the property that any three differently colored members have a transversal line that meet the sets consistently with the numbering, then there exists a color such that all the convex sets of that color have a transversal line. All authors are partially supported by CONACYT research grant 5040017.     

Differentiability of a convex semigroup on Rn

It is proved that each continuous semigroup {P(t)}_t≥0 of convex operators P(t):Rⁿ→Rⁿ is continuously differentiable with respect to t. This note represents a first step towards a better understanding of semigroups formed by convex operators. We establish the differentiability of a convex semigroup in the finite dimensional case, generalizing a basic result from linear semigroup theory. Our motivation for the study of semigroups of convex operators comes from the theory of Markov decision processes. In [1] and in [2] it was shown that the maximum reward of these processes can be described by a certain nonlinear semigroup. The nonlinear operators are defined as suprema of linear operators (plus a constant), hence they are convex operators. It seems that the convexity assumption keeps its smoothing influence even in the infinite dimensional situation. We hope to discuss this in a future paper.