Adventures In Recreational Mathematics (In 2 Volumes)

Adventures In Recreational Mathematics (In 2 Volumes)
Author: David Singmaster
Publisher: World Scientific
Total Pages: 494
Release: 2021-09-21
Genre: Mathematics
ISBN: 9811251622

David Singmaster believes in the presentation and teaching of mathematics as recreation. When the Rubik's Cube took off in 1978, based on thinly disguised mathematics, he became seriously interested in mathematical puzzles which would provide mental stimulation for students and professional mathematicians. He has not only published the standard mathematical solution for the Rubik's cube still in use today, but he has also become the de facto scribe and noted chronicler of the recreational mathematics puzzles themselves.Dr Singmaster is also an ongoing lecturer of recreational mathematics around the globe, a noted mechanical puzzle collector, owner of thousands of books related to recreational mathematical puzzles and the 'go to' source for the history of individual mathematical puzzles.This set of two books provides readers with an adventure into previously unknown origins of ancient puzzles, which could be traced back to their Medieval, Chinese, Arabic and Indian sources. The puzzles are fully described, many with illustrations, adding interest to their history and relevance to contemporary mathematical concepts. These are musings of a respected historian of recreational mathematics.

Polynomial Methods and Incidence Theory

Polynomial Methods and Incidence Theory
Author: Adam Sheffer
Publisher: Cambridge University Press
Total Pages: 264
Release: 2022-03-24
Genre: Mathematics
ISBN: 1108963013

The past decade has seen numerous major mathematical breakthroughs for topics such as the finite field Kakeya conjecture, the cap set conjecture, Erdős's distinct distances problem, the joints problem, as well as others, thanks to the introduction of new polynomial methods. There has also been significant progress on a variety of problems from additive combinatorics, discrete geometry, and more. This book gives a detailed yet accessible introduction to these new polynomial methods and their applications, with a focus on incidence theory. Based on the author's own teaching experience, the text requires a minimal background, allowing graduate and advanced undergraduate students to get to grips with an active and exciting research front. The techniques are presented gradually and in detail, with many examples, warm-up proofs, and exercises included. An appendix provides a quick reminder of basic results and ideas.

Dissections

Dissections
Author: Greg N. Frederickson
Publisher: Cambridge University Press
Total Pages: 334
Release: 1997
Genre: Mathematics
ISBN: 9780521525824

A comprehensive, beautifully illustrated survey accessible to anyone familiar with high school geometry.

Forbidden Configurations in Discrete Geometry

Forbidden Configurations in Discrete Geometry
Author: David Eppstein
Publisher: Cambridge University Press
Total Pages: 241
Release: 2018-05-17
Genre: Computers
ISBN: 1108540279

This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for many algorithms that compute properties of point sets.