Search arXivSearch

arXiv · 1811.06718

On self-affine tiles whose boundary is a sphere

Abstract

Let $M$ be a $3\times 3$ integer matrix each of whose eigenvalues is greater than $1$ in modulus and let $\mathcal{D}\subset\mathbb{Z}^3$ be a set with $|\mathcal{D}|=|\det M|$, called digit set. The set equation $MT = T+\mathcal{D}$ uniquely defines a nonempty compact set $T\subset \mathbb{R}^3$. If $T$ has positive Lebesgue measure it is called a $3$-dimensional self-affine tile. In the present paper we study topological properties of $3$-dimensional self-affine tiles with collinear digit set, i.e., with a digit set of the form $\mathcal{D}=\{0,v,2v,\ldots, (|\det M|-1)v\}$ for some $v\in\mathbb{Z}^3\setminus\{0\}$. We prove that the boundary of such a tile $T$ is homeomorphic to a $2$-sphere whenever its set of neighbors in a lattice tiling which is induced by $T$ in a natural way contains $14$ elements. The combinatorics of this lattice tiling is then the same as the one of the bitruncated cubic honeycomb, a body-centered cubic lattice tiling by truncated octahedra. We give a characterization of $3$-dimensional self-affine tiles with collinear digit set having $14$ neighbors in terms of the coefficients of the characteristic polynomial of $M$. In our proofs we use results of R. H. Bing on the topological characterization of spheres.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jörg Thuswaldner, Shu-qin Zhang. 2019-06-20. On self-affine tiles whose boundary is a sphere. https://arxiv.org/abs/1811.06718

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT