关于平面19-点集的空凸分划问题

主要研究了平面上处于一般位置的19-点集,根据其凸包边数的不同,分别讨论了其所含空凸多边形的个数,得出G(19)≤5.在此基础上,对平面上处于一般位置的n-点集得出G(n)≤[11n/42],从而改进了G(n)的上界.     

“凸包”的应用

定义1 对于平面图形内的任意两点A、B,线段AB上的所有点都在形内,这样的平面图形叫做凸形。显然,平面几何中研究的线段,三角形、凸多边形等都是凸形。定义2 对于平面上的有限个点所组成的平面点集,存在一个凸多边形,它包含这整个点集,且其顶点与这集的点重合。这样的凸多边形称为已知点集的凸包。特殊地,当平面上的点在一直线上时,凸包为线段。平面上有限点集的凸包的存在性从直观上看是显然的。在给定的有限个点的每个点插上大头针,用一根线圈上这些针,拉紧后构成的图形就是凸包。自然,这个直观的考虑不是凸包存在性的严格证明,     

与平面凸集几何量有关的不等式(英文)

本文研究了平面凸集几何量之间的关系.通过定义新几何量:平面凸集的最大内接正三角形T和最大内接正方形S,分别获得了T(S)的边长、凸集的直径和面积之间的关系式.     

决策者具有(严格)凸性偏好结构下的一类交互式多目标决策方法

为了更好地解决决策者具有(严格)凸性偏好结构下的多目标决策问题,一般目标空间为有界凸域的情形常常可以转化为目标空间为有界闭凸区域的情形,首先分析了切割平面及该平面上偏好最优点与被切割平面分割成的为有界闭凸区域的目标空间或目标空间的子集的两个部分之间的关系;然后分析并指出了对于包含全局偏好最优目标方案点的为有界闭凸域的目标空间及其子集(准最优目标集),在确定了切割平面上的偏好最优点后,通过适当地选取供决策者与切割平面的偏好最优点进行比较判断的目标方案点,经过一次比较就可以确定一个新的范围更小的包含全局偏好最优目标方案点的目标空间的有界闭凸子区域(准最优目标集).为获取切割平面上的偏好最优点,提出了改进的坐标轮换法.在这些结论和方法的基础上,提出了决策者具有(严格)凸性偏好结构下的一类交互式多目标决策方法,要求决策者提供较易的偏好性息,决策效能较好.     

平面凸集存在最小凸生成集的充要条件

本文在平面上解决了StevenRLay在 [1 ]中提出的开放性问题“什么样的凸集存在唯一的最小凸生成子集” ,给出并证明了“平面上的凸集存在唯一的最小凸生成子集”的一个充要条件 .同时证明了En 中的开集一定不存在最小凸生成集 .     

常曲率平面上Fujiwara-Bol定理的注记

本文研究常曲率平面上的凸集,研究常曲平面上的凸集方法.根据Grinberg-Ren-Zhou的思想方法,我们给出著名的常曲率平面上Fujiwara-Bol定理的简单证明.     

平面常宽凸集的Firey-Sallee定理

常宽凸集是一类广泛应用在机械设计、医学等领域的特殊几何图形.本文探讨平面中的常宽凸集,简化证明著名的Firey-Sallee定理,即宽度相等的正Reuleaux多边形中Reuleaux三角形的面积最小.     

单位球面S~(n-1)上球凸集的分析研究方法（英文）

本文研究了欧式空间单位球面S~(n-1)上秋凸集的定义与基本性质.利用径向函数,定义了空间中有限个点的凸组合运算,并由此给出了S~(n-1)上球凸集的分析定义和集合球凸包的定义.讨论了球凸集和球凸包的基础性质.最后证明了任一闭球凸集都可以表示为其端点集的球凸包.这个结论的形成与获证完全得益于本文采用的分析方法.     

极大代数上有限生成模的凸性

研究极大代数上有限生成模的凸性.基于极大代数上有限生成模的几何形态,运用代数与几何方法,分析空间维数n≤3和生成向量数m≥1的有限生成模的凸性.证明n=1,2的有限生成模是凸集.对于n=3,给出m=2的有限生成模为凸集的一个充分必要条件,以及m≥3的有限生成模为凸集的一个充分条件.此外,对于极大代数上有限生成模的几何形态,发现n=3,m≥3的形态有三种情形.     

平面有限点集问题初探

国内外数学竞赛中有不少关于平面有限点集的试题,这类问题处理起来往往使人感到困难,常有不知从何做起的感觉。本文尝试着探讨解决这类问题的几种常见方法。一、“极端性”原则平面有限点集的元素是有限的,所以解决这类问题时,可以考虑从某些在数量上达到极端值(最大值或最小值)的元素作为分析问题的出发点,来寻求问题的答案。例1 给定平面上n(≥4)个点,其中无三点共线,证明:存在以已知点为顶点的三角形使得其余n-3个     

The modified method of refined bounds for polyhedral approximation of convex polytopes

The modified method of refined bounds is proposed and experimentally studied. This method is designed to iteratively approximate convex multidimensional polytopes with a large number of vertices. Approximation is realized by a sequence of convex polytopes with a relatively small but gradually increasing number of vertices. The results of an experimental comparison between the modified and the original methods of refined bounds are presented. The latter was designed for the polyhedral approximation of multidimensional convex compact bodies of general type.     

Fagnano Orbits of Polygonal Dual Billiards

Given a convex n-gon P, a Fagnano periodic orbit of the respective dual billiard map is an n-gon Q whose sides are bisected by the vertices of P. For which polygons P does the ratio Area Q/Area P have the minimal value? The answer is shown to be: for affine-regular polygons.     

多项式凸多面体的稳定性及严格正实性

对于由区间多项式的凸组合描述的不确定系统,它的Hurwitz稳定性可由某个仅由顶点和棱边构成的子集来保证,且此集合的大小与系统的维数无关。     

On weakly convex star-shaped polyhedra

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question as to whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof is based on a recent result of Izmestiev on the geometry of convex caps.     

k-eccentricity and absolute k-centrum of a probabilistic tree

The k-eccentricity evaluated at a point x of a graph G is the sum of the (weighted) distances from x to the k vertices farthest from it. The k-centrum is the set of vertices for which the k-eccentricity is a minimum. The concept of k-centrum includes, as a particular case, that of center and that of centroid (or median) of a graph. The absolute k-centrum is the set of points (not necessarily vertices) for which the k-eccentricity is a minimum. In this paper it will be proven that, for a weighted tree, both deterministic and probabilistic, the k-eccentricity is a convex function and that the absolute k-centrum is a connected set and is contained in an elementary path. Hints will be given for the construction of an algorithm to find the k-centrum and the absolute k-centrum.     

Some results on the upper convex densities for the self-similar sets

In this paper, by means of a basic result concerning the estimation of the lower bounds of upper convex densities for the self-similar sets, we show that in the Sierpinski gasket, the minimum value of the upper convex densities is achieved at the vertices. In addition, we get new lower bounds of upper convex densities for the famous classical fractals such as the Koch curve, the Sierpinski gasket and the Cartesian product of the middle third Cantor set with itself, etc. One of the main results improves corresponding result in the relevant reference. The method presented in this paper is different from that in the work by Z. Zhou and L. Feng [The minimum of the upper convex density of the product of the Cantor set with itself, Nonlinear Anal. 68 (2008) 3439-3444].     

A Structural Property of Convex 3-Polytopes

In this paper we prove that each convex 3-polytope contains a path on three vertices with restricted degrees which is one of the ten types. This result strengthens a theorem by Kotzig that each convex 3-polytope has an edge with the degree sum of its end vertices at most 13.     

On an empty triangle with the maximum area in planar point sets

Let P be a finite set of points in general position in the plane. We evaluate the ratio between the maximum area of an empty triangle of P and the area of the convex hull of P.     

On the length of longest alternating paths for multicoloured point sets in convex position

Let P be a set of points in R² in general position such that each point is coloured with one of k colours. An alternating path of P is a simple polygonal whose edges are straight line segments joining pairs of elements of P with different colours. In this paper we prove the following: suppose that each colour class has cardinality s and P is the set of vertices of a convex polygon. Then P always has an alternating path with at least (k-1)s elements. Our bound is asymptotically sharp for odd values of k.