两个互异圆盘的稠密填充-应用数学专业论文.docxVIP

摘 摘 要 填充和覆盖理论是组合几何与离散几何中的一个重 要分支。关于填充问题有着各种各样的猜想。关于圆盘的 填充闯题的一个重要猜想是：在全等圜盘的填充中，密 度最大填充可由正六边形阿基米德镶嵌中的内圆得到， 这一猜想直到本世纪初才得以证明。而对于两种不同的 圆盘填充密度的研究至今还未见明显突破。 本文所研究的是半径为I与2／疆一1的两种圆盘的填 充密度。利用欧式空间中正多边形的(12，12，3)阿基米德 铺砌，借助一个新函数t，，通过对t。的计算及一系列的证 明，我们得到如下结果： 在欧氏平面中，由半径为1和2／罐一1的两种圆盘构 成的填充密度不超过d3，其中d。=!』旦二!j!{掣=。．95。3 这个界是可以达到的，当这两种圆盘以(12，12，3)构 型排列时等号成立。 关键词：填充，密度，铺砌 ABSTRACTTheory ABSTRACT Theory of packing attd covering is an inlportant field in combinatorial and discrete geometry．Finding economical packing of circles in the Eu— clidean plane is a wi,tely investigated area of the theory of packing and covering The simplest probIem of thb kind is to find the best arrange lnent of congruent discs in the plane．One of the new problem is the search for the delisest packings and the loosest coverings consisting of inc：oDgrllent discs The main goal of this paper is to study the density of the two circle packing，in particular，the relevant density t)roblems of the set of incir— des of the A x’chimedean tessellation(12，12，3)．Our main result，is the followi『llg The denm}jq。|fl packin9 in thr：ETw_fidcan 1A∽( radius』and 7，=2／、／石一1虻塑掣扎啪s．cn7。ttot exceed and this bouttd ts sha,■?cquahty ls attained hlj the set u!incucles(1| 。serrtire小Ltu’1 tessellation(1e，12}3)of properl9 cJtoscTt size Key words：packiug，density，te,h,sellatio oN oN THE DENSEST PACKING oF TWo DIFFERENT DISCS ZHANG LING DepaTtment of Mm．thematics，Hebei Normal Universlty Shijiazhuang，Hebei，050016，PR．China 1．INTRODUCTION Finding economical packing of circles in the Euclidean plane is a widely investigated area of the theory of packing and covering．The simplest problem of this kind is to find the best arrangement of congruent discs in the plane．One of the new problem is the search for the densest packings and the loosest coverings consisting of incongruent discs． On one hand，density bounds were given for cases when the radii were confined to a given interval or to a given set of values and on the other hand configuratio