English
Related papers

Related papers: Keller's cube-tiling conjecture is false in high d…

200 papers

A spectral set in R^n is a set X of finite Lebesgue measure such that L^2(X) has an orthogonal basis of exponentials. It is conjectured that every spectral set tiles R^n by translations. A set of translations T has a universal spectrum if…

Functional Analysis · Mathematics 2007-05-23 Jeffrey C. Lagarias , Sandor Szabo

There were two famous conjectures on complete affine maximal surfaces, one due to E. Calabi, the other to S.S. Chern. Both were solved with different methods about one decade ago by studying the associated Euler-Lagrange equation. Here we…

Differential Geometry · Mathematics 2011-04-05 An-Min Li , Ruiwei Xu , Udo Simon , Fang Jia

Let $X$ be a smooth cubic hypersurface of dimension $n \ge 1$ over the rationals. It is well-known that new rational points may be obtained from old ones by secant and tangent constructions. In view of the Mordell--Weil theorem for $n=1$,…

Number Theory · Mathematics 2018-03-16 Stefanos Papanikolopoulos , Samir Siksek

In this note we determine the set of expansions such that a partial cube is planar if and only if it arises by a sequence of such expansions from a single vertex. This corrects a result of Peterin.

Combinatorics · Mathematics 2017-01-10 Rémi Desgranges , Kolja Knauer

In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered $n$-element set $[n]$ (using this notion to give a combinatorial characterization for quasi-commuting minors of a quantum…

Combinatorics · Mathematics 2016-09-20 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

A famous problem in discrete geometry is to find all monohedral plane tilers, which is still open to the best of our knowledge. This paper concerns with one of its variants that to determine all convex polyhedra whose every cross-section…

Combinatorics · Mathematics 2012-10-23 David G. L. Wang

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

Combinatorics · Mathematics 2019-08-30 Yen-chi Roger Lin , Wei-Hsuan Yu

Let $b(n)$ denote the number of cubic partition pairs of $n$. We give affirmative answer to a conjecture of Lin, namely, we prove that $$b(49n+37)\equiv 0 \pmod{49}.$$ We also prove two congruences modulo $256$ satisfied by…

Number Theory · Mathematics 2018-08-13 Chiranjit Ray , Rupam Barman

Matt Blum conjectured that the number of tilings of the Hexagonal Dungeon of sides $a,\ 2a,\ b,\ a,\ 2a,\ b$ (where $b\geq 2a$) is $13^{2a^2}14^{\lfloor\frac{a^2}{2}\rfloor}$ (J. Propp, New Perspectives in Geometric Combinatorics, Cambridge…

Combinatorics · Mathematics 2014-03-03 Mihai Ciucu , Tri Lai

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

Information Theory · Computer Science 2019-04-26 Gabriella Akemi Miyamoto

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed…

Computational Geometry · Computer Science 2025-06-16 Jack Stade

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$)…

Combinatorics · Mathematics 2026-04-07 Yan X Zhang

Can we color the $n^3$ cells of an $n\times n\times n$ cube $L$ with $n^2$ colors in such a way that each layer parallel to each face contains each color exactly once and that the coloring is symmetric so that $L_{ij\ell}=L_{j\ell…

Combinatorics · Mathematics 2022-05-05 Amin Bahmanian

We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…

Combinatorics · Mathematics 2024-12-10 Chao Yang , Zhujun Zhang

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…

Geometric Topology · Mathematics 2018-06-13 Philip Engel , Peter Smillie

We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness…

Metric Geometry · Mathematics 2025-11-11 Bernhard Klaassen

For nonempty subsets $X$ and $Y$ of a group $G$, we say that $(X,Y)$ is a tiling of $G$ if every element of $G$ can be uniquely expressed as $xy$ for some $x\in X$ and $y\in Y$. In 1966, Rothaus and Thompson studied whether the symmetric…

Combinatorics · Mathematics 2026-05-05 Teng Fang , Binzhou Xia

The Honeycomb Conjecture states that among tilings with unit area cells in the Euclidean plane, the average perimeter of a cell is minimal for a regular hexagonal tiling. This conjecture was proved by L. Fejes T\'oth for convex tilings, and…

Metric Geometry · Mathematics 2025-12-15 Zsolt Lángi , Shanshan Wang

We consider sequential random packing of cubes $z+[0,1]^n$ with $z\in \frac{1}{N}\ZZ^n$ into the cube $[0,2]^n$ and the torus $\QuotS{\RR^n}{2\ZZ^n}$ as $N\to\infty$. In the cube case $[0,2]^n$ as $N\to\infty$ the random cube packings thus…

Combinatorics · Mathematics 2008-09-24 Mathieu Dutour Sikirić , Yoshiaki Itoh

We consider the space $[0,n]^3$, imagined as a three dimensional, axis-aligned grid world partitioned into $n^3$ $1\times 1 \times 1$ unit cubes. Each cube is either considered to be empty, in which case a line of sight can pass through it,…

Combinatorics · Mathematics 2019-09-17 Ezra Erives , Srinivasan Sathiamurthy , Zarathustra Brady