English

Gluing and cutting cube tiling codes in dimension six

Combinatorics 2022-01-31 v2 Metric Geometry

Abstract

Let SS be a set of arbitrary objects, and let sss\mapsto s' be a permutation of SS such that s"=(s)=ss"=(s')'=s and sss'\neq s. Let Sd={v1...vd ⁣:viS}S^d=\{v_1...v_d\colon v_i\in S\}. Two words v,wSdv,w\in S^d are dichotomous if vi=wiv_i=w'_i for some i[d]i\in [d], and they form a twin pair if vi=wiv_i'=w_i and vj=wjv_j=w_j for every j[d]{i}j\in [d]\setminus \{i\}. A polybox code is a set VSdV\subset S^d in which every two words are dichotomous. A polybox code VV is a cube tiling code if V=2d|V|=2^d. A 22-periodic cube tiling of Rd\mathbb{R}^d and a cube tiling of flat torus Td\mathbb{T}^d can be encoded in a form of a cube tiling code. A twin pair v,wv,w in which vi=wiv_i=w_i' is glue (at the iith position) if the pair v,wv,w is replaced by one word uu such that uj=vj=wju_j=v_j=w_j for every j[d]{i}j\in [d]\setminus \{i\} and ui=u_i=*, where ∉S*\not\in S is some extra fixed symbol. A word uu with ui=u_i=* is cut (at the iith position) if uu is replaced by a twin pair q,tq,t such that qi=tiq_i=t_i' and uj=qj=tju_j=q_j=t_j for every j[d]{i}j\in [d]\setminus \{i\}. If V,WSdV,W\subset S^d are two cube tiling codes and there is a sequence of twin pairs which can be interchangeably gluing and cutting in a way which allows us to pass from VV to WW, then we say that WW is obtained from VV by gluing and cutting. In the paper it is shown that for every two cube tiling codes in dimension six one can be obtained from the other by gluing and cutting.

Keywords

Cite

@article{arxiv.2008.10016,
  title  = {Gluing and cutting cube tiling codes in dimension six},
  author = {Andrzej P. Kisielewicz},
  journal= {arXiv preprint arXiv:2008.10016},
  year   = {2022}
}
R2 v1 2026-06-23T18:02:43.780Z