首页/论文/1908.05650

arXiv 1908.056502019-08-15math.MG

The maximum number of points in the cross-polytope that form a packing set of a scaled cross-polytope

Ji Hoon Chun

英文摘要：

The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\in\left(1-\frac{1}{n},1\right]$ in dimensions $\geq2$ and for $r\in\left(\frac{1}{2},1\right]$ in dimension $3$. For the $n$-dimensional cross-polytope, $2n$ points can be placed when $r\in\left(1-\frac{1}{n},1\right]$. For the three-dimensional cross-polytope, $10$ and $12$ points can be placed if and only if $r\in\left(\frac{3}{5},\frac{2}{3}\right]$ and $r\in\left(\frac{4}{7},\frac{3}{5}\right]$ respectively, and no more than $14$ points can be placed when $r\in\left(\frac{1}{2},\frac{4}{7}\right]$. Also, constructive arrangements of points that attain the upper bounds of $2n$, $10$, and $12$ are provided, as well as $13$ points for dimension $3$ when $r\in\left(\frac{1}{2},\frac{6}{11}\right]$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Densest Lattice Packings of 3-Polytopes

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.

1999-09-29math.MG

Stability of the simplex bound for packings by equal spherical caps determined by simplicial regular polytopes

It is well known that the vertices of any Euclidean simplicial regular polytope determine an optimal packing of equal spherical balls. We prove a stability version of optimal order of this result.

2017-11-01math.MG

n维交叉多面体的填充密度

The packing density of the $n$-dimensional cross-polytope

Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Bolyai Institute, University of Szeged（塞格德大学博莱研究所）；University of Calgary（卡尔加里大学）

本文研究n维正交叉多面体的填充密度，针对n≥7的情况，采用改进的Blichfeldt方法，证明了其填充密度的上界。

2015-03-16math.MG

Apollonian Ball Packings and Stacked Polytopes

We investigate in this paper the relation between Apollonian $d$-ball packings and stacked $(d+1)$-polytopes for dimension $d\ge 3$. For $d=3$, the relation is fully described: we prove that the $1$-skeleton of a stacked $4$-polytope is the tangency graph of an Apollonian $3$-ball packing if and only if no six $4$-cliques share a $3$-clique. For higher dimension, we have some partial results.

2013-12-23math.COmath.MG

正多胞体、球填充与阿波罗尼奥斯截面

Regular polytopes, sphere packings and Apollonian sections

本文研究了由任意维度正多胞体诱导的多胞体球填充的几何与算术性质，证明了所有整多胞体皆为晶体学的且共有11个晶体学正多胞体，引入阿波罗尼奥斯截面概念以确定相关截面填充，并计算了所有正多胞体的Möbius谱。

2024-10-10math.COmath.GRmath.MG

Lattice Packings of Cross-polytopes from Reed-Solomon Codes and Sidon Sets

Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to \infty $. The first family of lattices is explicit and is obtained by applying Construction A to a class of Reed-Solomon codes. The second family has subexponential construction complexity and is based on the notion of Sidon sets in finite Abelian groups. The construction based on Sidon sets also gives the highest known asymptotic density of packing discrete…

2022-05-26cs.DMcs.ITmath.CO

更多相关论文收起更多论文

A point in a $nd$-Polytope is the barycenter of $n$ points in its $d$-faces

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold Minkowski sum of a $nd$-polytope's $d$-skeleton is that polytope scaled by $n$. This verifies a conjecture by Takeshi Tokuyama.

2014-06-05math.MG

An extremum property characterizing the n-dimensional regular cross-polytope

In the spirit of the Genetics of the Regular Figures, by L. Fejes Tóth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as large as possible, then the points are the vertices of an inscribed regular cross-polytope. This generalizes a result of R. A. Rankin for $2n$ points on the surface of the ball. We also generalize, in the same manner, a theorem of Davenport and Hajós on a set of $n+2$ points. As a corollary, we obtain a solution to the problem of packing $k$ unit $n$-dimensional…

2001-12-28math.MG

Small union with large set of centers

Let $T\subset{\mathbb R}^n$ be a fixed set. By a scaled copy of $T$ around $x\in{\mathbb R}^n$ we mean a set of the form $x+rT$ for some $r>0$. In this survey paper we study results about the following type of problems: How small can a set be if it contains a scaled copy of $T$ around every point of a set of given size? We will consider the cases when $T$ is circle or sphere centered at the origin, Cantor set in ${\mathbb R}$, the boundary of a square centered at the origin, or more generally the $k$-skeleton ($0\le k<n$) of an $n$-dimensional cube centered at the origin or the $k$-skeleton of…

2017-01-10math.CAmath.MG

Small unions of affine subspaces and skeletons via Baire category

Our aim is to find the minimal Hausdorff dimension of the union of scaled and/or rotated copies of the $k$-skeleton of a fixed polytope centered at the points of a given set. For many of these problems, we show that a typical arrangement in the sense of Baire category gives minimal Hausdorff dimension. In particular, this proves a conjecture of R. Thornton. Our results also show that Nikodym sets are typical among all sets which contain, for every point x of R^n, a punctured hyperplane H\{x} through x. With similar methods we also construct a Borel subset of R^n of Lebesgue measure zero contai…

2018-02-15math.CAmath.MG