TAILIEUCHUNG - Báo cáo toán học: "Improving Dense Packings of Equal Disks in a Square"

Tuyển tập các báo cáo nghiên cứu khoa học trên tạp chí toán học quốc tế đề tài: Improving Dense Packings of Equal Disks in a Square. | Improving Dense Packings of Equal Disks in a Square David W. Boll Hewlett-Packard 700 71st Ave Greeley CO 80634 david_boll@ Jerry Donovan Hewlett-Packard 700 71st Ave Greeley CO 80634 jerry_donovan@ Ronald L. Graham University of California at San Diego La Jolla CA 92093 graham@ Boris D. Lubachevsky Lucent Technologies Bell Laboratories Murray Hill NJ 07974 bdl@ Submitted June 8 2000 Accepted August 1 2000 Abstract We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases these packings are in fact optimal. When applied to the previously studied cases of packing n equal disks in a square the procedure confirms all the previous record packings NO1 NO2 GL except for n 32 37 48 and 50 disks where better packings than those previously recorded are found. For n 32 and 48 the new packings are minor variations of the previous record packings. However for n 37 and 50 the new patterns differ substantially. For example they are mirror-symmetric while the previous record packings are not. AMS subject classification primary 05B40 secondary 90C59 1. Introduction We consider the task of arranging without overlaps a given number n of congruent circular disks entirely inside a given square on the plane so that the disks have the largest possible diameter. This disk packing problem has an equivalent formulation where one seeks to spread n points the centers of the disks inside a unit square so that the minimum point-to-point distance usually denoted by m mn is as large as possible. In this paper we describe a new experimental approach and apply it to generate new packings which are better than any previously known GL NO1 NO2 NO3 for several values of n. However we do not prove the optimality of these new packings although we suspect that some of them may indeed be optimal. Clearly a future goal would be to prove their optimality which becomes

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.