Displaying 21 – 40 of 51

Showing per page

Measure and Helly's Intersection Theorem for Convex Sets

N. Stavrakas (2008)

Bulletin of the Polish Academy of Sciences. Mathematics

Let = F α be a uniformly bounded collection of compact convex sets in ℝ ⁿ. Katchalski extended Helly’s theorem by proving for finite ℱ that dim (⋂ ℱ) ≥ d, 0 ≤ d ≤ n, if and only if the intersection of any f(n,d) elements has dimension at least d where f(n,0) = n+1 = f(n,n) and f(n,d) = maxn+1,2n-2d+2 for 1 ≤ d ≤ n-1. An equivalent statement of Katchalski’s result for finite ℱ is that there exists δ > 0 such that the intersection of any f(n,d) elements of ℱ contains a d-dimensional ball of measure...

On Bárány's theorems of Carathéodory and Helly type

Ehrhard Behrends (2000)

Studia Mathematica

The paper begins with a self-contained and short development of Bárány’s theorems of Carathéodory and Helly type in finite-dimensional spaces together with some new variants. In the second half the possible generalizations of these results to arbitrary Banach spaces are investigated. The Carathéodory-Bárány theorem has a counterpart in arbitrary dimensions under suitable uniform compactness or uniform boundedness conditions. The proper generalization of the Helly-Bárány theorem reads as follows:...

Optimal bounds for the colored Tverberg problem

Pavle V. M. Blagojević, Benjamin Matschke, Günter M. Ziegler (2015)

Journal of the European Mathematical Society

We prove a “Tverberg type” multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Bárány et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Bárány & Larman (1992) that is tight in the prime case and asymptotically optimal in the general case. The proof is based on relative equivariant obstruction theory.

Polynomial selections and separation by polynomials

Szymon Wąsowicz (1996)

Studia Mathematica

K. Nikodem and the present author proved in [3] a theorem concerning separation by affine functions. Our purpose is to generalize that result for polynomials. As a consequence we obtain two theorems on separation of an n-convex function from an n-concave function by a polynomial of degree at most n and a stability result of Hyers-Ulam type for polynomials.

Sets Expressible as Unions of Staircase n -Convex Polygons

Marilyn Breen (2011)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Let k and n be fixed, k 1 , n 1 , and let S be a simply connected orthogonal polygon in the plane. For T S , T lies in a staircase n -convex orthogonal polygon P in S if and only if every two points of T see each other via staircase n -paths in S . This leads to a characterization for those sets S expressible as a union of k staircase n -convex polygons P i , 1 i k .

Currently displaying 21 – 40 of 51