相关论文: Keller's cube-tiling conjecture is false in high d…
Let $\overline{bt}(n)$ denote the number of overcubic partition triples of $n$. Nayaka, Dharmendra and Kumar proved some congruences modulo 8, 16 and 32 for $\overline{bt}(n)$. Recently, Saikia and Sarma established some congruences modulo…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…
Poncelet's theorem states that if there exists an n-sided polygon which is inscribed in a given conic C and circumscribed about another conic D, then there are infinitely many such n-gons. Proofs of this theorem that we are aware of,…
This is the second in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
A typical decomposition question asks whether the edges of some graph $G$ can be partitioned into disjoint copies of another graph $H$. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the…
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
We establish Manin's conjecture for a cubic surface split over Q and whose singularity type is 2A_2+A_1. For this, we make use of a deep result about the equidistribution of the values of a certain restricted divisor function in three…
Put n nonoverlapping squares inside the unit square. Let f(n) and g(n) denote the maximum values of the sum of the edge lengths of the n small squares, where in the case of f(n) the maximum is taken over all arbitrary packings of the unit…
This is the first in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.
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 &…
We show that for every convex polyhedral sphere $P$ in $S^3$, there exist two canonical, non-edge-to-edge tilings of $S^{2}$ whose tiles are given by all the faces of $P$ and the dual convex polyhedral sphere $P^*$ to $P$. Under the…
The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than $\pi/\sqrt{18}$. A computer assisted verification confirmed this conjecture in 1998. This article gives a historical…
We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…