Mathematical gems. II
This book is a most fitting, and welcome, companion to the author's earlier volume with (almost) the same title (Washington 1973) see Zbl 0281.00004. The fourteen chapters are independent of one another and deal with a charming variety of topics from geometry, number theory, combinatorics and graph theory. While the mathematics involved rarely, if ever, goes beyond the high school level it is safe to say that almost every mathematician will find something new and interesting in almost every essay. Among the questions discussed are: How many guards are needed in a art gallery if every picture is to be constantly protected?; If \(n\) points are positioned in the plane how many different distances can occur?; How many times can the minimum (maximum) distance occur?; How many steps will an application of the Euclidean algorithm require?; Is there a simple formula which will generate only primes and each odd prime exactly once?; How can those graphs which permit disjoint \(n\) couplings of their vertices be characterized? Each of these questions, and many others, is answered carefully, completely and lucidly by the author. The title suggests the possibility that more collections of gems are being considered by Prof. Honsberger. We would like to encourage him in his efforts and look forward with anticipation to volume three.
- Some results on one-dimensional tilings
- Algebraic theory of brick packing. I
- On covering orthogonal polygons with star-shaped polygons
- Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach
- On the number of guard edges of a polygon
- The Fermat-Torricelli point and isosceles tetrahedra
- An efficient algorithm for guard placement in polygons with holes
- On tiling the integers with 4-sets of the same gap sequence
- Tilings in \(\mathbb{Z}\) with triples
- Twin jumping checkers in \(Z^ d\)
- \(\alpha\)-kernel problem with fuzzy visibility
- The median triangle theorem as an entrance to certain issues in higher-dimensional geometry
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\)
- Outer normal transforms of convex polytopes
- Connecting guards with minimum Steiner points inside simple polygons
- Multiple point visibility and related problems
- Equifacial tetrahedra
- On the PSPACE-completeness of Peg Duotaire and other peg-jumping games
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- How to guard an art gallery and other discrete mathematical adventures
- Statistical mechanics of cellular automata
- scientific article; zbMATH DE number 3906412 (Why is no real title available?)
- The art gallery theorem, revisited
- An Inequality for the Volume of a Tetrahedron
- An exact algorithm for minimizing vertex guards on art galleries
- On volumes and filling collections of multicurves
- Tetrahedra with congruent facet pairs
- Tilings of \(\mathbb{Z}\) with multisets of distances
- Exploring discrete geometry
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards
- The pons asinorum and related theorems for tetrahedra
- Application of Heron's formula
- Efficient mathematical programming formulation and algorithmic framework for optimal camera placement
- An alternative proof of the rectilinear art gallery theorem
This page was built for publication: Mathematical gems. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099997)