Search arXivSearch

arXiv · 2407.11374

Splitting for integer tilings

Abstract

We consider translational integer tilings by finite sets $A\subset\mathbb{Z}$. We introduce a new method based on \emph{splitting}, together with a new combinatorial interpretation of some of the main tools from our earlier work. We also use splitting to prove the Coven-Meyerowitz conjecture for a new class of tilings $A\oplus B=\mathbb{Z}_M$. This includes tilings of period $M=p_1^{n_1}p_2^{n_2}p_3^{n_3}$ with $p_1>p_2^{n_2-1}p_3^{n_3-1}$, and tilings of period $M=p_1^{n_1}p_2^2p_3^2p_4^2$ with $p_1>p_2p_3p_4$, where $p_1,p_2,p_3,p_4$ are distinct primes and $n_1,n_2,n_3\in\mathbb{N}$. This is the second one of the two papers replacing version 1 of arXiv:2207.11809 (the first one is available as arXiv:2207.11809 v2). The main results of this paper (Theorem 1.2, Corollaries 1.4 and 1.5) and the intermediate results in Section 4.2 are all new and did not appear previously in arXiv:2207.11809 v1 or anywhere else. The material in Sections 3, 4.1, and 5 (splitting and the splitting formulation of the slab reduction) did appear in arXiv:2207.11809 v1 and has been removed from arXiv:2207.11809 v2. The results in Section 7 were included in arXiv:2207.11809 v1 and have been removed from arXiv:2207.11809 v2; the proofs are shorter and (we hope) more readable.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Izabella Łaba, Itay Londner. 2024-07-16. Splitting for integer tilings. https://arxiv.org/abs/2407.11374

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

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO