Hostname: page-component-7b9c58cd5d-9k27k Total loading time: 0 Render date: 2025-03-14T19:12:50.934Z Has data issue: false hasContentIssue false

Lattice dissections: plainer and less fancy

Published online by Cambridge University Press:  17 October 2018

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

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Copyright
Copyright © Mathematical Association 2018 

References

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