Skip to main content
Log in

Discrete Cycloids from Convex Symmetric Polygons

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

Cycloids, hypocycloids and epicycloids have an often forgotten common property: they are homothetic to their evolutes. But what if we use convex symmetric polygons as unit balls, can we define evolutes and cycloids which are genuinely discrete? Indeed, we can! We define discrete cycloids as eigenvectors of a discrete double evolute transform which can be seen as a linear operator on a vector space we call curvature radius space. We are also able to classify such cycloids according to the eigenvalues of that transform, and show that the number of cusps of each cycloid is well determined by the ordering of those eigenvalues. As an elegant application, we easily establish a version of the four-vertex theorem for closed convex polygons. The whole theory is developed using only linear algebra, and concrete examples are given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Choosing a convex symmetric unit ball is the same as choosing a norm in the plane, so we are in the realms of Minkowski Geometry [7].

  2. Ok, there is no physical hearing in this context, but we wanted to cite [4].

  3. In fact, all the theory could be done if P were any locally convex polygon that goes around the origin m times (not necessarily repeating itself at each turn), but then the geometric interpretation of P as a unit ball is somewhat diminished. Three articles for the price of one!

References

  1. Arnold, M., Fuchs, D., Izmestiev, I., Tabachnikov, S., Tsukerman, E.: Iterating evolutes and involutes. Discrete Comput. Geom. 58(1), 80–143 (2017)

    Article  MathSciNet  Google Scholar 

  2. Craizer, M., Martini, H.: Involutes of polygons of constant width in Minkowski planes. Ars Math. Contemp. 11(1), 107–125 (2016)

    Article  MathSciNet  Google Scholar 

  3. Craizer, M., Teixeira, R., Balestro V.: Closed cycloids in a normed plane. Monatsh. Math. https://doi.org/10.1007/s00605-017-1030-5

    Article  MathSciNet  Google Scholar 

  4. Kac, M.: Can one hear the shape of a drum? Am. Math. Mon. 73(4), 1–23 (1966)

    Article  MathSciNet  Google Scholar 

  5. Schneider, R.: The middle hedgehog of a planar convex body. Beitr. Algebra Geom. 58(2), 235–245 (2017)

    Article  MathSciNet  Google Scholar 

  6. Tabachnikov, S.: A four vertex theorem for polygons. Am. Math. Mon. 107(9), 830–833 (2000)

    Article  MathSciNet  Google Scholar 

  7. Thompson, A.C.: Minkowski Geometry. Encyclopedia of Mathematics and Its Applications, vol. 63. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  8. Wang, Y., Shi, Y.: Eigenvalues of second-order difference equations with periodic and antiperiodic boundary conditions. J. Math. Anal. Appl. 309(1), 56–69 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ralph Teixeira.

Additional information

Editor in Charge: Kenneth Clarkson

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Craizer, M., Teixeira, R. & Balestro, V. Discrete Cycloids from Convex Symmetric Polygons. Discrete Comput Geom 60, 859–884 (2018). https://doi.org/10.1007/s00454-017-9955-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-017-9955-y

Keywords

Mathematics Subject Classification

Navigation