Automated Detection of Interesting Properties in Regular Polygons

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We demonstrate a systematic, automated way of discovery of a large number of new geometry theorems on regular polygons. The applied theory includes a formula by Watkins and Zeitlin on minimal polynomials of cos2πn, and a method by Recio and Vélez to discover a property in a plane geometry construction. This method exploits Wu’s idea on algebraizing the geometric setup and utilizes the theory of Gröbner bases. Also a bijective function is given that maps the investigated cases to the first natural numbers. Finally, several examples are shown that are all previously unknown results in planar Euclidean geometry.

Cite

CITATION STYLE

APA

Kovács, Z. (2020). Automated Detection of Interesting Properties in Regular Polygons. Mathematics in Computer Science, 14(4), 727–755. https://doi.org/10.1007/s11786-020-00491-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free