首页> 外文期刊>Journal of Combinatorial Theory, Series A >On the maximum number of touching pairs in a finite packing of translates of a convex body
【24h】

On the maximum number of touching pairs in a finite packing of translates of a convex body

机译:关于凸体平移的有限堆积中接触对的最大数量

获取原文
获取原文并翻译 | 示例
           

摘要

A Minkowski space M-d = (R-d, parallel to parallel to) is just R-d with distances measured using a norm parallel to parallel to. A norm parallel to parallel to is completely determined by its unit ball {x is an element of R-d parallel toxparallel to less than or equal to 1} which is a centrally symmetric convex body of the d-dimensional Euclidean space E-d. In this note we give upper bounds for the maximum number of times the minimum distance can occur among n points in M-d, d greater than or equal to 3. In fact, we deal with a somewhat more general problem namely, we give upper bounds for the maximum number of touching pairs in a packing of n translates of a given convex body in E-d, d greater than or equal to 3. (C) 2002 Elsevier Science (USA). [References: 13]
机译:Minkowski空间M-d =(R-d,平行与平行)只是R-d,其距离使用平行-平行范数测量。平行于平行于的范数完全由其单位球{x是R-d 平行于小于等于1的x的元素}确定,它是d维欧氏空间E-d的中心对称凸体。在本注释中,我们给出了最大距离的上限,该次数可以在Md中的n个点之间出现最小距离,d大于或等于3。实际上,我们处理了一个更一般的问题,即,为给定凸体在n中的n个填充中接触对的最大数量,d等于或大于3。(C)2002 Elsevier Science(美国)。 [参考:13]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号