Ethan M. Coven, William Geller, Sylvia Silberger, William P. Thurston
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of all such sequences is a sofic system, called a tiling system. We show that, up to powers of the shift, every shift of finite type can be realized as a tiling system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Keller properties for integer tiling
本文研究整数平铺中Keller猜想的类似物，该猜想涉及立方体平铺中共享面的存在性，已知在低维成立、高维失败。
Integer compositions, integer partitions, Fibonacci numbers, and generalizations of these have recently been shown to be interconnected via two-toned tilings of horizontal grids. In this article, we present refinements of two-toned tilings, describe functions which analyze them, and apply these to generalizations of integer compositions and partitions which interpolate between the two.
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
Classifying integer tilings and hypertilings
本文通过推广费马图的方法，对整数铺砌和超铺砌进行了分类，揭示了其与三角化多边形的lambda长度和权重数据的关系。
Conway and Lagarias observed that a triangular region T(m) in a hexagonal lattice admits signed tiling by three-in-line polyominoes (tribones) if and only if m=9d-1 or m=9d for some integer d. We apply the theory of Groebner bases over integers to show that T(m) admits a signed tiling by n-in-line polyominoes (n-bones) if and only if m=dn^2-1 or m=dn^2 for some integer d. Explicit description of the Groebner basis allows us to calculate the "Groebner discrete volume" of a lattice region by applying the division algorithm to its `Newton polynomial'. Among immediate consequences is a description…
In this paper, we propose an Integer Linear Model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how this model can be used to efficiently check the necessity of the Coven-Meyerowitz's $(T2)$ condition and also to define an iterative algorithm that finds all the possible tilings of the rhythm A. To conclude, we run several experiments to validate the time efficiency of this model.
When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a theoretical framework, based on multiple residues and dual groups, to provide a set of necessary and sufficient conditions for such a lattice tiling to exist. We also investigate the question of when a lattice tiling must possess at least two translated sublattices which are translates of one another.
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the equivalence to plane partitions). Formulae as products of factorials have been conjectured and, one by one, proven for the number of such tilings under each of the symmetries of the hexagon. However, when this note was written the entry for the number of distinct such tilings in the Online Encyclopedia of Integer Sequences (OEIS) consisted of little more than a ta…
Partitioning a set into similar, if not, identical, parts is a fundamental research topic in combinatorics. The question of partitioning the integers in various ways has been considered throughout history. Given a set $\{x_1, \ldots, x_n\}$ of integers where $x_1<\cdots<x_n$, let the {\it gap sequence} of this set be the nondecreasing sequence $d_1, \ldots, d_{n-1}$ where $\{d_1, \ldots, d_{n-1}\}$ equals $\{x_{i+1}-x_i:i\in\{1,\ldots, n-1\}\}$ as a multiset. This paper addresses the following question, which was explicitly asked by Nakamigawa: can the set of integers be partitioned into sets …
Suppose that A is a finite set of integers of diameter D. Suppose also that the set of integers B is such that A+B is a tiling of the integers, that is each integer is uniquely expressible as a+b, with a in A, b in B. It is well known that B must be a periodic set in this case. Here we study the relationship between the diameter D of A and the least period T of B. We show that T is at most C exp(C \sqrt D \log D \sqrt{\log\log D}) and that we can have T at least quadratic in D.
Recently there has been significant progress in classifying integer friezes and $\text{SL}_2$-tilings. Typically, combinatorial methods are employed, involving triangulations of regions and inventive counting techniques. Here we develop a unified approach to such classifications using the tessellation of the hyperbolic plane by ideal triangles induced by the Farey graph. We demonstrate that the geometric, numeric and combinatorial properties of the Farey graph are perfectly suited to classifying tame $\text{SL}_2$-tilings, positive integer $\text{SL}_2$-tilings, and tame integer friezes -- bot…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
We show that a square-tiling of a $p\times q$ rectangle, where $p$ and $q$ are relatively prime integers, has at least $\log_2p$ squares. If $q>p$ we construct a square-tiling with less than $q/p+C\log p$ squares of integer size, for some universal constant $C$.
A general framework for quasi-isometries in symbolic dynamics beyond groups
本文提出一种代数结构，用于通过状态、生成元和关系编码可数图集，用于研究蓝图上的符号动力学，并通过准等距转移不变量。
On the minimal period of integer tilings
本文研究整数平铺的最小周期，证明其可由集合直径 D 的次指数函数界定，并构造出接近 D^{3/2} 下界的例子，同时探讨了该估计与 Coven-Meyerowitz 猜想的联系。
A set is said to tile the integers if and only if the integers can be written as a disjoint union of translates of that set. We consider the problem of finding necessary and sufficient conditions for a finite set to tile the integers. For sets of prime power size, it was solved by D. Newman [J. Number Theory 9 (1977), 107--111]. We solve it for sets of size having at most two prime factors. The conditions are always sufficient, but it is unknown whether they are necessary for all finite sets.
Resnikoff silver numbers and tilings of the half-line (Dedicated to the memory of H.L.Resnikoff)
本文研究了Resnikoff银数与半直线铺砌的关系，通过非积累条件探讨了银数生成铺砌的条件，并给出了Penrose非周期性结果的证明。
Let K_4^3-2e denote the hypergraph consisting of two triples on four points. For an integer n, let t(n, K_4^3-2e) denote the smallest integer d so that every 3-uniform hypergraph G of order n with minimum pair-degree δ_2(G) \geq d contains \floor{n/4} vertex-disjoint copies of K_4^3-2e. Kühn and Osthus proved that t(n, K_4^3-2e) = (1 + o(1))n/4 holds for large integers n. Here, we prove the exact counterpart, that for all sufficiently large integers n divisible by 4, t(n, K_4^3-2e) = n/4 when n/4 is odd, and t(n, K_4^3-2e) = n/4+1 when n/4 is even. A main ingredient in our proof is the recent …
It is well known that if a finite set $A\subset\mathbb{Z}$ tiles the integers by translations, then the translation set must be periodic, so that the tiling is equivalent to a factorization $A\oplus B=\mathbb{Z}_M$ of a finite cyclic group. We are interested in characterizing all finite sets $A\subset\mathbb{Z}$ that have this property. Coven and Meyerowitz (1998) proposed conditions (T1), (T2) that are sufficient for $A$ to tile, and necessary when the cardinality of $A$ has at most two distinct prime factors. They also proved that (T1) holds for all finite tiles, regardless of size. It is no…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some $M\in\mathbb{N}$ and $B\subset\mathbb{Z}$. This can also be stated in terms of cyclotomic divisibility of the mask polynomials $A(X)$ and $B(X)$ associated with $A$ and $B$. In this article, we introduce a new approach to a systematic study of such tilings. Our main new tools are the box product, multiscale cuboids, and saturating spaces, developed through a combination…
The notion of $SL_2$-tiling is a generalization of that of classical Coxeter-Conway frieze pattern. We classify doubly antiperiodic $SL_2$-tilings that contain a rectangular domain of positive integers. Every such $SL_2$-tiling corresponds to a pair of frieze patterns and a unimodular $2\times2$-matrix with positive integer coefficients. We relate this notion to triangulated $n$-gons in the Farey graph.
Given integer $k$ and a $k$-graph $F$, let $t_{k-1}(n,F)$ be the minimum integer $t$ such that every $k$-graph $H$ on $n$ vertices with codegree at least $t$ contains an $F$-factor. For integers $k\geq3$ and $0\leq\ell\leq k-1$, let $\mathcal{Y}_{k,\ell}$ be a $k$-graph with two edges that shares exactly $\ell$ vertices. Han and Zhao (JCTA, 2015) asked the following question: For all $k\ge 3$, $0\le \ell\le k-1$ and sufficiently large $n$ divisible by $2k-\ell$, determine the exact value of $t_{k-1}(n,\mathcal{Y}_{k,\ell})$. In this paper, we show that $t_{k-1}(n,\mathcal{Y}_{k,\ell})=\frac{n}…
The Hajnal--Szemerédi theorem states that for any integer $r \ge 1$ and any multiple $n$ of $r$, if $G$ is a graph on $n$ vertices and $δ(G) \ge (1 - 1/r)n$, then $G$ can be partitioned into $n/r$ vertex-disjoint copies of the complete graph on $r$ vertices. We prove a very general analogue of this result for directed graphs: for any integer $r \ge 4$ and any sufficiently large multiple $n$ of $r$, if $G$ is a directed graph on $n$ vertices and every vertex is incident to at least $2(1 - 1/r)n - 1$ directed edges, then $G$ can be partitioned into $n/r$ vertex-disjoint subgraphs of size $r$ eac…
Generalized Integer Partitions, Tilings of Zonotopes and Lattices
本文利用动力系统与序理论，证明广义整数分拆集合构成分配格，并刻画了二维 zonotopes 铺砌集合为分配格的不交并，深化了对翻转铺砌行为的理解。
Let k_1,...,k_d be positive integers, and D be a subset of [k_1]x...x[k_d], whose complement can be decomposed into disjoint sets of the form {x_1}x...x{x_{s-1}}x[k_s]x{x_{s+1}}x...x{x_d}. We conjecture that the number of elements of D can be represented as a linear combination of the numbers k_1,..., k_d with non-negative integer coefficients. A connexion of this conjecture with the structure of periodical cube tilings is revealed.
We discuss problems of simultaneous tiling. This means that we have an object (set, function) which tiles space with two or more different sets of translations. The most famous problem of this type is the Steinhaus problem which asks for a set simultaneously tiling the plane with all rotates of the integer lattice as translation sets.
We prove that for all integers $Δ,r \geq 2$, there is a constant $C = C(Δ,r) >0$ such that the following is true for every sequence $\mathcal{F} = \{F_1, F_2, \ldots\}$ of graphs with $v(F_n) = n$ and $Δ(F_n) \leq Δ$, for each $n \in \mathbb{N}$. In every $r$-edge-coloured $K_n$, there is a collection of at most $C$ monochromatic copies from $\mathcal{F}$ whose vertex-sets partition $V(K_n)$. This makes progress on a conjecture of Grinshpun and Sárközy.
For a fixed integer h>=1, let G be a tripartite graph with N vertices in each vertex class, N divisible by 6h, such that every vertex is adjacent to at least 2N/3+h-1 vertices in each of the other classes. We show that if N is sufficiently large, then G can be tiled perfectly by copies of K_{h,h,h}. This extends the work in [19] and also gives a sufficient condition for tiling by any (fixed) 3-colorable graph. Furthermore, we show that this minimum-degree condition is best possible and provide very tight bounds when N is divisible by h but not by 6h.
The smallest square tileable by pairwise incomparable integer rectangles
本文证明 27 是可被两两不可比较的整数矩形铺砌的最小正方形边长，通过结构约简与穷举搜索验证了所有 n≤26 的情况。
The set B_{p,r}^q:=\{\floor{nq/p+r} \colon n\in Z \} with integers p, q, r) is a Beatty set with density p/q. We derive a formula for the Fourier transform \hat{B_{p,r}^q}(j):=\sum_{n=1}^p e^{-2 πi j \floor{nq/p+r} / q}. A. S. Fraenkel conjectured that there is essentially one way to partition the integers into m>2 Beatty sets with distinct densities. We conjecture a generalization of this, and use Fourier methods to prove several special cases of our generalized conjecture.
We give a new proof of the Cobham's first theorem using ideas from symbolic dynamics and of the Cobham-Semenov theorem (in the primitive case) using ideas from tiling dynamics.
Splitting for integer tilings
本文提出基于分裂的整数平铺研究新方法，给出前期核心工具的新组合解释，证明两类素数幂周期的整数平铺满足Coven-Meyerowitz猜想，是替换arXiv:2207.11809第1版的两篇论文之一。
We say that two sets $S,T\subset\{1,2,\dots,n\}$ are chord separated if there does not exist a cyclically ordered quadruple $a,b,c,d$ of integers satisfying $a,c\in S-T$ and $b,d\in T-S$. This is a weaker version of Leclerc and Zelevinsky's weak separation. We show that every maximal by inclusion collection of pairwise chord separated sets is also maximal by size. Moreover, we prove that such collections are precisely vertex label collections of fine zonotopal tilings of the three-dimensional cyclic zonotope. In our construction, plabic graphs and square moves appear naturally as horizontal se…
Functional tilings and the Coven-Meyerowitz tiling conditions
本文研究函数平铺，证明Coven-Meyerowitz平铺条件在函数松弛下不必然成立，为未来构造平铺反例提供潜在方向。
An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex hexagons of unit area with exactly $k$ irregular vertices. Using the same approach we show that there are normal edge-to-edge tilings of the plane by hexagons of unit area and exactly $k$ many $n$-gons ($n>6$) of unit area. A result of Akopyan yields an upper bound for $k$ depending on the maximal diameter and minimum area of the tiles. Our result complement…
F-boxes defined in [6] as hyper-boxes in N^{\infty} discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F-boxes edges sizes are taken to be values of terms of natural numbers' valued sequence F. The problem of partitions of hyper-boxes represented by graphs into blocks of special form is considered and these are to be called F-tilings. The proof of such tilings' existence for certain sub-family of admissible sequences F is delivered. The family of F-tilings which we consider here includes among others F = Natural numbers, Fibonacci n…
Overlapping substitutions and tilings
本文提出重叠替换的概念，通过非整数矩阵定义拼块频率，并证明其动力系统唯一测度性，同时构造了多种一维和高维例子。
On the Undecidability of Tiling the $3$-dimensional Space with a Set of $3$ Polycubes
本文针对单块平移平铺不可判定性的相关猜想，证明了用3个多立方体集合对3维空间进行平移平铺是不可判定的，为该猜想的证明提供了低维少瓦片的支撑结果。
Assume that $G$ is a graph with edge ideal $I(G)$ and let $I(G)^{(s)}$ denote the $s$-th symbolic power of $I(G)$. It is proved that for every integer $s\geq 1$, $${\rm reg}(I(G)^{(s+1)})\leq \max\bigg\{{\rm reg}(I(G))+2s, {\rm reg}\big(I(G)^{(s+1)}+I(G)^s\big)\bigg\}.$$As a consequence, we conclude that ${\rm reg}(I(G)^{(2)})\leq {\rm reg}(I(G))+2$, and ${\rm reg}(I(G)^{(3)})\leq {\rm reg}(I(G))+4$. Moreover, it is shown that if for some integer $k\geq 1$, the graph $G$ has no odd cycle of length at most $2k-1$, then ${\rm reg}(I(G)^{(s)})\leq 2s+{\rm reg}(I(G))-2$, for every integer $s\leq k…
The Coven-Meyerowitz tiling conditions for 3 prime factors: the even case
本文将Coven-Meyerowitz有限铺砌刻画的适用范围从奇数周期拓展至周期为三个不同素数平方乘积的偶数情形，改进了此前论证，并将原70页论文拆分为两篇，本文为第一篇。
Folding a sequence $S$ into a multidimensional box is a well-known method which is used as a multidimensional coding technique. The operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes and not just a box. The new definition of folding is based on a lattice tiling for the given shape $\cS$ and a direction in the $D$-dimensional integer grid. Necessary and sufficient conditions that a lattice tiling for $\cS$ combined with a direction define a folding of a sequence into $\cS$ are derived. The immediate and most impressive application is some new lo…
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $I\subset S$ is a squarefree monomial ideal. For every integer $k\geq 1$, we denote the $k$-th symbolic power of $I$ by $I^{(k)}$. Recently, Montaño and Núñez-Betancourt \cite{mn} proved that for every pair of integers $m, k\geq 1$,$${\rm depth}(S/I^{(m)})\leq {\rm depth}(S/I^{(\lceil\frac{m}{k}\rceil)}).$$We provide an alternative proof for this inequality. Moreover, we reprove the known results that the sequence $\{{\rm depth}(S/I^{(k)})\}_{k=1}^{\infty}$ is co…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this report, we start with the simplest cases, with the smaller numbers: the number of ways to tile a $2 \times n$, $3 \times n$, $4 \times n$ rectangular board using $2 \times 1$ domino tiles, where the number of rows is fixed and we present a recursive formula based on $m$ and the earlier terms. This allows us to deduce the non-recursive formula for each case …
Let $G$ be a graph with $n$ vertices and let $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that the sequences $\{{\rm sdepth}(S/J(G)^{(k)})\}_{k=1}^\infty$ and $\{{\rm sdepth}(J(G)^{(k)})\}_{k=1}^\infty$ are non-increasing and hence convergent. Suppose that $ν_{o}(G)$ denotes the ordered matching number of $G$. We show that for every integer $k\geq 2ν_{o}(G)-1$, the modules $J(G)^{(k)}$ and $S/J(G)^{(k)}$ satisfy the Stanley's inequality. We al…
When Can You Tile an Integer Rectangle with Integer Squares?
本文刻画了整数矩形可被边长至少为2的整数正方形铺满的条件：当两维均至少为10时总是可行，小维度时行为呈周期性或由穷举确定。
Multivariate Poisson random variables subject to linear integer constraints arise in several application areas, such as queuing and biomolecular networks. This note shows how to compute conditional statistics in this context, by employing WF Theory and associated algorithms. A symbolic computation package has been developed and is made freely available. A discussion of motivating biomolecular problems is also provided.
Symbolic Sets for Proving Bounds on Rado Numbers
本文使用SAT求解器计算了特定线性方程的未知Rado数，并受求解结果启发证明了新的一般界限，同时开发了基于SymPy和Z3的符号集合工具来自动验证证明的正确性。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。