Automated detection of interesting properties in regular polygons
DOI10.1007/s11786-020-00491-zzbMath1466.51009OpenAlexW3038110339MaRDI QIDQ1995811
Publication date: 25 February 2021
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-020-00491-z
approximationscomputer algebraminimal polynomialsautomated theorem provingeliminationregular polygons\( \pi \)geogebrawebassembly
Polyhedra and polytopes; regular figures, division of spaces (51M20) Euclidean geometries (general) and generalizations (51M05) Euclidean analytic geometry (51N20) Algebraic geometry methods for problems in mechanics (70G55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using Gröbner bases to reason about geometry problems
- A deductive database approach to automated geometry theorem proving and discovering
- Finding and proving new geometry theorems in regular polygons with dynamic geometry and automated reasoning tools
- Automatic discovery of theorems in elementary geometry
- Automated generation of geometric theorems from images of diagrams
- Detecting truth, just on parts
- The Minimal Polynomial of cos(2π/n)
- Angle Trisection, the Heptagon, and the Triskaidecagon
- Chebyshev Polynomials and the Minimal Polynomial of cos (2<em>π</em>/<em>n</em>)
- On the notion of interestingness in automated mathematical discovery
- The Heptagonal Triangle
- Discovering Geometry Theorems in Regular Polygons
This page was built for publication: Automated detection of interesting properties in regular polygons