Deift shows how an easy-to-state problem in combinatorics is accessible by methods in the subject of explicitly solvable differential equations. In so doing, he indicates connections among partitions, Painlevé's equations, random matrices, the zeros of the Reimann zeta function, and the method of steepest descent. (pp. 631)
Email this
The author gives an overview of the nature of inquiry within mathematics education, both pure and applied, providing applied examples largely from the undergraduate level. (pp. 641)
Email this