On polars of mixed projection bodies

Recently, Lutwak established general Minkowski inequality, Brunn-Minkowski inequality and Aleksandrov-Fenchel inequality for mixed projection bodies. In this paper, following Lutwak, we established their polar forms. As applications, we prove some interrelated results.     

Convex polytopes all of whose reverse lexicographic initial ideals are squarefree

A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a -polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed -polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of perfect graphs.

     

Inequalities for polars of mixed projection bodies

In 1993 Lutwak established some analogs of the Brunn-Minkowsi inequality and the Aleksandrov-Fenchel inequality for mixed projection bodies. In this paper, following Lutwak, we give their polars forms. Further, as applications of our methods, we give a generalization of Pythagorean inequality for mixed volumes.     

On zonoids whose polars are zonoids

Zonoids whose polars are zonoids cannot have proper faces other than vertices or facets. However, there exist non-smooth zonoids whose polars are zonoids. Examples in ℝ and ℝ are given. Supported in part by the United States-Israel Binational Science Foundation.     

Convex surfaces whose geodesics are planar

It is shown that ifC is a convex surface, in euclidean space of dimension at least 3, having the property that all shortest paths onC between pairs of its points are planar, thenC is a sphere, a hyperplane or the boundary of an intersection of two half-spaces. No smoothness assumptions are made.     

Convex polytopes and formal groups

Some constructions of commutative formal groups proceeding from convex polytopes and Laurent polynomials are studied.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 75, pp. 87–90, 1978.     

Convex sets which are intersections of closed balls

In this paper we aim to investigate different questions concerning the stability of the set of all intersections of closed balls in a normed space. We are mainly concerned with: (i) the stability of under the closure of the vector sums; (ii) the stability under the addition of balls. We prove that (i) and (ii) are different properties which have strong connections with the geometry of the space. They have interest both in finite and infinite dimension. In the former case, there is a link with linear programming theory. We also study two more stability properties related to the well-known binary intersection property. Mazur sets and Mazur spaces are introduced, as a natural family satisfying (i). We prove that every two-dimensional normed space is a Mazur space, a result which distinguishes dimension d?2 from dimension d?3. We also discuss the connections between Mazur spaces and porosity.     

Non-intersection bodies, all of whose central sections are intersection bodies

We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of subspaces of .

     

Convex polyhedra whose faces are equiangular or composed of such

Depending on the type, considering only the topological structure of the network of faces, and the angles of corresponding faces at corresponding vertices, convex polyhedra in R³, each face of which is equiangular or composed of such, constitute four infinite series (prism, antiprism, and two types of truncated antiprisms); outside of this series, there are only a finite number of types. Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 45, pp. 111–112, 1974.     

On sets of integers whose shifted products are powers

Let N be a positive integer and let A be a subset of {1,…,N} with the property that aa^′+1 is a pure power whenever a and a^′ are distinct elements of A. We prove that |A|, the cardinality of A, is not large. In particular, we show that |A|?(logN)^2/3(loglogN)^1/3.     

Non-measurable sets of reals whose measurable subsets are countable

In this paper we generalize Sierpinski's concept of sets of typeS and give a characterization of such sets in terms of a partition of the reals. We also give a similar characterization of Lusin sets.     

Representations of polytopes and polyhedral sets

In this paper we describe a variant of the diagram techniques, such as Gale diagrams for polytopes and positive diagrams for positive bases, which is appropriate for polyhedral sets. We obtain our new technique as a translation-invariant representation of polytopes or polyhedral sets. This approach leads naturally to simpler proofs of the familiar combinatorial diagram relationships. However, this method is more versatile than those previously employed, in that it can be used to investigate linear systems of polyhedral sets, and metrical properties such as volume. In particular, we give an easy proof of a result of Meyer on decomposability of polytopes, and a more perspicuous way of looking at the well-known theorem of Minkowski on the realizability of polytopes whose facets have given outer normal vectors and areas.     

A class of functions whose sublevel sets are absolute retracts

In this paper, we prove a result of which the following is a corollary: If X is a Banach space and J:X→R is a contraction, then the nonempty sublevel sets of the function x→‖x‖+J(x) are absolute retracts.     

On semicomplete multipartite digraphs whose king sets are semicomplete digraphs

Reid [Every vertex a king, Discrete Math. 38 (1982) 93-98] showed that a non-trivial tournament H is contained in a tournament whose 2-kings are exactly the vertices of H if and only if H contains no transmitter. Let T be a semicomplete multipartite digraph with no transmitters and let K_r(T) denote the set of r-kings of T. Let Q be the subdigraph of T induced by K₄(T). Very recently, Tan [On the kings and kings-of-kings in semicomplete multipartite digraphs, Discrete Math. 290 (2005) 249-258] proved that Q contains no transmitters and gave an example to show that the direct extension of Reid's result to semicomplete multipartite digraphs with 2-kings replaced by 4-kings is not true. In this paper, we (1) characterize all semicomplete digraphs D which are contained in a semicomplete multipartite digraph whose 4-kings are exactly the vertices of D. While it is trivial that K₄(Q)⊆K₄(T), Tan [On the kings and kings-of-kings in semicomplete multipartite digraphs, Discrete Math. 290 (2005) 249-258] showed that K₃(Q)⊆K₃(T) and K₂(Q)=K₂(T). Tan [On the kings and kings-of-kings in semicomplete multipartite digraphs, Discrete Math. 290 (2005) 249-258] also provided an example to show that K₃(Q) need not be the same as K₃(T) in general and posed the problem: characterize all those semicomplete multipartite digraphs T such that K₃(Q)=K₃(T). In the course of proving our result (1), we (2) show that K₃(Q)=K₃(T) for all semicomplete multipartite digraphs T with no transmitters such that Q is a semicomplete digraph.     

Optimal difference systems of sets and difference sets

Difference systems of sets (DSSs) are combinatorial structures that are generalizations of cyclic difference sets and arise in connection with code synchronization. In this paper, we give a recursive construction of DSSs with smaller redundancy from partition-type DSSs and difference sets. As applications, we obtain some new infinite classes of optimal DSSs from the known difference sets and almost difference sets.