Hostname: page-component-745bb68f8f-g4j75 Total loading time: 0 Render date: 2025-01-13T13:22:33.435Z Has data issue: false hasContentIssue false
  • English
  • Français

Lattice dissections: plainer and less fancy

Published online by Cambridge University Press:  17 October 2018

Vincent J. Matsko
Vincent J. Matsko*
Affiliation:
15114 Dilbeck Dr., Spring Hill, FL 34610USA e-mail: vince.matsko@gmail.com
Get access Rights & Permissions [Opens in a new window]

Extract

The title of this Article pays homage to Greg Frederickson's widelyknown book on geometrical dissections, Dissections: Plane & Fancy [1]. I enjoyed the book so much, I built an honours geometry course around it − a terminal mathematics course for honours students needing a mathematics credit for their general education requirements. Not only is there significant geometry involved, but there is a fair amount of number theory relevant to finding infinite families of dissections of, for example, m squares to n squares.

However, although many dissections from one regular polygon to another are quite elegant, the mathematics involved in specifying the dissections is often formidable.

Type
Articles
Information
The Mathematical Gazette , Volume 102 , Issue 555 , November 2018 , pp. 454 - 459
Copyright
Copyright © Mathematical Association 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Frederickson, Greg N., Dissections: Plane & Fancy, Cambridge University Press, New York (1997).Google Scholar