相关论文: A note on the honeycomb optimality among periodic …
We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the…
Proving the universal optimality of the hexagonal lattice is one of the big open challenges of nowadays mathematics. We show that the hexagonal lattice outperforms certain "natural" classes of periodic configurations. Also, we rule out the…
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…
The hexagonal tiling honeycomb is a beautiful structure in 3-dimensional hyperbolic space. It is called {6,3,3} because each hexagon has 6 edges, 3 hexagons meet at each vertex in a Euclidean plane tiled by regular hexagons, and 3 such…
We prove that, in the limit as $k \to+ \infty$, the hexagonal honeycomb solves the optimal partition problem in which the criterion is minimizing the largest among the Cheeger constants of $k$ mutually disjoint cells in a planar domain. As…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…
In the previous manuscript, new tilings (tessellations) were presented using convex pentagonal tiles belonging to Type 1 and Type 5. The convex pentagon tilings are related to heptiamond tilings. Later, the authors found Johannes Hindriks'…
We prove the existence of periodic tessellations of $\mathbb{R}^N$ minimizing a general nonlocal perimeter functional, defined as the interaction between a set and its complement through a nonnegative kernel, which we assume to be either…
A convex pentagonal tile is a convex pentagon that admits a monohedral tiling. We show that a convex pentagonal tile that admits a periodic tiling has a property in which the sum of three internal angles of the pentagon is equal to…
This paper provides a simple, compact and efficient 90-line pedagogical MATLAB code for topology optimization using hexagonal elements (honeycomb tessellation). Hexagonal elements provide nonsingular connectivity between two juxtaposed…
Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption…
We prove that the optimal cluster problem for the sum of the first Robin eigenvalue of the Laplacian, in the limit of a large number of convex cells, is asymptotically solved by (the Cheeger sets of) the honeycomb of regular hexagons. The…
We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…
We show that a single prototile can fill space uniformly but not admit a periodic tiling. A two-dimensional, hexagonal prototile with markings that enforce local matching rules is proven to be aperiodic by two independent methods. The…
Every normal periodic tiling is a strongly balanced tiling. The properties of periodic tilings by convex polygons are rearranged from the knowledge of strongly balanced tilings. From the results, we show the properties of representative…
It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…
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.
Symmetry sharing facilitates coherent interfaces which can transition from periodic to aperiodic structures. Motivated by the design and construction of such systems, we present hexagonal aperiodic tilings with a single edge-length which…