Search arXivSearch

arXiv · 2408.09301

On sets with missing differences in compact abelian groups

Abstract

A much-studied problem posed by Motzkin asks to determine, given a finite set $D$ of integers, the so-called Motzkin density for $D$, i.e., the supremum of upper densities of sets of integers whose difference set avoids $D$. We study the natural analogue of this problem in compact abelian groups. Using ergodic-theoretic tools, this is shown to be equivalent to the following discrete problem: given a lattice $Λ\subset \mathbb{Z}^r$, letting $D$ be the image in $\mathbb{Z}^r/Λ$ of the standard basis, determine the Motzkin density for $D$ in $\mathbb{Z}^r/Λ$. We study in particular the periodicity question: is there a periodic $D$-avoiding set of maximal density in $\mathbb{Z}^r/Λ$? The Greenfeld--Tao counterexample to the periodic tiling conjecture implies that the answer can be negative. On the other hand, we prove that the answer is positive in several cases, including the case rank$(Λ)=1$ (in which we give a formula for the Motzkin density), the case rank$(Λ)=r-1$, and hence also the case $r\leq 3$. It follows that, for up to three missing differences, the Motzkin density in a compact abelian group is always a rational number.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Candela, Fernando Chamizo, Antonio Córdoba. 2025-10-21. On sets with missing differences in compact abelian groups. https://arxiv.org/abs/2408.09301

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