首页> 外文期刊>Journal of Combinatorial Theory, Series A >On the structure of cube tilings of R3 and R4
【24h】

On the structure of cube tilings of R3 and R4

机译:关于R3和R4的立方体拼贴的结构

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

摘要

A family of translates of the unit cube [0, 1) ~d+T={[0, 1) ~d+t:t∈T}, T;Rd, is called a cube tiling of Rd if cubes from this family are pairwise disjoint and t∈T[0,1)d+t=Rd. A non-empty set B=B1×...×Bd;Rd is a block if there is a family of pairwise disjoint unit cubes [0, 1) ~d+S, S;Rd, such that B=; t∈S[0, 1) ~d+t and for every t, t '∈S there is i∈{1,..., d} such that ti-ti'∈Z;{0}. A cube tiling of Rd is blockable if there is a finite family of disjoint blocks B, |B|>1, with the property that every cube from the tiling is contained in exactly one block of the family B. We construct a cube tiling T of R4 which, in contrast to cube tilings of R3, is not blockable. We give a new proof of the theorem saying that every cube tiling of R3 is blockable.
机译:如果单位立方[0,1)〜d + T = {[0,1)〜d + t:t∈T},T; Rd的翻译族,如果该族中的多维数据集被称为Rd的多维数据集是成对不相交的且t∈T[0,1)d + t = Rd。非空集B = B1×...×Bd; Rd是一个块,如果存在成对的不相交单元立方[0,1)〜d + S,S; Rd的族,使得B =; t∈S[0,1)〜d + t并且每t,t'∈S有i∈{1,...,d}使得ti-ti'∈Z; {0}。如果存在有限的不相交的块B系列,| B |> 1,则Rd的多维数据集切片是可阻止的,其属性是,该切片中的每个多维数据集都恰好包含在族B的一个块中。我们构造了一个多维数据集切片T与R3的立方体平铺相比,R4的块不可阻塞。我们给出了一个新的定理证明,说R3的每个立方体平铺都是可阻塞的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号