...
首页> 外文期刊>Geombinatorics >On Visible Tilings
【24h】

On Visible Tilings

机译:在可见拼贴上

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

摘要

A tiling of a d-dimensional cube C is a finite collection of d-dimensional cubes, or tiles, whose interiors are pairwise disjoint and whose union is C. A tiling is said to be visible if every tile has a face on the boundary of C. It is easy to see that if {A_1, A_2,...,A_n} is a visible tiling of the unit cube (square) in the case d = 2, and if s_i is the side length of A_i for each i, then Si< 4 and that the sum can be arbitrarily as close to 4 for appropriately chosen tiles. Extrapolating from this we show that if C is the unit cube in dimension d and {A_1,A_2,..., A_n} is a visible tiling, then < 2d and the sum can be made arbitrarily close to 2d.
机译:d维多维数据集C的平铺是d维多维数据集或图块的有限集合,其内部成对不相交且并集为C。如果每个图块在C的边界上都有一个面,则称此图块可见C.很容易看到,在d = 2的情况下,如果{A_1,A_2,...,A_n}是单位立方体(正方形)的可见平铺,并且s_i是每个i的A_i的边长,则Si <4,并且对于适当选择的图块,总和可以任意接近4。由此推断,如果C是维d中的单位立方体,并且{A_1,A_2,...,A_n}是可见的平铺,则<2d且总和可以任意接近2d。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号