Research Problems in Discrete Geometry

Front Cover
Springer Science & Business Media, Jan 27, 2006 - Mathematics - 500 pages

Although discrete geometry has a rich history extending more than 150 years, it abounds in open problems that even a high-school student can understand and appreciate. Some of these problems are notoriously difficult and are intimately related to deep questions in other fields of mathematics. But many problems, even old ones, can be solved by a clever undergraduate or a high-school student equipped with an ingenious idea and the kinds of skills used in a mathematical olympiad.

Research Problems in Discrete Geometry is the result of a 25-year-old project initiated by the late Leo Moser. It is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.

Important features include:

* More than 500 open problems, some old, others new and never before published;

* Each chapter divided into self-contained sections, each section ending with an extensive bibliography;

* A great selection of research problems for graduate students looking for a dissertation topic;

* A comprehensive survey of discrete geometry, highlighting the frontiers and future of research;

* More than 120 figures;

* A preface to an earlier version written by the late Paul Erdos.

Peter Brass is Associate Professor of Computer Science at the City College of New York. William O. J. Moser is Professor Emeritus at McGill University. Janos Pach is Distinguished Professor at The City College of New York, Research Professor at the Courant Institute, NYU, and Senior Research Fellow at the Rényi Institute, Budapest.

 

Contents

Density Problems for Packings and Coverings
5
Structural Packing and Covering Problems
75
Packing and Covering with Homothetic Copies
121
75
182
Distance Problems
183
81
189
88
232
93
242
Problems on Repeated Subconfigurations
259
Incidence and Arrangement Problems
289
Problems on Points in General Position
325
106
440
121
470
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 5 - I point out the following question, related to the preceding one, and important to number theory and perhaps sometimes useful to physics and chemistry: How can one arrange most densely in space an infinite number of equal solids of given form, eg, spheres with given radii or regular tetrahedra with given edges (or in prescribed position), that is, how can one so fit them together that the ratio of the filled to the unfilled space may be as great as possible?
Page v - ... Well, you know we all want to change the world. You tell me that it's evolution, Well, you know we all want to change the world. But when you talk about destruction, Don't you know that you can count me out. Don't you know it's going to be alright, Alright, alright.
Page 8 - G. Fejes Toth. New Results in the Theory of Packing and Covering. In Convexity and its applications, pages 318-359.

About the author (2006)

Pach is a distinguished researcher at NYU, his book "Combinatorial Geometry," 1995, Wiley, is considered "the bible" in the area of discrete geometry. He has also published several books with Springer-Verlag.

William O.J. Moser is a Springer author as well. He has been awarded the CMS 2003 Distinguished Service Award for his sustained and significant contributions to the Canadian mathematical community.

Bibliographic information