Gluing and cutting cube tiling codes in dimension six

DOI10.1007/S00454-022-00389-6arXiv2008.10016MaRDI QIDQ6347567

Andrzej Kisielewicz

Publication date: 23 August 2020

Abstract: Let $S$ be a set of arbitrary objects, and let $smapsto{s}^{\prime }$ be a permutation of $S$ such that $$ and $s^{\prime }eqs$. Let $S^d=v_1...v_{d}colon{v}_{i}inS$. Two words $v,win{S}^d$ are dichotomous if $v_i=w{\text{'}}_i$ for some $iin[d]$, and they form a twin pair if ${v_i}^{\prime }=w_i$ and $v_j=w_j$ for every $jin[d]setminusi$. A polybox code is a set $Vsubset{S}^d$ in which every two words are dichotomous. A polybox code $V$ is a cube tiling code if $|V|=2^d$. A $2$-periodic cube tiling of $mathbb{R}^d$ and a cube tiling of flat torus $mathbb{T}^d$ can be encoded in a form of a cube tiling code. A twin pair $v,w$ in which $v_i={w_i}^{\prime }$ is glue (at the $i$th position) if the pair $v,w$ is replaced by one word $u$ such that $u_j=v_j=w_j$ for every $jin[d]setminusi$ and $u_i=*$, where $*otinS$ is some extra fixed symbol. A word $u$ with $u_i=*$ is cut (at the $i$th position) if $u$ is replaced by a twin pair $q,t$ such that $q_i={t_i}^{\prime }$ and $u_j=q_j=t_j$ for every $jin[d]setminusi$. If $V,Wsubset{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 $V$ to $W$, then we say that $W$ is obtained from $V$ 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.

Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

This page was built for publication: Gluing and cutting cube tiling codes in dimension six

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347567)