Hostname: page-component-848d4c4894-xfwgj Total loading time: 0 Render date: 2024-06-28T03:29:13.208Z Has data issue: false hasContentIssue false
  • English
  • Français

Regular polygons and a propellor problem for convex sets in the plane

Published online by Cambridge University Press:  17 April 2009

P.R. Scott
P.R. Scott
Affiliation:
Department of Pure Mathematics, The University of Adelaide, South Australia 5005, Australia e-mail: pscott@maths.adelaide.edu.au
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.

We find the convex planar set of maximal area which is partitioned into subsets of equal area by a given propellor. The argument depends on the characterisation of an n-sided polygon which is circumscribed about a regula n-gon Pn, and inscribed in a regula n-gon Qn, where Pn and Qn are homothetic about their common centre.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 55 , Issue 3 , June 1997 , pp. 483 - 487
Copyright
Copyright © Australian Mathematical Society 1997

References

[1]Davis, C., ‘An extremal problem for plane convex curves’, Proc. Sympos. Pure Math. VII (1963), 181–186.CrossRefGoogle Scholar