相关论文: The Least-Area Tetrahedral Tile of Space
We provide a list of conjectured surface-area-minimizing n-hedral tiles of space for n from 4 to 14, previously known only for n equal to 5 or 6. We find the optimal "orientation-preserving" tetrahedral tile (n=4), and we give a nice proof…
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,…
The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, for convex polyhedra whose translates tile the $3$-dimensional Euclidean space. Our main result states that among…
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which all dihedral angles are less than $77.08^\circ$, and another…
In this paper, we show that any biharmonic simple rotational surface in the four-dimensional Euclidean space is minimal. The proof is based on reducing the biharmonic equation to a system of ordinary differential equations for the profile…
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 paper, Max/Min Puzzles in Geometry III, we searched for the smallest area triangle which contained a regular unit polygon (Square, Pentagon, Hexagon). In this paper we will work in 3-dimensions, and search for the smallest…
We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.
We establish in this paper a sharp lower bound for the area of a unit vector field $V$ defined on some spherical annuli in the Euclidean sphere $\mathbb{S}^2$.
Gray-Vanhecke conjectured that the volumes of small geodesic balls could determine if the manifold is a space form, and provided a proof for the compact 4-dimensional manifold, and some cases. In this paper, similar results for the…
We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…
In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of…
This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number w such that any ball Q can be covered by w tiles (or curve sections) with total volume O(vol(Q)). Recursive tilings and…
We provide a lower value for the volume of a unit vector field tangent to an antipodally Euclidean sphere $\mathbb{S}^2$ depending on the length of an ellipse determined by the indexes of its singularities. In addition, for minimizing…
In this note we show existence and regularity of periodic tilings of the Euclidean space into equal cells containing a ball of fixed radius, which minimize either the classical or the fractional perimeter. We also discuss some qualitative…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with 120-degree angles is isoperimetric for its…
An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex…
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…
Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…