Magic Polygons and Combinatorial Algorithms
Asian Research Journal of Mathematics · pp. 27–39 · Published 31 Aug 2022
10.9734/arjom/2022/v18i1130424Abstract
In this work, we study the Magic Polygons of order 3 (P(n; 2)) and we introduce some properties that were useful to build an algorithm to find out how many Magic Polygons exists for the regular polygons up to 24 sides. The concepts of Equivalents Magic Polygons and Derivatives Magic Polygons which allowed to classify, and avoid ambiguity about the representations of such elements, are also introduced.
Cited by 0
No indexed citations yet.
Related research
- Magic Polygons and Degenerated Magic Polygons: Characterization and Properties — shares topic coverage
- A Constructive Method for Generating Short Presentations for the Symmetric Groups Sm+n, S2m and Smn — shares topic coverage
Article metrics
Real usage data collected on this platform.
17
Page views
0
PDF downloads
2
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.