اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUniqueness of maximum three-distance sets in the three-dimensional Euclidean space
320
0
0.0
(
0
)
تأليف
Masashi Shinohara
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the only 12-point three-distance set in $mathbb{R}^3$ up to isomorphism. In this paper, we prove the uniqueness of 12-point three-distance sets in $mathbb{R}^3$.
قيم البحث
اقرأ أيضاً
This paper proves the following statement: If a convex body can form a three or fourfold translative tiling in three-dimensional space, it must be a parallelohedron. In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedro
n, an elongated dodecahedron, or a truncated octahedron.
This paper proves the following statement: {it If a convex body can form a twofold translative tiling in $mathbb{E}^3$, it must be a parallelohedron.} In other words, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, or a truncated octahedron.
It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one extremal one among them, i.e., some one which can be continuously taken away to the infinity (outside a large
ball containing all other bodies). In 3-space a phenomenon of self-interlocking structures takes place. A self-interlocking structure is such a set of three-dimensional convex bodies with non-overlapping interiors that any infinitesimal move of any of them is possible only as a part of the move of all bodies as a solid body. Previously known self-interlocking structures are based on configurations of cut cubes, tetrahedra, and octahedra. In the present paper we discover a principally new phenomenon of 2-dimensional self-interlocking structures: a family of 2-dimensional polygons in 3-space where no infinitesimal move of any piece is possible. (Infinitely thin) tiles are used to create {em decahedra}, which, in turn, used to create columns, which turn out to be stable when we fix some two extreme tiles. Seemingly, our work is the first appearance of the structure which is stable if we fix just two tiles (and not all but one). Two-dimensional self-interlocking structures naturally lead to three-dimensional structures possessing the same properties.
A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all 5-distance sets in
$mathbb{R}^3$ is 20, and every $5$-distance set in $mathbb{R}^3$ with $20$ points is similar to the vertex set of a regular dodecahedron.
The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products ${alpha, -alpha}$, $alphain[0,1)$, are called equ
iangular. The problem of determining the maximum size of $s$-distance sets in various spaces has a long history in mathematics. We suggest a new method of bounding the size of an $s$-distance set in compact two-point homogeneous spaces via zonal spherical functions. This method allows us to prove that the maximum size of a spherical two-distance set in $mathbb{R}^n$, $ngeq 7$, is $frac{n(n+1)}2$ with possible exceptions for some $n=(2k+1)^2-3$, $k in mathbb{N}$. We also prove the universal upper bound $sim frac 2 3 n a^2$ for equiangular sets with $alpha=frac 1 a$ and, employing this bound, prove a new upper bound on the size of equiangular sets in all dimensions. Finally, we classify all equiangular sets reaching this new bound.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
