Related papers: Towards Resolving Keller's Cube Tiling Conjecture …
An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile'". The tile may or may not be similar to ABC . This paper is the…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
The family of right-angled tiling links consists of links built from regular 4-valent tilings of constant-curvature surfaces that contain one or two types of tiles. The complements of these links admit complete hyperbolic structures and…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…
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…
The spectral set conjecture, also known as the Fuglede conjecture, asserts that every bounded spectral set is a tile and vice versa. While this conjecture remains open on ${\mathbb R}^1$, there are many results in the literature that…
Turner's Conjecture describes all blocks of symmetric groups and Hecke algebras up to derived equivalence in terms of certain double algebras. With a view towards a proof of this conjecture, we develop a general theory of Turner doubles. In…
A Keller map is a counterexample to the Jacobian Conjecture. In dimension two every such map, if exists, leads to a complicated set of conditions on the map between the Picard groups of suitable compactifications of the affine plane. This…
Let D be a triangulated category with a cluster tilting subcategory U. The quotient category D/U is abelian; suppose that it has finite global dimension. We show that projection from D to D/U sends cluster tilting subcategories of D to…
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…
In 1965, Paul Erd\H{o}s asked about the largest family $Y$ of $k$-sets in $\{ 1, \ldots, n \}$ such that $Y$ does not contain $s+1$ pairwise disjoint sets. This problem is commonly known as the Erd\H{o}s Matching Conjecture. We investigate…
We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A…
A $d$-dimensional Latin hypercube of order $n$ is a $d$-dimensional array containing symbols from a set of cardinality $n$ with the property that every axis-parallel line contains all $n$ symbols exactly once. We show that for $(n, d)…
We show that an idempotent variety has a $d$-dimensional cube term if and only if its free algebra on two generators has no $d$-ary compatible cross. We employ Hall's Marriage Theorem to show that a variety of finite signature whose…
It is well established that a general pair of twisted cubic curves in complex projective space has ten common secant lines. As an initial investigation, we show that the monodromy group of the ten common secant lines over the complex…
Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
Let $n \ge d \ge \ell \ge 1$ be integers, and denote the $n$-dimensional hypercube by $Q_n$. A coloring of the $\ell$-dimensional subcubes $Q_\ell$ in $Q_n$ is called a $Q_\ell$-coloring. Such a coloring is $d$-polychromatic if every $Q_d$…