2025/10/08 by Anna Mućka, Mućka, A., Anna Romanowska +1
Computer Science · Mathematics · #08A05 #20N02 #52A01 #52B11 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric and Algebraic Topology #Mathematics and Applications
paper · pdf · doi:10.48550/arxiv.2510.07244
openalex publication_date 2025/10/08 · openalex created_date 2025/10/18 · openalex updated_date 2026/07/28
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.