TAILIEUCHUNG - Báo cáo toán học: " Efficient packing of unit squares in a square"

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: Efficient packing of unit squares in a square. | Efficient packing of unit squares in a square Michael J Kearney and Peter Shiu Department of Electronic and Electrical Engineering Loughborough University Loughborough Leicestershire LE11 3TU United Kingdom Department of Mathematical Sciences Loughborough University Loughborough Leicestershire LE11 3TU United Kingdom Submitted June 1 2001 Accepted February 11 2002. MR Subject Classifications 05B40 52C15 Abstract Let s N denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s 6 s 7 3. Let nr be the smallest integer n such that s n2 1 n 1 r. We use an explicit construction to show that nr 27r3 2 O r2 and also that n2 43. 1. Introduction. Erdos and Graham 1 initiated the study of packing unit squares in a square by demonstrating that non-trivial packings can result in a wasted area that is surprisingly small. For a square with side length n s where n is an integer and 0 s 1 they showed by explicit construction that it is possible to have a packing so efficient that the wasted area is O n7 11 for large n. By way of contrast the trivial packing of unit squares gives a wasted area of n s 2 n2 2Sn. There is now the interesting optimisation problem of packing a given number N of unit squares especially when N is small and we denote by s N the side length of the smallest square into which one can pack them. Then s N is an increasing function with s n2 n so that a N s N p N . The determination of s N when N n2 is a rather difficult problem with only a few values for s N having been established for such N. For example it was conjectured that s n2 n n but this is known to be false for n 17 by an explicit construction see the recent survey 2 by Friedman who paid special attention to s N with N 100. There is a simple proof of the conjecture when n 2 that is s 2 2 but only claims for the proof of s 6 3 are reported in 2 . Friedman 2 has proved that s 7 3 and we .

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.