对称多胞形的极值性质及其应用

凸多胞形现代理论的主要成就是被称之为Dehn-Sommerville关系的上界定理和下界定理,它们属于凸多胞形的经典组合理论.本文建立了关于对称凸多胞形的两个极值定理,它们可视为凸多胞形度量理论中的上界定理和下界定理,另外给出了两个极值定理的一个应用.     

对称多胞形的极值性质及其应用

凸多胞形现代理论的主要成就是被称之为Dehn-Sommerville关系的上界定理和下界定理,它们属于凸多胞形的经典组合理论．本文建立了关于对称凸多胞形的两个极值定理,它们可视为凸多胞形度量理论中的上界定理和下界定理,另外给出了两个极值定理的一个应用．     

凸多胞形的保顶单纯剖分

通过引进凸多胞形对其外部一点的阴面、阳面与平射面等概念,借助两个屏蔽引理证明Rn中任何n维凸多胞形都可以剖分为内部互不相交、以原凸多胞形的顶点集的子集为顶点集的有限个n维单纯形之并,克服了相关文献中剖分的不足,为单纯形算法提供了一种比较理想的剖分工具.     

中心仿射不变量的推广及其比的极值问题

本文研究了关于投影体的中心仿射不变量比的问题.借助定义一个新的中心仿射不变量W(P)把已有结论中的研究对象从中心对称凸多胞形,推广到一般中心对称凸体,并求得推广后的极值.     

预给二面角的m面凸多胞形嵌入Rd的充分必要条件

本文给出了预给二面角的ｍ面凸多胞形嵌入Ｒ^d的充分必要条件     

锥体积泛函与仿射不等式(英文)

本文研究了凸多胞形的锥体积泛函.利用投影体以及Lutwak、杨和张最近所建立的仿射等周不等式,得到了刻划平行四边形特征的一个崭新不等式和用锥体积泛函以及投影体的体积所表达的关于配极体体积的严格下界.     

广义重心坐标与凸多胞形的性质

提出n维欧氏空间中广义重心坐标的概念,建立了广义重心坐标下两点间的距离公式,并利用于研究凸多胞形的若干性质,将欧氏平面上凸多边形的一些定值与极值性质推广到n维空间.     

优化Sobolev体及其仿射性质

Sobolev不等式是联系分析和几何的基础不等式之一,而优化Sobolev体是优化Sobolev范数的临界几何核.首先,证明优化Sobolev体的一些仿射性质.然后,运用Barthe的优化迁移方法研究了凸体的特征函数和多胞形仿射函数的优化Sobolev体.     

欧拉凸多面形定理和欧拉示性数

Ⅰ.凸多面形的欧拉定理 1.定理的敍述和来源象中学立体几何教科书中所說的,由若干个平面多边形所围成的封閉的立体叫作多面体。这些多边形的每一个叫作多面体的面,这些多边形的边和頂点分別叫作多面体的棱和頂点。当多面体在它的每一个面的平面的同一側,它就叫作凸多面体。凸多面体的表面叫作凸多面形,它的面、棱和頂点也就是凸多面形的面、棱和頂点。例如图1中的(一)到(四)都是凸多面形,图1中的(五)不是凸多面形。     

对凸形内部一类特殊点的研究

1 简介对于一个凸形,其内部任一点都能表示为凸形的某条弦的中点,但是对于一般的凸形,什么样的点能表示为凸形的某个内接中心对称凸多边形的中心?本文将对这个命题的推广进行讨论.以下为本文的主要结论.定理 设Ω为平面上的凸形,定义T为Ω的所有内接中心对称凸多边形中心构成的集合,则图形T的面积S(T)满足0≤S(T)≤1/4S(Ω)不等式左端等号成立当且仅当Ω为中心对称图形,不等式右端等号成立当且仅当Ω为三角形.(以下如无特殊说明,“凸形”,“中心对称图形”均指平面上的图形,且不包括直线或直线的一部分.)     

投影体与U(P)的极值性质

为了研究著名的Schneider投影问题,E.Lutwak,D.Yang和张高勇最近引进了一个关于对称多胞形的新的仿射不变量U(P),并提出了关于U(P)下界的猜想.本文就二维、三维在一特定条件下的情形给予了此猜想的肯定回答并给出了严格的数学证明.     

On perimeters of sections of convex polytopes

In his book “Geometric Tomography” Richard Gardner asks the following question. Let P and Q be origin-symmetric convex bodies in R³ whose sections by any plane through the origin have equal perimeters. Is it true that P=Q? We show that the answer is “Yes” in the class of origin-symmetric convex polytopes. The problem is treated in the general case of Rn.     

Projection problems for symmetric polytopes

Let K⊂Rn be a convex body (a compact, convex subset with non-empty interior), ΠK its projection body. Finding the least upper bound, as K ranges over the class of origin-symmetric convex bodies, of the affine-invariant ratio V(ΠK)/V(K)ⁿ⁻¹, being called Schneider's projection problem, is a well-known open problem in the convex geometry. To study this problem, Lutwak, Yang and Zhang recently introduced a new affine invariant functional for convex polytopes in Rn. For origin-symmetric convex polytopes, they posed a conjecture for the new functional U(P). In this paper, we give an affirmative answer to the conjecture in Rn, thereby, obtain a modified version of Schneider's projection problem.     

Reconstruction of Convex Bodies from Brightness Functions

Abstract. Algorithms are given for reconstructing an approximation to an unknown convex body from finitely many values of its brightness function, the function giving the volumes of its projections onto hyperplanes. One of these algorithms constructs a convex polytope with less than a prescribed number of facets, while the others do not restrict the number of facets. Convergence of the polytopes to the body is proved under certain essential assumptions including origin symmetry of the body. Also described is an oracle-polynomial-time algorithm for reconstructing an approximation to an origin-symmetric rational convex polytope of fixed and full dimension that is only accessible via its brightness function. Some of the algorithms have been implemented, and sample reconstructions are provided.     

Reconstruction of Convex Bodies from Brightness Functions

   Abstract. Algorithms are given for reconstructing an approximation to an unknown convex body from finitely many values of its brightness function, the function giving the volumes of its projections onto hyperplanes. One of these algorithms constructs a convex polytope with less than a prescribed number of facets, while the others do not restrict the number of facets. Convergence of the polytopes to the body is proved under certain essential assumptions including origin symmetry of the body. Also described is an oracle-polynomial-time algorithm for reconstructing an approximation to an origin-symmetric rational convex polytope of fixed and full dimension that is only accessible via its brightness function. Some of the algorithms have been implemented, and sample reconstructions are provided.     

Inextensible domains

We develop a theory of planar, origin-symmetric, convex domains that are inextensible with respect to lattice covering, that is, domains such that augmenting them in any way allows fewer domains to cover the same area. We show that origin-symmetric inextensible domains are exactly the origin-symmetric convex domains with a circle of outer billiard triangles. We address a conjecture by Genin and Tabachnikov about convex domains, not necessarily symmetric, with a circle of outer billiard triangles, and show that it follows immediately from a result of Sas.     

Extremum problems for the cone volume functional of convex polytopes

Lutwak, Yang and Zhang defined the cone volume functional U over convex polytopes in Rn containing the origin in their interiors, and conjectured that the greatest lower bound on the ratio of this centro-affine invariant U to volume V is attained by parallelotopes. In this paper, we give affirmative answers to the conjecture in R² and R³. Some new sharp inequalities characterizing parallelotopes in Rn are established. Moreover, a simplified proof for the conjecture restricted to the class of origin-symmetric convex polytopes in Rn is provided.     

The 3-ball is a local pessimum for packing

It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher efficiency than balls. We also show that in dimensions 4, 5, 6, 7, 8, and 24 there are origin-symmetric convex bodies of arbitrarily small asphericity that cannot be packed using a lattice as efficiently as balls can be.     

On the Stability of the p-Affine Isoperimetric Inequality

Employing the affine normal flow, we prove a stability version of the p-affine isoperimetric inequality for p≥1 in ?² in the class of origin-symmetric convex bodies. That is, if K is an origin-symmetric convex body in ?² such that it has area π and its p-affine perimeter is close enough to the one of an ellipse with the same area, then, after applying a special linear transformation, K is close to an ellipse in the Hausdorff distance.