Related papers: Towards Resolving Keller's Cube Tiling Conjecture …
Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.
Let $\mathscr T$ be a $2$-Calabi--Yau triangulated category, $T$ a cluster tilting object with endomorphism algebra $\Gamma$. Consider the functor $\mathscr T( T,- ) : \mathscr T \rightarrow \mod \Gamma$. It induces a bijection from the…
This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…
A quasiperiodic 7-fold rhombic tiling is constructed with an iterative substitution scheme. The inflation factor is 5.04892..., the square of the longer diagonal of a regular heptagon. There are many substitutions possible that fill larger…
We study the properties of tilting modules in the context of properly stratified algebras. In particular, we answer the question when the Ringel dual of a properly stratified algebra is properly stratified itself, and show that the class of…
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
In the 60's, Berger famously showed that translational tilings of $\mathbb{Z}^2$ with multiple tiles are algorithmically undecidable. Recently, Bhattacharya proved the decidability of translational monotilings (tilings by translations of a…
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…
It was shown by Gruslys, Leader and Tan that any finite subset of $\mathbb{Z}^n$ tiles $\mathbb{Z}^d$ for some $d$. The first non-trivial case is the punctured interval, which consists of the interval $\{-k,\ldots,k\} \subset \mathbb{Z}$…
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…
The number of ways to tile an $n$-board (an $n\times1$ rectangular board) with $(\frac12,\frac12;1)$-, $(\frac12,\frac12;2)$-, and $(\frac12,\frac12;3)$-combs is $T_{n+2}^2$ where $T_n$ is the $n$th tribonacci number. A…
Motivated by a question of Erd\"{o}s and inquiries by Beeson and Laczkovich, we explore the possible $N$ for which a triangle $T$ can tile into $N$ congruent copies of a triangle $R$. The \emph{reptile} cases (where $T$ is similar to $R$)…
A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…
We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the…
Let $C$ be a curve of genus two. We denote by $SU_C(3)$ the moduli space of semi-stable vector bundles of rank 3 and trivial determinant over $C$, and by $J^d$ the variety of line bundles of degree $d$ on $C$. In particular, $J^1$ has a…
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…
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…
We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…
The aim of this paper is to introduce tau-tilting theory, which completes (classical) tilting theory from the viewpoint of mutation. It is well-known in tilting theory that an almost complete tilting module for any finite dimensional…
We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…