Enclosed convex hypersurfaces with maximal affine area

In this paper we study the regularity of closed, convex surfaces which achieve maximal affine area among all the closed, convex surfaces enclosed in a given domain in the Euclidean 3-space. We prove the C^1,α regularity for general domains and C^1,1 regularity if the domain is uniformly convex. This work is supported by the Australian Research Council. Research of Sheng was also supported by ZNSFC No. 102033. On leave from Zhejiang University.     

The affine complete hypersurfaces of constant Gauss-Kronecker curvature

Given a bounded convex domain Ω with C∞ boundary and a function ψ∈C∞（δΩ）, Li-Simon-Chen can construct an Euclidean complete and W-complete convex hypersurface M with constant affine Gauss-Kronecker curvature, and they guess the M is also affine complete. In this paper, we give a confirmation answer.     

Affine complete locally convex hypersurfaces

An open problem in affine geometry is whether an affine complete locally uniformly convex hypersurface in Euclidean (n+1)-space is Euclidean complete for n≥2. In this paper we give the affirmative answer. As an application, it follows that an affine complete, affine maximal surface in R ³ must be an elliptic paraboloid. Oblatum 16-VI-2001 & 27-II-2002?Published online: 29 April 2002     

Preserving affine baire classes by perfect affine maps

Let ? : X → Y be an affine continuous surjection between compact convex sets. Suppose that the canonical copy of the space of real-valued affine continuous functions on Y in the space of real-valued affine continuous functions on X is complemented. We show that if F is a topological vector space, then f : Y → F is of affine Baire class α whenever the composition f ? ? is of affine Baire class α. This abstract result is applied to extend known results on affine Baire classes of strongly affine Baire mappings.     

The Bernstein problem for affine maximal hypersurfaces

In this paper, we prove the validity of the Chern conjecture in affine geometry [18], namely that an affine maximal graph of a smooth, locally uniformly convex function on two dimensional Euclidean space, R ², must be a paraboloid. More generally, we shall consider the n-dimensional case, R ⁿ , showing that the corresponding result holds in higher dimensions provided that a uniform, “strict convexity” condition holds. We also extend the notion of “affine maximal” to non-smooth convex graphs and produce a counterexample showing that the Bernstein result does not hold in this generality for dimension n≥10. Oblatum 16-IV-1999 & 4-XI-1999?Published online: 21 February 2000     

Convex hulls of curves of genus one

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials fi with (mod IC) and such that the degrees deg(fi) are bounded in terms of deg(f) only. Using Lasserre?s relaxation method, we deduce an explicit representation of the convex hull of C(R) in Rn by a lifted linear matrix inequality. This is the first instance in the literature where such a representation is given for the convex hull of a nonrational variety. The same works for convex hulls of (singular) curves whose normalization is C. We then make a detailed study of the associated degree bounds. These bounds are directly related to size and dimension of the projected matrix pencils. In particular, we prove that these bounds tend to infinity when the curve C degenerates suitably into a singular curve, and we provide explicit lower bounds as well.     

Affine images of the rhombo-dodecahedron that are circumscribed about a three-dimensional convex body

The main result of the paper is dual to the author's earlier theorem on the affine images of the cube-octahedron (the convex hull of the midpoints of edges of a cube) inscribed in a three-dimensional convex body. The rhombododecahedron is the polyhedron dual to the cube-octahedron. Let us call a convex body in Κ⊂ℝ³ exceptional if it contains a parallelogram P and is contained in a cylinder with directrix P. It is proved that any nonexceptional convex body is inscribed in an affine image of the rhombo-dodecahedron. The author does not know if the assertion is true for all three-dimensional convex bodies. Bibliography: 2 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 246, 1997, pp. 191–195. Translated by N. Yu. Netsvetaev.     

Affine minimal hypersurfaces of rotation

We give a complete list of affine minimal surfaces inA ³ with Euclidean rotational symmetry, completing the treatise given in [1] and prove that these surfaces have maximal affine surface area within the class of all affine surfaces of rotation satisfying suitable boundary conditions. Besides we show that for rotationally symmetric locally strongly convex affine minimal hypersurfaces inA ⁿ ,n4, the second variation of the affine surface area is negative definite under certain conditions on the meridian.     

On polynomiality of the method of analytic centers for fractional problems

We establish polynomial time convergence of the method of analytic centers for the fractional programming problemt→min |x∈G, tB(x)−A(x)∈K, whereG ⊂ ℝ ⁿ is a closed and bounded convex domain,K ⊂ ℝ ^m is a closed convex cone andA(x):G → ℝ ⁿ ,B(x):G→K are regular enough (say, affine) mappings. This research was partly supported by grant #93-012-499 of the Fundamental Studies Foundation of Russian Academy of Sciences     

Curvature measures of convex bodies

Summary The curvature measures, introduced by Federer for the sets of positive reach, are investigated in the special case of convex bodies. This restriction yields additional results. Among them are:(5.1), an integral-geometric interpretation of the curvature measure of order m, showing that it measures, in a certain sense, the affine subspaces of codimension m+1 which touch the convex body;(6.1), an axiomatic characterization of the (linear combinations of) curvature measures similar to Hadwiger's characterization of the quermassintegrals of convex bodies;(8.1), the determination of the support of the curvature measure of order m, which turns out to be the closure of the m-skeleton of the convex body. Moreover we give, for the case of convex bodies, a new and comparatively short proof of an integral-geometric kinematic formula for curvature measures. Entrata in Redazione il 14 dicembre 1976.     

Divisible points of compact convex sets

By associating with an affine dependence the resultant of a related probability measure, we are able to define the set ofdivisible points, D(K), of a compact convex setK. Some general properties ofD(K) are discussed, and its equivalence with a set recently introduced by Reay for convex polytopes demonstrated. For polytopes,D(K) is a continuous image of a projective space. A conjecture concerningD(K) is settled affirmatively for cubes.     

Affine-inscribed and affine-circumscribed polygons and polytopes

Five theorems on polygons and polytopes inscribed in (or circumscribed about) a convex compact set in the plane or space are proved by topological methods. In particular, it is proved that for every interior point O of a convex compact set in ℝ³, there exists a two-dimensional section through O circumscribed about an affine image of a regular octagon. It is also proved that every compact convex set in ℝ³ (except the cases listed below) is circumscribed about an affine image of a cube-octahedron (the convex hull of the midpoints of the edges of a cube). Possible exceptions are provided by the bodies containing a parallelogram P and contained in a cylinder with directrix P. Bibliography: 29 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 231, 1995, pp. 286–298. Translated by B. M. Bekker.     

A systematization of convexity and quasiconvexity concepts for set-valued maps,defined by l-type and u-type preorder relations

Abstract

In this paper, we study different classes of generalized convex/quasiconvex set-valued maps, defined by means of the l-type and u-type preorder relations, currently used in set-valued optimization. In particular, we identify those classes of set-valued maps for which it is possible to extend the classical characterization of convex real-valued functions by quasiconvexity of their affine perturbations.     

The long-step method of analytic centers for fractional problems

We develop a long-step surface-following version of the method of analytic centers for the fractional-linear problem min{t ₀ |t ₀ B(x) −A(x) εH, B(x) εK, x εG}, whereH is a closed convex domain,K is a convex cone contained in the recessive cone ofH, G is a convex domain andB(·),A(·) are affine mappings. Tracing a two-dimensional surface of analytic centers rather than the usual path of centers allows to skip the initial “centering” phase of the path-following scheme. The proposed long-step policy of tracing the surface fits the best known overall polynomial-time complexity bounds for the method and, at the same time, seems to be more attractive computationally than the short-step policy, which was previously the only one giving good complexity bounds. The research was partly supported by the Israeli-American Binational Science Foundation (BSF).     

Ratios of affine functions

Aratio of affine functions is a function which can be expressed as the ratio of a vector valued affine function and a scalar affine functional. The purpose of this note is to examine properties of sets which are preserved under images and inverse images of such functions. Specifically, we show that images and inverse images of convex sets under such functions are convex sets. Also, images of bounded, convex polytopes under such functions are bounded, convex polytopes. In addition, we provide sufficient conditions under which the extreme points of images of convex sets are images of extreme points of the underlying domains. Of course, this result is useful when one wishes to maximize a convex function over a corresponding set. The above assertions are well known for affine functions. Applications of the results include a problem that concerns the control of stochastic eigenvectors of stochastic matrices.     

Affinely Regular Polygons as Extremals of Area Functionals

For any convex n-gon P we consider the polygons obtained by dropping a vertex or an edge of P. The area distance of P to such (n−1)-gons, divided by the area of P, is an affinely invariant functional on n-gons whose maximizers coincide with the affinely regular polygons. We provide a complete proof of this result. We extend these area functionals to planar convex bodies and we present connections with the affine isoperimetric inequality and parallel X-ray tomography.     

On the affine heat equation for non-convex curves

In this paper, we extend to the non-convex case the affine invariant geometric heat equation studied by Sapiro and Tannenbaum for convex plane curves. We prove that a smooth embedded plane curve will converge to a point when evolving according to this flow. This result extends the analogy between the affine heat equation and the well-known Euclidean geometric heat equation.

     

On neighborly families of convex bodies

A family of convex bodies in E^d is called neighborly if the intersection of every two of them is (d-1)-dimensional. In the present paper we prove that there is an infinite neighborly family of centrally symmetric convex bodies in E^d, d 3, such that every two of them are affinely equivalent (i.e., there is an affine transformation mapping one of them onto another), the bodies have large groups of affine automorphisms, and the volumes of the bodies are prescribed. We also prove that there is an infinite neighborly family of centrally symmetric convex bodies in E^d such that the bodies have large groups of symmetries. These two results are answers to a problem of B. Grünbaum (1963). We prove also that there exist arbitrarily large neighborly families of similar convex d-polytopes in E^d with prescribed diameters and with arbitrarily large groups of symmetries of the polytopes.     

On the power and limitations of affine policies in two-stage adaptive optimization

We consider a two-stage adaptive linear optimization problem under right hand side uncertainty with a min–max objective and give a sharp characterization of the power and limitations of affine policies (where the second stage solution is an affine function of the right hand side uncertainty). In particular, we show that the worst-case cost of an optimal affine policy can be times the worst-case cost of an optimal fully-adaptable solution for any δ > 0, where m is the number of linear constraints. We also show that the worst-case cost of the best affine policy is times the optimal cost when the first-stage constraint matrix has non-negative coefficients. Moreover, if there are only k ≤ m uncertain parameters, we generalize the performance bound for affine policies to , which is particularly useful if only a few parameters are uncertain. We also provide an -approximation algorithm for the general case without any restriction on the constraint matrix but the solution is not an affine function of the uncertain parameters. We also give a tight characterization of the conditions under which an affine policy is optimal for the above model. In particular, we show that if the uncertainty set, is a simplex, then an affine policy is optimal. However, an affine policy is suboptimal even if is a convex combination of only (m + 3) extreme points (only two more extreme points than a simplex) and the worst-case cost of an optimal affine policy can be a factor (2 − δ) worse than the worst-case cost of an optimal fully-adaptable solution for any δ > 0.     

Bounded symmetric domains and polynomial convexity

For every bounded symmetric domain D=G/K in a complex vector space E of finite dimension we determine all polynomially convex compact subsets of E that are invariant under the compact linear group K, where D is realized in the standard way as circular convex domain in E.Mathematics Subject Classification (2000): 17C50, 32E20, 32M15, 32V25