Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2207.11809

The Coven-Meyerowitz tiling conditions for 3 prime factors: the even case

Izabella Laba·Itay Londner
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider finite sets $A\subset\mathbb{Z}$ tiles the integers by translations. By periodicity, any such tiling is equivalent to a factorization $A\oplus B=\mathbb{Z}_M$ of a finite cyclic group. Building on por previous work, we prove that a tentative characterization of finite tiles proposed by Coven and Meyerowitz holds for all integer tilings of period $M=(p_ip_jp_k)^2$, where $p_i,p_j,p_k$ are distinct primes. This extends the main result of [15] (Invent. Math. 2023), where we assumed that $M$ is odd. We also improve parts of the argument from [15]. We have split the earlier (70-page) version into two papers. The current version (49 pages) is the first of the two. The main result is the same as in the previous version: we prove (T2) in the 3-prime even case. The second paper will be posted shortly as a new submission. It will have a new main result where we prove (T2) for a new class of tilings (proved very recently, not included in v1 of this paper). Splitting-related results from the earlier 70-page version of this paper have been moved there.

Explore related subjects

math.COmath.CAmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Izabella Laba, Itay Londner. 2024-07-14. The Coven-Meyerowitz tiling conditions for 3 prime factors: the even case. https://arxiv.org/abs/2207.11809

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗