Density of Binary Disc Packings: Lower and Upper Bounds

نویسندگان

چکیده

We provide, for any r∈(0,1), lower and upper bounds on the maximal density of a packing in Euclidean plane discs radius 1 r. The are mostly folk, but improve best previously known ones r∈[0.11,0.74]. For many values r, this gives fairly good idea exact maximum density. In particular, we get new intervals r which does not allow more dense that hexagonal equal discs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

متن کامل

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

متن کامل

New Upper Bounds on Sphere Packings I

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

New upper bounds on sphere packings II

We continue the study of the linear programming bounds for sphere packing introduced by Cohn and Elkies. We use theta series to give another proof of the principal theorem, and present some related results and conjectures. This article is in the arXiv as: arXiv:math.MG/0110010 Dedicated to Daniel Lewin (14 May 1970 { 11 September 2001) AMS Classi cation numbers Primary: 52C17, 52C07 Secondary: ...

متن کامل

New Upper Bounds on Sphere Packings I

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2022

ISSN: ['1944-950X', '1058-6458']

DOI: https://doi.org/10.1080/10586458.2022.2061651