- 396 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Introduction to Combinatorial Methods in Geometry
About this book
This book offers an introduction to some combinatorial (also, set-theoretical) approaches and methods in geometry of the Euclidean space Rm. The topics discussed in the manuscript are due to the field of combinatorial and convex geometry.
The author's primary intention is to discuss those themes of Euclidean geometry which might be of interest to a sufficiently wide audience of potential readers. Accordingly, the material is explained in a simple and elementary form completely accessible to the college and university students. At the same time, the author reveals profound interactions between various facts and statements from different areas of mathematics: the theory of convex sets, finite and infinite combinatorics, graph theory, measure theory, classical number theory, etc.
All chapters (and also the five Appendices) end with a number of exercises. These provide the reader with some additional information about topics considered in the main text of this book. Naturally, the exercises vary in their difficulty. Among them there are almost trivial, standard, nontrivial, rather difficult, and difficult. As a rule, more difficult exercises are marked by asterisks and are provided with necessary hints.
The material presented is based on the lecture course given by the author. The choice of material serves to demonstrate the unity of mathematics and variety of unexpected interrelations between distinct mathematical branches.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover Page
- Half-Title Page
- Title Page
- Copyright Page
- Contents
- Preface
- Chapter 1 â—¾ The index of an isometric embedding
- Chapter 2 â—¾ Maximal ot-subsets of the Euclidean plane
- Chapter 3 â—¾ The cardinalities of at-sets in a real Hilbert space
- Chapter 4 â—¾ Isosceles triangles and it-sets in Euclidean space
- Chapter 5 â—¾ Some geometric consequences of Ramsey's combinatorial theorem
- Chapter 6 â—¾ Convexly independent subsets of infinite sets of points
- Chapter 7 â—¾ Homogeneous coverings of the Euclidean plane
- Chapter 8 â—¾ Three-colorings of the Euclidean plane and associated triangles of a prescribed type
- Chapter 9 â—¾ Chromatic numbers of graphs associated with point sets in Euclidean space
- Chapter 10 ◾ The Szemerédi–Trotter theorem and its applications
- Chapter 11 â—¾ Minkowski's theorem, number theory, and nonmeasurable sets
- Chapter 12 â—¾ Tarski's plank problem
- Chapter 13 â—¾ Borsuk's conjecture
- Chapter 14 ◾ Piecewise affine approximations of continuous functions of several variables and Caratheodory–Gale polyhedra
- Chapter 15 â—¾ Dissecting a square into triangles of equal areas
- Chapter 16 â—¾ Geometric realizations of finite and infinite families of sets
- Chapter 17 â—¾ A geometric form of the Axiom of Choice
- Appendix 1 â—¾ Convex sets in real vector spaces
- Appendix 2 â—¾ Real-valued convex functions
- Appendix 3 â—¾ The Principle of Inclusion and Exclusion
- Appendix 4 ◾ The Erdös–Mordell inequality
- Appendix 5 â—¾ Some facts from graph theory
- Bibliography
- Index