Geometry of dyadic polygons II: isomorphisms of dyadic triangles
Abstract
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane D2 of the real plane R2 and a real convex polygon with vertices in the dyadic plane. Such polygons are described as subreducts (subalgebras of reducts) of the affine dyadic plane D2, or equivalently as commutative, entropic and idempotent groupoids under the binary operation of arithmetic mean. The first part of the paper contained a new classification of dyadic triangles, considered as such groupoids, and a characterization of dyadic triangles with a pointed vertex. This second part investigates isomorphisms of dyadic triangles, and provides a full classification of their isomorphism types.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.