Über Die Enge Von Kugelpackungen und Dicke Von Punktsystemen im Sphärischen Raum

It is given a lower bound for the closeness of packings of balls (Theorem 1) and an upper bound for thickness of point sets (Theorem 2) in d-dimensional spherical space. The bounds are improved for d = 2 (Theorem 3, 4).     

On Polygons Enclosing Point Sets II

Let R and B be disjoint point sets such that R ∪ B is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P. In this paper we prove that if the vertices of the convex hull of R ∪ B belong to B, and |R| ≤ |Conv(B)| − 1 then B encloses R. The bound is tight. This improves on results of a previous paper in which it was proved that if |R| ≤ 56 |Conv(B)| then B encloses R. To obtain our result we prove the next result which is interesting on its own right: Let P be a convex polygon with n vertices p ₁ , ... , p _n and S a set of m points contained in the interior of P, m ≤ n − 1. Then there is a convex decomposition {P ₁ , ... , P _n } of P such that all points from S lie on the boundaries of P ₁ , ... , P _n , and each P _i contains a whole edge of P on its boundary. F. Hurtado partially supported by projects MEC MTM2006-01267 and DURSI 2005SGR00692. C. Merino supported by CONACYT of Mexico, Proyecto 43098. J. Urrutia supported by CONACYT of Mexico, Proyecto SEP-2004-Co1-45876, and MCYT BFM2003-04062. I. Ventura partially supported by Project MCYT BFM2003-04062.     

Decompositions,Partitions, and Coverings with Convex Polygons and Pseudo-Triangles

We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex k-gons in point sets.     

球面空间中的Pedoe不等式与张-杨不等式及应用

本文应用距离几何的理论与方法,研究了n维球面空间中n维单形与有限点集的几何不等式问题,建立了球面空间中n维单形一种形式的Pedoe不等式与有限点集一种形式的张-杨不等式,并应用它获得n维球面空间中Veljan-Korchmaros型不等式与Finsler-Hadwinger型不等式.     

Extremal A-statistical limit points via ideals

In this paper, following the line of recent work of Savaş et al. [20] we apply the notion of ideals to A-statistical limit superior and inferior for a sequence of real numbers.     

Gluing Affine 2-Manifolds with Polygons

Affine structures on surfaces are constructed by gluing polygons. The geometry of the affine surface depends on the shape of the polygon(s) and the particular gluing transformations used. The affine version of the Poincaré fundamental polygon theorem expresses the fundamental group and holonomy of the surface in terms of the gluing data. The theorem may be used to construct all complete affine structures on the 2-torus. The space of inequivalent holonomy representations of such structures is homeomorphic to R2.     

Spherical Minimal Immersions with Prescribed Codimension

We describe a general construction of manufacturing new spherical minimal immersions between round spheres out of old ones. The new immersions have higher domain dimension and degree and the construction has a precise control on the codimension. Applied to classified and recent examples, the construction gives an abundance of new spherical minimal immersions with prescribed codimensions.Mathematics Subject Classifications (2000). 53C42     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings     

将闭Riemann子流形保角变形成极小子流形

在本文中，通过外围空间的适当保角变形，我们证明了，每个Riemann子流形可以被认作一个极小子流形，我们还研究了这样得到的子流形的稳定性，定理2和3推广了Schoen和S．TYan[2]的结论．     

信息系统决策的极小子集方法

定义范畴矩阵,进而基于范畴矩阵,将信息系统决策的三种基本决策转化为极小子集问题.     

序线性拓扑空间中的凸算子在矩阵极值中的应用

文［１］将Ｒｎ 中Ｋｕｈｎ－Ｔｕｃｋｅｒ的条件推广到了序线性拓扑空间中,文［６］从另一角度出发把著名的Ｊｅｎｓｅｎ 不等式推广到了序Ｂａｎａｃｈ 空间之中,本文在［１］,［６］启发之下,以锥为工具给出了序线性拓扑空间中的凸算子在矩阵极值中的某些应用,从而利用变分的方法得到了广义最小二乘解的一个新证明．     

三角形欧拉圆的高维推广

采用笛卡儿直角坐标法,定义了高维共球有限点集的"欧拉超球面"(它是三角形欧拉圆的高维推广)、"2号心"等概念,并揭示了它们的一系列基本性质.     

Height Preserving Minimal Interval Extensions

We consider minimal interval extensions of a partial order which preserve the height of each vertex. We show that minimal interval extensions having this property bijectively correspond to the maximal chains of a sublattice of the lattice of maximal antichains of the given order. We show that they also correspond to the set of minimal interval extensions of a certain extension of this order.     

L－fuzzy集网的R－收敛性质

本文在ＬＦ拓扑空间中建立了Ｌ－ｆｕｚｚｙ集网的弱收敛（Ｒ－收敛）概念，应用文［４］中的Ｒ－闭包，系统讨论了它们的性质，证明了等式ＲｌｉｍＡ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ和ＲｌｉｍＡ＿ｎ＝Ａ＿ｎ＝∧（∨Ａ＿ｍ）＿Ｒ并且给出了Ｌ－ｆｕｚｚｙ集网与其子网之间的关系。     

Extremal point queries with lines and line segments and related problems

We address a number of extremal point query problems when P is a set of n points in , d3 a constant, including the computation of the farthest point from a query line and the computation of the farthest point from each of the lines spanned by the points in P. In , we give a data structure of size O(n¹⁺), that can be constructed in O(n¹⁺) time and can report the farthest point of P from a query line segment in O(n^2/3+) time, where >0 is an arbitrarily small constant. Applications of our results also include: (1) Sub-cubic time algorithms for fitting a polygonal chain through an indexed set of points in , d3 a constant, and (2) A sub-quadratic time and space algorithm that, given P and an anchor point q, computes the minimum (maximum) area triangle defined by q with P{q}.     

Zero sets and uniqueness sets with one cluster point for the Dirichlet space

Zero sets and uniqueness sets of the Dirichlet space are not completely characterized yet. There are sufficient conditions for zero sets and necessary conditions for uniqueness sets and there is a gap in between. Our goal is to take some preliminary steps to fill this gap.     

A heuristic for the circle packing problem with a variety of containers

In this paper we present a heuristic algorithm based on the formulation space search method to solve the circle packing problem. The circle packing problem is the problem of finding the maximum radius of a specified number of identical circles that can be fitted, without overlaps, into a two-dimensional container of fixed size. In this paper we consider a variety of containers: the unit circle, unit square, rectangle, isosceles right-angled triangle and semicircle. The problem is formulated as a nonlinear optimization problem involving both Cartesian and polar coordinate systems.Formulation space search consists of switching between different formulations of the same problem, each formulation potentially having different properties in terms of nonlinear optimization. As a component of our heuristic we solve a nonlinear optimization problem using the solver SNOPT.Our heuristic improves on previous results based on formulation space search presented in the literature. For a number of the containers we improve on the best result previously known. Our heuristic is also a computationally effective approach (when balancing quality of result obtained against computation time required) when compared with other work presented in the literature.     

Lorentz序列空间的装球问题

Ｂａｎａｃｈ空间中装球问题的研究,近四十年来已取得了令人瞩目的发展。Ｂａｎａｃｈ空间的装球值的范围已经确定,Ｌ＿ｐ空间及Ｏｒｌｉｃｚ序列空间Ｉ＿Ｍ等许多经典Ｂａｎａｃｈ空间装球值已经找到．本文研究又一类经典Ｂａｎａｃｈ空间──Ｌｏｒｅｎｔｚ序列空间的装球问题,给出了Ｌｏｒｅｎｔｚ序列空间的装球值。