Lower bound on the translative covering density of octahedra

被引：0

作者：

Li, Yiming ^{[1
]}

Lian, Yanlu ^{[2
]}

Fu, Miao ^{[3
]}

Zhang, Yuqin ^{[4
]}

机构：

[1] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China

[2] Hangzhou Normal Univ, Sch Math, Hangzhou 311121, Peoples R China

[3] CSSC Elect Technol Co Ltd, Syst Engn Res Inst, Beijing 100036, Peoples R China

[4] Tianjin Univ, Sch Math, Tianjin 300072, Peoples R China

来源：

ADVANCES IN GEOMETRY | 2024年 / 24卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Translative covering density; octahedron; tile; CAYLEY-GRAPHS; PACKING;

D O I：

10.1515/advgeom-2024-0006

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Based on Zong's work [26] on translative packing densities of 3-dimensional convex bodies, we present a local method to estimate the density theta t(C-3) of the densest translative covering of an octahedron. As a consequence we prove that theta t(C-3) >= 1 + 6.6 x 10(-8), which is the first non-trivial lower bound for this density.

引用

页码：151 / 158

页数：8

共 50 条

[41] Proof of a universal lower bound on the shear viscosity to entropy density ratio
Brustein, Ram
Medved, A. J. M.
PHYSICS LETTERS B, 2010, 691 (02) : 87 - 90
[42] A NONCONSTRUCTIVE UPPER BOUND ON COVERING RADIUS
COHEN, GD
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 352 - 353
[43] A Bound on the Averaged Spectral Shift Function and a Lower Bound on the Density of States for Random Schrodinger Operators on Rd
Dietlein, Adrian
Gebert, Martin
Hislop, Peter D.
Klein, Abel
Mueller, Peter
INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2018, 2018 (21) : 6673 - 6697
[44] AN IMPROVED UPPER BOUND ON COVERING RADIUS
MATTSON, HF
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 228 : 90 - 106
[45] A BOUND FOR THE COVERING RADIUS OF THE LEECH LATTICE
NORTON, S
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1982, 380 (1779): : 259 - 260
[46] ANOTHER UPPER BOUND ON COVERING RADIUS
MATTSON, HF
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 356 - 359
[47] On lower bounds for covering codes
Bhandari, M.C.
Chanduka, K.K.P.
Lal, A.K.
Designs, Codes, and Cryptography, 1998, 15 (03): : 237 - 243
[48] Improved efficiency for covering codes matching the sphere-covering bound
Potukuchi, Aditya
Zhang, Yihan
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 102 - 107
[49] On Lower Bounds for Covering Codes
Bhandari M.C.
Chanduka K.K.P.
Lal A.K.
Designs, Codes and Cryptography, 1998, 15 (3) : 237 - 243
[50] A LOWER BOUND
PROPP, J
AMERICAN MATHEMATICAL MONTHLY, 1986, 93 (08): : 655 - 655

← 1 2 3 4 5 →