In this book, I. Ya. Bakel'man introduces inversion transformations in the Euclidean plane and discusses the interrelationships among more general mathematical concepts. The author begins by defining and giving examples of the concept of a transformation in the Euclidean plane, and then explains the "point of infinity" and the "stereographic projection" of the sphere onto the plane. With this preparation, the student is capable of applying the theory of inversions to classical construction problems in the plane. The author also discusses the theory of pencils of circles, and he uses the...
In this book, I. Ya. Bakel'man introduces inversion transformations in the Euclidean plane and discusses the interrelationships among more general mat...
In contrast to the vast literature on Euclidean geometry as a whole, little has been published on the relatively recent developments in the field of combinatorial geometry. Boltyanskii and Gohberg's book investigates this area, which has undergone particularly rapid growth in the last thirty years. By restricting themselves to two dimensions, the authors make the book uniquely accessible to interested high school students while maintaining a high level of rigor. They discuss a variety of problems on figures of constant width, convex figures, coverings, and illumination. The book offers a...
In contrast to the vast literature on Euclidean geometry as a whole, little has been published on the relatively recent developments in the field of c...
This volume describes the relationship between systems of linear inequalities and the geometry of convex polygons, examines solution sets for systems of linear inequalities in two and three unknowns (extension of the processes introduced to systems in any number of unknowns is quite simple), and examines questions of the consistency or inconsistency of such systems. Finally, it discusses the field of linear programming, one of the principal applications of the theory of systems of linear inequalities. A proof of the duality theorem of linear programming is presented in the last section.
This volume describes the relationship between systems of linear inequalities and the geometry of convex polygons, examines solution sets for systems ...