A Lower Bound for the Translative Kissing Numbers of Simplices
نویسنده
چکیده
First we recall some standard definitions. By a d-dimensional convex body we mean a compact convex subset of Rd with non-empty interior. Two subsets of Rd with non-empty interiors are non-overlapping if they have no common interior point, and we say that they touch each other if they are non-overlapping and their intersection is non-empty. Denote by H(K) the translative kissing number of a d-dimensional convex body K, which is defined as the maximum number of mutually non-overlapping translates of K that can be arranged so that all touch K. H(K) is often called the Hadwiger number of K as well. By a result of Swinnerton-Dyer [18] it follows that H(K)≥d2+d holds for every d-dimensional convex body K (d≥1). Recently, Talata [19] improved on this lower bound for sufficiently large values of d, showing that there exists an absolute constant c > 0 such that H(K) ≥ 2cd for every d-dimensional
منابع مشابه
Mysteries in Packing Regular Tetrahedra
T he regular tetrahedron is the simplest Platonic solid. Nevertheless, in studying its packing properties, several renowned scholars have made mistakes, and many questions about it remain unsolved. Currently no one knows the density of its densest packings, the density of its densest translative packings, or the exact value of its congruent kissing number. In this paper we recount historical de...
متن کاملOn Minimum Kissing Numbers of Finite Translative Packings of a Convex Body
For a convex body K, let us denote by t(K) the largest number for which there exists a packing with finitely many translates of K in which every translate has at least t(K) neighbours. In this paper we determine t(K) for convex discs and 3-dimensional convex cylinders. We also examine how small the cardinalities of the extremal configurations can be in these cases. MSC 2000: 52C17, 52A10
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملOn the Unique-Lifting Property
We study the uniqueness of minimal liftings of cut generating functions obtained from maximal lattice-free polytopes. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polytopes. This generalizes a previous result by Basu, Cornuéjols and Köppe [3] for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question abou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 20 شماره
صفحات -
تاریخ انتشار 2000