首页 | 本学科首页   官方微博 | 高级检索  
     


The one-sided kissing number in four dimensions
Authors:Oleg R. Musin
Affiliation:(1) Institute for Math. Study of Complex Systems, Moscow State University, Moscow, Russia
Abstract:Summary Let ]]>]]>]]>]]>]]>]]>]]>]]>]]>]]>]]>]]>H$ be a closed half-space of $n$-dimensional Euclidean space. Suppose $S$ is a unit sphere in $H$ that touches the supporting hyperplane of $H$. The one-sided kissing number $B(n)$ is the maximal number of unit nonoverlapping spheres in $H$ that can touch $S$. Clearly, $B(2)=4$. It was proved that $B(3)=9$. Recently, K. Bezdek proved that $B(4)=18$ or 19, and conjectured that $B(4)=18$. We present a proof of this conjecture.
Keywords:sphere packings  kissing numbers  spherical codes  Delsarte's method
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号