Results and Problems in Combinatorial Geometry PDF Download

Author: Vladimir G. Boltjansky
Publisher: CUP Archive
ISBN: 9780521269230
Category : Mathematics
Languages : en
Pages : 132

View

Book Description
In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve.

Author: János Pach
Publisher: John Wiley & Sons
ISBN: 1118031369
Category : Mathematics
Languages : en
Pages : 376

View

Book Description
A complete, self-contained introduction to a powerful and resurgingmathematical discipline . Combinatorial Geometry presents andexplains with complete proofs some of the most important resultsand methods of this relatively young mathematical discipline,started by Minkowski, Fejes Toth, Rogers, and Erd???s. Nearly halfthe results presented in this book were discovered over the pasttwenty years, and most have never before appeared in any monograph.Combinatorial Geometry will be of particular interest tomathematicians, computer scientists, physicists, and materialsscientists interested in computational geometry, robotics, sceneanalysis, and computer-aided design. It is also a superb textbook,complete with end-of-chapter problems and hints to their solutionsthat help students clarify their understanding and test theirmastery of the material. Topics covered include: * Geometric number theory * Packing and covering with congruent convex disks * Extremal graph and hypergraph theory * Distribution of distances among finitely many points * Epsilon-nets and Vapnik--Chervonenkis dimension * Geometric graph theory * Geometric discrepancy theory * And much more

Author: Herbert Edelsbrunner
Publisher: Springer Science & Business Media
ISBN: 3642615686
Category : Computers
Languages : en
Pages : 423

View

Book Description
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.

Author: Jiri Herman
Publisher: Springer Science & Business Media
ISBN: 1475739257
Category : Mathematics
Languages : en
Pages : 402

View

Book Description
This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. Brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty and by exercises that range from routine to rather challenging. The book features approximately 310 examples and 650 exercises.

Author: Peter Brass
Publisher: Springer Science & Business Media
ISBN: 0387238158
Category : Mathematics
Languages : en
Pages : 507

View

Book Description
This book is the result of a 25-year-old project and comprises 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.

Author: Peter Brass
Publisher: Springer Science & Business Media
ISBN: 0387299297
Category : Mathematics
Languages : en
Pages : 507

View

Book Description
This book is the result of a 25-year-old project and comprises 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.

Author: Stefan Felsner
Publisher: Springer Science & Business Media
ISBN: 3322803031
Category : Mathematics
Languages : en
Pages : 179

View

Book Description
Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and partly very recent results from the intersection of geometry, graph theory and combinatorics.

Author: Alexander Soifer
Publisher: Springer Science & Business Media
ISBN: 0387754695
Category : Mathematics
Languages : en
Pages : 292

View

Book Description
Geometric Etudes in Combinatorial Mathematics is not only educational, it is inspirational. This distinguished mathematician captivates the young readers, propelling them to search for solutions of life’s problems—problems that previously seemed hopeless. Review from the first edition: The etudes presented here are not simply those of Czerny, but are better compared to the etudes of Chopin, not only technically demanding and addressed to a variety of specific skills, but at the same time possessing an exceptional beauty that characterizes the best of art...Keep this book at hand as you plan your next problem solving seminar. —The American Mathematical Monthly

Author: Jiri Herman
Publisher: Springer Science & Business Media
ISBN: 9780387955520
Category : Mathematics
Languages : en
Pages : 416

View

Book Description
This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. Brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty and by exercises that range from routine to rather challenging. The book features approximately 310 examples and 650 exercises.

Author: Alexander Brudnyi
Publisher: Springer Science & Business Media
ISBN: 3034802129
Category : Mathematics
Languages : en
Pages : 416

View

Book Description
The book presents a comprehensive exposition of extension results for maps between different geometric objects and of extension-trace results for smooth functions on subsets with no a priori differential structure (Whitney problems). The account covers development of the area from the initial classical works of the first half of the 20th century to the flourishing period of the last decade. Seemingly very specific these problems have been from the very beginning a powerful source of ideas, concepts and methods that essentially influenced and in some cases even transformed considerable areas of analysis. Aside from the material linked by the aforementioned problems the book also is unified by geometric analysis approach used in the proofs of basic results. This requires a variety of geometric tools from convex and combinatorial geometry to geometry of metric space theory to Riemannian and coarse geometry and more. The necessary facts are presented mostly with detailed proofs to make the book accessible to a wide audience.