Search arXivSearch

arXiv · 2502.15608

Homochiral inflation for the aperiodic monotile Tile(1,1)

Abstract

The recently discovered chiral monotile Tile(1,1) is tiling the plane in a quasiperiodic fashion by taking twelve different orientations when applying $2π/12$ rotation. An homochiral inflation construction of such a quasiperiodic tiling is proposed where the chirality of the monotile is completely fixed at all inflation steps, avoiding to exchange its chirality between two successive steps. Doing so, the twelve possible orientations of the monotile are explicitly coded and the key difference between odd and even orientations is taken into account. The tiling is decomposed using only two different clusters, $Γ$ and $Ω$, each of them taking six possible orientations. This gives a total set of twelve metatiles, which assembly can be mapped onto a triangular lattice. This approach allows to properly separate rotation and translation symmetry elements relating monotiles together. As all possible orientations of the two clusters are already incorporated in the twelve metatiles, positions of adjacent metatiles are given by translations which are along three equivalent directions ($2π/3$ rotation) as evidenced by junction lines. Finally, thanks to the homochiral inflation, the orientation distribution of the monotile at each inflation step is computed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marianne Imperor-Clerc, Jean-François Sadoc. 2025-02-21. Homochiral inflation for the aperiodic monotile Tile(1,1). https://arxiv.org/abs/2502.15608

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO