平行四边形的3-剖分

It has been proved that if a rectangle is dissected into three congruent pieces,then those pieces must themselves be rectangles. In the present paper this result is generalized to the case of parallelogram.     

On the Helly Number for Line Transversals to Parallel Triangles

We prove two results about the problem of finding the Helly number for line transversals to a family of parallel triangles in the plane: (1) If each three triangles of a family of parallel right triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all     

关于平行三角形集簇直线横截的Helly数

We prove two results about the problem of finding the Helly number for line transversals to a family of parallel triangles in the plane: (1) If each three triangles of a family of parallel right triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all the triangles of the family; (2) If each three triangles of a family of parallel obtuse triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all the triangles of the family. We also obtain that the Helly number of a family of parallel right or obtuse triangles is 3.     

Helly Type Problems forSome Special Convex Polygons

In the combinatorial geometry of convex sets the question of how efficiently a family ofconvex sets can be pierced by points has led to various problems which may be regarded asextensions of the Helly-type problems. A family of sets is said to be n-pierceable (abbreviatedas n) if there exists a set of n points such that each member of the family contains at leastone of them. A family of sets is said to be nk: if every subfamily of size k or less is n. Thefamous Helly theorem in combinatorial …     

关于分配問題

引言及符号本文中所谓分配问题(或称“占位问题”),指的是给定了n个物件,r个容器,在各种限制下(如某k个容器不空等)将全部物件分入所给容器的有关问题。这里我们感兴趣的是不同分法的总数。我们不考虑物件在容器中的顺序,也不考虑容器的排列顺序。为行文简洁,不妨以“室”代表容器,如果物件是相同的,以“球”代表物体,如果物件是相异的,以“人”代表物件,这样就将分配问题分为“人分室”及“球分室”两种类型。什么叫不同的分法?在“球分室”问题中,对于任二分法,当且仅当至少有一室球数不等时,称此二分法是不同的。在“人分室”问题中,对于任二分法,当且仅当至少有一室人数不等,或人数等但人不同时,称此二分法是不同的。这类问题在统计力学中有重要意义(见[2]p.41)笔者认为在高中代数讲完“排列组合”一章后,在课外活动中适当启发学生考虑这类问题,或有助于帮助学生了解所学知识在实际中的应用,从而激发学生的学习热情,如果进而解决这些问题,或可巩固并加深对所学知识的理解,培养综合运用所学知识的能力。实际上,比如学生在做完高中代数课本习题“将6本不同的     

RESEARCH ANNOUNCEMENTS Helly Type Problems for Some Special Convex Polygons

In the combinatorial geometry of convex sets the question of how efficiently a family of convex sets can be pierced by points has led to various problems which may be regarded as extensions of the Helly-type problems. A family of sets is said to be n-pierceable (abbreviated as Пn) if there exists a set of n points such that each member of the family contains at least one of them. A family of sets is said to be Пnk if every subfamily of size k or less is Пn. The famous Helly theorem in combinatorial geometry asserts that for finite families of convex sets in the plane П13 implies П1. In a recent paper by M. Katchalski and D. Nashtir[a] the following conjecture of Griinbaum[2] was mentioned again:     

一种特殊赋范空间中的Borsuk问题

Borsuk's problem is a famous problem in combinatorial geometry. It deals with the problem of partitioning a set into parts of smaller diameter. The problem was posed by the well-known Polish mathematician K. Borsuk in 1933. Many results have been obtained since then. In this paper, we discuss the Borsuk's problem in the normed space R^2 with regular hexagon as its unit sphere ∑ and obtain some new results.     

四边形的等积三角剖分

1970年Monsky证明了著名的Richman猜想: 正方形不能剖分成奇数个面积相等的三角形。近年来Stein等人研究一类特殊类型的四边形的等积三角剖分问题，获得了许多重要结果。该文进一步研究四边形等积三角剖分的待解决问题。      

Arrangements of Semicircles on S

ＡｒａｎｇｅｍｅｎｔｓｏｆＳｅｍｉｃｉｒｃｌｅｓｏｎＳ１ＬｉＹｉｎｇｚｉ（李英姿）ＤｉｎｇＲｅｎ（丁仁）（Ｄｅｐｔ．ｏｆＭａｔｈ．，ＨｅｂｅｉＴｅａｃｈｅｒｓ’Ｕｎｉｖｅｒｓｉｔｙ，Ｓｈｉｊｉａｚｈｕａｎｇ，Ｈｅｂｅｉ，０５００１６）Ｃｏｍｍｕｎｉｃ...     

关于Hausdorff距离

本文对Ｈａｕｓｄｏｒｆｆ距离的定义及有关性质作了深入讨论．