Search arXivSearch

arXiv · 2609.26576

Periodic Tilings of Cardinality Twice a Prime or Nine in Arbitrary Dimension

Abstract

We prove that every finite translational tile of $\mathbb Z^d$ of cardinality $2q$, where $q$ is an odd prime, or of cardinality nine admits a fully periodic tiling complement. The result holds in every dimension, regardless of the rank of the subgroup generated by the differences of points of the tile. The proofs combine coprime dilation, vanishing sums of roots of unity, and periodic two-colorings. After translating the tile, both arguments restrict to its intrinsic lattice, and every periodic complement constructed there extends to the ambient lattice. For cardinality $2q$, spectral filtering in the intrinsic lattice yields either a lattice complement or a periodic twofold covering compatible with a tiling complement. This compatibility allows the covering to be split by a periodic proper two-coloring. For nine points, intrinsic ranks $1$ and $2$ are treated separately; in higher intrinsic rank, the algebraic reduction in the intrinsic lattice yields either a lattice complement or spectral support on finitely many rational affine circles. These results also give a decision algorithm for tileability in both cardinality families. The circle-supported alternative is resolved by a conditional-density dichotomy and a periodic replacement argument for the exceptional half-density components.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hu Tan, Ying Zhang. 2026-09-22. Periodic Tilings of Cardinality Twice a Prime or Nine in Arbitrary Dimension. https://arxiv.org/abs/2609.26576

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO