Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 86 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 43 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 466 tok/s Pro
Kimi K2 225 tok/s Pro
2000 character limit reached

Gluing and cutting cube tiling codes in dimension six (2008.10016v2)

Published 23 Aug 2020 in math.CO and math.MG

Abstract: Let $S$ be a set of arbitrary objects, and let $s\mapsto s'$ be a permutation of $S$ such that $s"=(s')'=s$ and $s'\neq s$. Let $Sd={v_1...v_d\colon v_i\in S}$. Two words $v,w\in Sd$ are dichotomous if $v_i=w'_i$ for some $i\in [d]$, and they form a twin pair if $v_i'=w_i$ and $v_j=w_j$ for every $j\in [d]\setminus {i}$. A polybox code is a set $V\subset Sd$ in which every two words are dichotomous. A polybox code $V$ is a cube tiling code if $|V|=2d$. 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'$ 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 $j\in [d]\setminus {i}$ and $u_i=$, where $\not\in S$ 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'$ and $u_j=q_j=t_j$ for every $j\in [d]\setminus {i}$. If $V,W\subset Sd$ 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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.