中文
相关论文

相关论文: The Dodecahedron as a Voronoi Cell and its (minor)…

200 篇论文

The dodecahedral conjecture states that the volume of the Voronoi polyhedron of a sphere in a packing of equal spheres is at least the volume of a regular dodecahedron with inradius 1. The authors prove the conjecture following the…

度量几何 · 数学 2008-08-09 Thomas C. Hales , Sean McLaughlin

This article sketches the proofs of two theorems about sphere packings in Euclidean 3-space. The first is K. Bezdek's strong dodecahedral conjecture: the surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at…

度量几何 · 数学 2012-11-20 Thomas C. Hales

An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…

度量几何 · 数学 2007-05-23 Thomas C. Hales

The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes…

历史与综述 · 数学 2019-05-16 Max Leppmeier

A new locally averaged density for sphere packing in R^3 is defined by a proper combination of the local cell (Voronoi cell) and Delaunay decompositions (\S 1.2.2), using only a single layer of surrounding spheres. Local packings attaining…

度量几何 · 数学 2017-04-28 Wu-Yi Hsiang

We consider the incidence structure formed by the twelve pentagons given by the vertex neighborhoods of the icosahedron. Interpreting this structure purely in terms of coplanarity conditions, we show that -- up to projective equivalence --…

组合数学 · 数学 2026-03-23 Jürgen Richter-Gebert

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

综合数学 · 数学 2009-07-27 Fu-Gao Song , Francis Austin

The smallest maximum kissing-number Voronoi polyhedron of 3d spheres is the icosahedron and the tetrahedron is the smallest volume that can show up in Delaunay tessalation. No periodic lattice is consistent with either and hence these dense…

软凝聚态物质 · 物理学 2009-11-13 J. A. van Meel , D. Frenkel , P. Charbonneau

The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. The original proof, announced in 1998 and published in 2006, is long and…

3D-facets of the Delone cells representing the deep and shallow holes of the root lattice D6 which tile the six-dimensional Euclidean space in an alternating order are projected into three-dimensional space. They are classified into six…

度量几何 · 数学 2021-03-03 Nazife Ozdes Koca , Ramazan Koc , Mehmet Koca , Abeer Al-Siyabi

The hyperbolic dodecahedral space of Weber and Seifert has a natural non-positively curved cubulation obtained by subdividing the dodecahedron into cubes. We show that the hyperbolic dodecahedral space has a 6-sheeted irregular cover with…

几何拓扑 · 数学 2018-10-24 Jonathan Spreer , Stephan Tillmann

We show that the Volume Conjecture for polyhedra implies a weak version of the Stoker Conjecture; in turn we prove that this weak version of the Stoker conjecture implies the Stoker conjecture. The main tool used is an extension of a result…

几何拓扑 · 数学 2022-09-28 Giulio Belletti

The CMB quadrupole and octupole, as well as being weaker than expected, align suspiciously well with each other. Non-trivial spatial topology can explain the weakness. Might it also explain the alignment? The answer, at least in the case of…

天体物理学 · 物理学 2008-11-26 Jeff Weeks , Jesper Gundermann

The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. In 1998, Sam Ferguson and I announced a computer-assisted proof of this…

度量几何 · 数学 2024-02-14 Thomas Hales

Voronoi cells of a discrete set in Euclidean space are known as generalized polyhedra. We identify polyhedral cells of a discrete set through a direction cone. For an arbitrary set we distinguish polyhedral from non-polyhedral cells using…

数学物理 · 物理学 2016-05-17 Ina Voigt , Stephan Weis

The typical cell of a Voronoi tessellation generated by $n+1$ uniformly distributed random points on the $d$-dimensional unit sphere $\mathbb S^d$ is studied. Its $f$-vector is identified in distribution with the $f$-vector of a beta'…

概率论 · 数学 2021-02-10 Zakhar Kabluchko , Christoph Thaele

We raise and investigate the following problem that one can regard as a very close relative of the densest sphere packing problem. If the Euclidean 3-space is partitioned into convex cells each containing a unit ball, how should the shapes…

度量几何 · 数学 2013-02-13 Karoly Bezdek

The Voronoi conjecture on parallelohedra claims that for every convex polytope $P$ that tiles Euclidean $d$-dimensional space with translations there exists a $d$-dimensional lattice such that $P$ and the Voronoi polytope of this lattice…

组合数学 · 数学 2021-12-20 Alexey Garber

In this paper we deal with the problem to find the maximal volume polyhedra with a prescribed property and inscribed in the unit sphere. We generalize those inequality (called by \emph{icosahedron inequality}) of L. Fejes-T\'oth of which an…

度量几何 · 数学 2014-11-24 Ákos G. Horváth

A new way of probing the large-scale structure of the universe is proposed. Space is partitioned into cells the shape of rhombic dodecahedron. The cells are labelled ``filled'' or ``empty'' according as they contain galaxies or not. The…

天体物理学 · 物理学 2014-10-13 T. Kiang
‹ 上一页 1 2 3 10 下一页 ›