Related papers: On Keller's conjecture in dimension seven
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…
The purpose of this paper is to investigate the properties of spectral and tiling subsets of cyclic groups, with an eye towards the spectral set conjecture in one dimension, which states that a bounded measurable subset of $\mathbb{R}$…
Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…
In this article we introduce a new class of non-commutative projective curves and show that in certain cases the derived category of coherent sheaves on them has a tilting complex. In particular, we prove that the right bounded derived…
We study tiling and spectral sets in vector spaces over prime fields. The classical Fuglede conjecture in locally compact abelian groups says that a set is spectral if and only if it tiles by translation. This conjecture was disproved by T.…
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 . We wish to…
A tiling of a vector space $S$ is the pair $(U,V)$ of its subsets such that every vector in $S$ is uniquely represented as the sum of a vector from $U$ and a vector from $V$. A tiling is connected to a perfect codes if one of the sets, say…
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with probability p, independently of the others. We prove that…
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…
An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…
The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a…
We prove that the abundance conjecture for non-uniruled klt pairs in dimension $n$ implies the abundance conjecture for uniruled klt pairs in dimension $n$, assuming the Minimal Model Program in lower dimensions.
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…
The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of $2k+1$-dimensional hypercube. The conjecture is known to be true for $k \leq 17$ [I.Shields, B.J.Shields and C.D.Savage, Disc. Math., 309,…
We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
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…
In an abelian category $\mathscr{A}$, we can generate torsion pairs from tilting objects of projective dimension $\leq 1$. However, when we look at tilting objects of projective dimension $2$, there is no longer a natural choice of an…