Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008907181/catalog> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- catalog abstract "This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections.".
- catalog contributor b12506254.
- catalog created "c2002.".
- catalog date "2002".
- catalog date "c2002.".
- catalog dateCopyrighted "c2002.".
- catalog description "1. Convexity -- 2. Lattices and Minkowski's theorem -- 3. Convex independent subsets -- 4. Incidence problems -- 5. Convex polytopes -- 6. Number of faces in arrangements -- 7. Lower envelopes -- 8. Intersection patterns of convex sets -- 9. Geometric selection theorems -- 10. Transversals and Epsilon nets -- 11. Attempts to count k-sets -- 12. Two applications of high-dimensional polytopes -- 13. Volumes in high dimension -- 14. Measure concentration and almost spherical sections -- 15. Embedding finite metric spaces into normed spaces.".
- catalog description "Includes bibliographical references (p. [417]-457) and index.".
- catalog description "This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections.".
- catalog extent "xvi, 481 p. :".
- catalog identifier "0387953736 (alk. paper)".
- catalog isPartOf "Graduate texts in mathematics ; 212".
- catalog issued "2002".
- catalog issued "c2002.".
- catalog language "eng".
- catalog publisher "New York : Springer,".
- catalog subject "516 21".
- catalog subject "Combinatorial geometry.".
- catalog subject "Convex geometry.".
- catalog subject "Discrete geometry.".
- catalog subject "QA639.5 .M37 2002".
- catalog tableOfContents "1. Convexity -- 2. Lattices and Minkowski's theorem -- 3. Convex independent subsets -- 4. Incidence problems -- 5. Convex polytopes -- 6. Number of faces in arrangements -- 7. Lower envelopes -- 8. Intersection patterns of convex sets -- 9. Geometric selection theorems -- 10. Transversals and Epsilon nets -- 11. Attempts to count k-sets -- 12. Two applications of high-dimensional polytopes -- 13. Volumes in high dimension -- 14. Measure concentration and almost spherical sections -- 15. Embedding finite metric spaces into normed spaces.".
- catalog title "Lectures on discrete geometry / Jiří Matoušek.".
- catalog type "text".