Approximation of convex bodies by simplices

This paper deals with the following kind of approximation of a convex bodyQ in Euclidean space E ⁿ by simplices: which is the smallest positive numberh _S(Q) such thatS ₁ Q S ₂ for a simplexS ₁ and its homothetic copyS ₂ of ratioh _S(Q). It is shown that ifS ₀ is a simplex of maximal volume contained inQ, then a homothetic copy ofS ₀ of ratio 13/3 containsQ.     

Continuous selections of multifunctions with weakly convex values

We obtain some selection theorems for multifunctions with weakly convex values. For this purpose, some new properties of weakly convex sets in a Hilbert space are investigated. We also present some examples showing the importance of various assumptions in these selection theorems.     

Error of Asymptotic Formulae for Volume Approximation of Convex Bodies in

 We estimate the error of asymptotic formulae for volume approximation of sufficiently differentiable convex bodies by circumscribed convex polytopes as the number of facets tends to infinity. Similar estimates hold for approximation with inscribed and general polytopes and for vertices instead of facets. Our result is then applied to estimate the minimum isoperimetric quotient of convex polytopes as the number of facets tends to infinity. Received 16 July 2001     

Approximation of Convex Bodies and a Momentum Lemma for Power Diagrams

 The volume of the symmetric difference of a smooth convex body in and its best approximating polytope with n vertices is asymptotically a constant multiple of . We determine this constant and the similarly defined constant for approximation with a given number of facets by solving two isoperimetric problems for planar tilings. Received 15 May 1997; in revised form 14 August 1997     

On a lower and upper bound for the curvature of ellipses with more than two foci

Let a set of points in the Euclidean plane be given. We are going to investigate the levels of the function measuring the sum of distances from the elements of the pointset which are called foci. Levels with only one focus are circles. In case of two different points as foci they are ellipses in the usual sense. If the set of the foci consists of more than two points then we have the so-called polyellipses. In this paper we investigate them from the viewpoint of differential geometry. We give a lower and upper bound for the curvature involving explicit constants. They depend on the number of the foci, the rate of the level and the global minimum of the function measuring the sum of the distances. The minimizer will be characterized by a theorem due to E. Weiszfeld together with a new proof. Explicit examples will also be given. As an application we present a new proof for a theorem due to P. Erd?s and I. Vincze. The result states that the approximation of a regular triangle by circumscribed polyellipses has an absolute error in the sense that there is no way to exceed it even if the number of the foci are arbitrary large.     

The cross-section body, plane sections of convex bodies and approximation of convex bodies, I

For a convex body K ^d we investigate three associated bodies, its intersection body IK (for 0int K), cross-section body CK, and projection body IIK, which satisfy IKCKIIK. Conversely we prove CKconst₁(d)I(K–x) for some xint K, and IIKconst₂ (d)CK, for certain constants, the first constant being sharp. We estimate the maximal k-volume of sections of 1/2(K+(-K)) with k-planes parallel to a fixed k-plane by the analogous quantity for K; our inequality is, if only k is fixed, sharp. For L ^d a convex body, we take n random segments in L, and consider their Minkowski average D. We prove that, for V(L) fixed, the supremum of V(D) (with also nN arbitrary) is minimal for L an ellipsoid. This result implies the Petty projection inequality about max V((IIM)*), for M ^d a convex body, with V(M) fixed. We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, the volumes of sections of convex bodies and the volumes of sections of their circumscribed cylinders. For fixed n, the pth moments of V(D) (1p<) also are minimized, for V(L) fixed, by the ellipsoids. For k=2, the supremum (nN arbitrary) and the pth moment (n fixed) of V(D) are maximized for example by triangles, and, for L centrally symmetric, for example by parallelograms. Last we discuss some examples for cross-section bodies.Research (partially) supported by Hungarian National Foundation for Scientific Research, Grant No. 41.     

An arithmetic proof of John’s ellipsoid theorem

Using an idea of Voronoi in the geometric theory of positive definite quadratic forms, we give a transparent proof of John’s characterization of the unique ellipsoid of maximum volume contained in a convex body. The same idea applies to the ‘hard part’ of a generalization of John’s theorem and shows the difficulties of the corresponding ‘easy part’.Received: 8 October 2004     

Simply connected orthogonal polygons as unions of two orthogonally starshaped sets

Let S be a simply connected orthogonal polygon in the plane. The set S is a union of two sets which are starshaped via staircase paths (i.e., orthogonally starshaped) if and only if for every three points of S, at least two of these points see (via staircase paths) a common point of S. Moreover, the simple connectedness condition cannot be deleted.     

Volume approximation of smooth convex bodies by three-polytopes of restricted number of edges

For a given convex body K in with C ² boundary, let P ^c _n be the circumscribed polytope of minimal volume with at most n edges, and let P ⁱ _n be the inscribed polytope of maximal volume with at most n edges. Besides presenting an asymptotic formula for the volume difference as n tends to infinity in both cases, we prove that the typical faces of P ^c _n and P ⁱ _n are asymptotically regular triangles and squares, respectively, in a suitable sense. Supported by OTKA grants 043520 and 049301, and by the EU Marie Curie grants Discconvgeo, Budalggeo and PHD. Authors’ addresses: Károly J. B?r?czky, Alfréd Rényi Institute of Mathematics, P.O. Box 127, Budapest H–1364, Hungary, and Department of Geometry, Roland E?tv?s University, Pázmány Péter sétány 1/C, Budapest 1117, Hungary; Salvador S. Gomis, Department of Mathematical Analysis, University of Alicante, 03080 Alicante, Spain; Péter Tick, Gyűrű utca 24, Budapest H–1039, Hungary     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Images of connected sets by semicontinuous multifunctions

The image of a connected set by an upper-semicontinuous (or a lower-semicontinuous) multifunction whose values are nonempty and connected is connected. We prove this theorem in its most general setting and show its usefulness in various examples from optimization and nonlinear analysis.     

Lp-Continuous extreme selectors of multifunctions with decomposable values: Relaxation theorems

Some density theorems of L _p-continuous selectors whose values are extreme points are proved for a class of multivalued maps. applications to the Darboux problem for a differential inclusion are presented.Supported in part by RFFI Grant 93-011-264.     

Lp-continuous extreme selectors of multifunctions with decomposable values: Existence theorems

The existence theorems of L _p -continuous selectors that values are extreme points are proved for a class of multivalued maps. Applications to multivalued maps appearing in multivalued differential equations are presented.Supported in part by RFFI Grant 93-011-264.     

On the best estimate for perimeters of plane sets with the angle property

We investigate the problem of finding the maximum length of perimeters of plane sets with fixed diameter d, such that every point of the boundary of the set is a vertex of an open angle of opening which does not intersect the set. First we consider plane curves which satisfy such angle property in a finite number of directions, and among them we find the one of maximum length. Then we prove that the perimeter of any plane set with the angle property is less than or equal to d(sin /2)^-2; this is the best estimate when /2.     

Sets associated with the farthest point problem

LetS be a convex compact set in a normed linear spaceX. For each cardinal numbern, defineS _n = {x X:x has exactlyn farthest points inS} andT _n = _kn S _k. It is shown that ifX =E thenT ₃ is countable andT ₂ is contractible to a point. Properties of associated level curves are given.     

Point-based sufficient conditions for metric regularity of implicit multifunctions

We obtain some point-based sufficient conditions for the metric regularity in Robinson’s sense of implicit multifunctions in a finite-dimensional setting. The new implicit function theorem (which is very different from the preceding results of Ledyaev and Zhu [Yu.S. Ledyaev, Q.J. Zhu, Implicit multifunctions theorems, Set-Valued Anal. 7 (1999) 209–238], Ngai and Théra [H.V. Ngai, M. Théra, Error bounds and implicit multifunction theorem in smooth Banach spaces and applications to optimization, Set-Valued Anal. 12 (2004) 195–223], Lee, Tam and Yen [G.M. Lee, N.N. Tam, N.D. Yen, Normal coderivative for multifunctions and implicit function theorems, J. Math. Anal. Appl. 338 (2008) 11–22]) can be used for analyzing parametric constraint systems as well as parametric variational systems. Our main tools are the concept of normal coderivative due to Mordukhovich and the corresponding theory of generalized differentiation.