arXiv subjects

James M Parks

Publications and source records attributed to James M Parks.

5 recordsLinked to original sources

arXiv2025

Polygons in Polygons with a Twist

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon P. Initially, the study will concentrate on chords which are from a vertex to special points of one of the opposite sides of P. Several examples are explored. However, it will become apparent that a much more general situation exists. Dynamic Geometry software is the key to investigating this new relationship.

math.HO↗

arXiv2025

Max/Min Puzzles in Geometry IV

In the previous paper, Max/Min Puzzles in Geometry III, we searched for the smallest area triangle which contained a regular unit polygon (Square, Pentagon, Hexagon). In this paper we will work in 3-dimensions, and search for the smallest regular Tetrahedron which contains a regular unit polyhedron (Cube, Octahedron, Icosahedron, Dodecahedron).

math.HO↗

arXiv2022

Max/Min Puzzles in Geometry III

The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on Equilateral Triangles. In this paper the puzzle will be turned the other way around. Given the regular unit polygons, a Square, Pentagon, or Hexagon, we searched for the smallest area triangle(s) which contains it. The Dynamic Software Sketchpad v5.10 BETA was used for all examples and figures throughout the work.

math.HO↗

arXiv2022

Max/Min Puzzles in Geometry II

In this paper we continue the investigation of finding the max/min polygons which can be inscribed in a given triangle. Here we are concerned with equilateral triangles. This may seem uninteresting or benign at first, but there are some surprises later.

math.HO↗

arXiv2022

Max/Min Puzzles in Geometry

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is all vertices of the polygon are on the sides of the triangle. This concept will be generalized later to include wedged polygons.

math.HO↗