Regular Polygon¶
A Euclidean polygon whose equally spaced vertices follow one constant edge-connection step, giving a connected rotationally symmetric boundary.
Core Idea¶
A regular polygon is a Euclidean straight-edge polygon with a repeated geometric rule rather than an accidental collection of equal lengths. In the ordinary convex case, \(n\ge3\) vertices lie at equal angular intervals on a circle and each is joined to the next, yielding the familiar equilateral and equiangular \(\{n\}\). If a convention admits self-intersecting regular stars, joining every \(m\)-th vertex instead gives \(\{n/m\}\), provided the step visits all vertices before returning, or \(\gcd(n,m)=1\). Thus a square \(\{4\}\) and pentagram \(\{5/2\}\) have different boundary behavior but share one cyclic vertex-orbit and constant-step construction.[1][2]
The construction makes each vertex and edge equivalent under the repeated rotation, and suitable reflections preserve the pattern. It is a stricter identity than being merely equilateral or merely cyclic. The rule supplies useful angle, radius and symmetry deductions; it does not make convex interior formulas, tiling or compass-and-straightedge constructibility universal to every star variant.[1][2][3]
Structural Signature¶
Sig role-phrases:
- Polygon carrier: one finite closed cycle of straight segments in a Euclidean plane. The self-intersection and filled-region conventions must be declared.
- Uniform circular vertex orbit: \(n\) vertices are successive \(2\pi/n\) rotations around a common center.[1][2]
- Constant connected step: each vertex connects to the vertex \(m\) places onward, using the same step throughout; \(\gcd(n,m)=1\) ensures one cycle rather than a compound of several.[2]
- Repeated symmetry: rotating by \(2\pi/n\) permutes vertices and edges, while reflection through suitable axes preserves the unoriented figure. This is a consequence of the construction and a recognition test.[1][2]
For the convex convention, \(m=1\). For a conventional connected star, take \(1<m<n/2\) and \(\gcd(n,m)=1\); \(m\) and \(n-m\) give reversed traversal of the same unoriented edges.[2]
What It Is Not¶
An equilateral polygon can fail to be regular if its vertices or angles are not arranged in the requisite repeated geometry. A cyclic polygon can have uneven angular gaps or chord lengths. A disconnected regular-looking star figure with \(\gcd(n,m)>1\) is a compound of cycles, not one connected \(\{n/m\}\) polygon under this entry's convention. A regular tessellation arranges many qualifying convex polygons in a plane; it is not the identity of one polygon.[1][2][3]
Scope of Application¶
Convex regular polygons appear as faces of regular polyhedra and as tiles. For an edge-to-edge regular tessellation of the Euclidean plane by one convex polygon type, the local angle condition admits equilateral triangles, squares and regular hexagons. This classification is a tiling consequence with a face-meeting rule; a regular pentagon remains a regular polygon although copies do not make such a regular tessellation.[3]
The same evenly spaced vertex set can be represented by complex roots of unity. Connect consecutive fifth roots for a convex pentagon or every second root for the pentagram. The latter is a regular star only under a polygon convention permitting self-intersection; its crossing points are not automatically additional vertices of the five-edge cycle.[2]
Clarity¶
Choose center \(c\), radius \(R>0\), and initial angle \(\theta_0\). The vertices are \(v_j=c+R(\cos(\theta_0+2\pi j/n),\sin(\theta_0+2\pi j/n))\), for \(j=0,\ldots,n-1\). Join \(v_j\) to \(v_{j+m}\), taking indices modulo \(n\). Repeated addition of \(m\) visits all \(n\) indices exactly when \(\gcd(n,m)=1\). Each edge subtends the same central-angle magnitude, so edge lengths agree. This is a compact constructive test, not an assertion that every equilateral drawing is regular.[1][2]
For \(m=1\), the polygon is simple and convex and each interior angle is \((n-2)\pi/n\). At \(m>1\), the edge cycle may cross itself, making “interior angle,” area and interior region convention-dependent. Convex formulas must not be transferred to a pentagram without stating which region and angle notion is meant.[1][2][3]
Manages Complexity¶
The repeated vertex rule replaces separate coordinates and lengths for every side with \(n\), \(m\), center, radius and phase. Once those are fixed, the remaining vertices and edges follow mechanically. Symmetry then reduces many local geometric checks to one representative edge or vertex. The same compression risks hiding a convention choice: step-one convex geometry and step-two star geometry have different interior and tiling behavior.[1][2]
Abstract Reasoning¶
Constant-step rotation sends edge \((v_j,v_{j+m})\) to \((v_{j+1},v_{j+m+1})\), so the edge set is invariant. Reflection reverses the circular ordering and maps constant-step chords to constant-step chords in the unoriented figure. Thus the regularity is a group action on the whole vertex-edge cycle, not just a list of matching measurements. The live prime Symmetry names the broad invariant, while this entry identifies the specific polygonal realization.[1][2]
Connectedness adds arithmetic to geometry. When \(d=\gcd(n,m)>1\), stepping by \(m\) reaches only \(n/d\) vertices before closing and leaves \(d\) cycles overall. A visually symmetric union of those cycles is not one regular \(n\)-vertex polygon under the connected-cycle convention. This is why the coprimality condition matters even when all chord lengths match.[2]
Knowledge Transfer¶
Square tiling and pentagram construction transfer the same closed planar edge cycle → equal-turn circular orbit → constant step → whole-figure symmetry grammar. Tiling uses a convex \(m=1\) object and adds a many-tile angle-fit rule. The pentagram uses \(m=2\) and a self-intersecting star convention. What transfers is construction and equivalence of vertices/edges, not every convex formula or use.[3][2]
Examples¶
Square in a regular plane tiling. Mapped back: carrier = one simple four-edge polygon; orbit = four equally spaced points on a circle; step = \(m=1\) visits all four; symmetry = quarter-turns and reflections preserve the boundary. Copies can meet four at a vertex in the regular tessellation \(\{4,4\}\), but tessellating is an additional arrangement property, not what makes the individual square regular.[1][3]
Pentagram from fifth roots of unity. Place five vertices at the fifth roots on the complex unit circle and join every second vertex. Mapped back: carrier = a connected self-intersecting five-edge cycle under the star convention; orbit = five equal angular steps; connection = \(m=2\), coprime to five; symmetry = fifth-turn rotations and reflections preserve the chord pattern. This is \(\{5/2\}\), not a convex pentagon and not an instance of its ordinary interior-angle formula.[2]
Structural Tensions¶
Convex simplicity versus star regularity. Step one gives a simple convex boundary; a larger coprime step can preserve full repeated symmetry while crossing itself. Diagnostic: Is the claim about the vertex-edge cycle, or about a particular filled interior and its angles?[1][2]
Repeated chords versus one connected polygon. Equal circular spacing and a fixed chord step make a symmetric figure, but a noncoprime step decomposes it into multiple cycles. Diagnostic: Does repeated addition of \(m\) visit every index before returning to the starting vertex?[2]
Structural–Framed Character¶
Evaluative weight. “Regular” is a geometric classification under a declared simple-or-star convention, not praise for an aesthetically pleasing drawing. Approximate visual balance does not establish exact membership.[1][2]
Human-practice bound. Mathematicians choose whether a context admits self-intersecting stars, yet the equal-orbit and chord-step test is objective once that convention is fixed. Institutional origin. Euclidean polygon geometry supplies the vocabulary; the identity does not depend on a particular tiling tradition or drafting tool.[1][2]
Vocabulary travel. Uniformity and symmetry can describe many systems, but vertices on a plane circle joined by straight chords are literal only in this geometric setting. Import versus recognition. A square and a pentagram can be recognized through the same cyclic construction under the stated convention; an organizational “regular polygon” metaphor imports the label without planar edges or vertices.[1][2]
Its character: mixed-structural—a formally testable geometric regularity whose star/simple scope is convention-framed.
Structural Core vs. Domain Accent¶
Portable skeleton. Live Symmetry supplies invariance under a specified transformation, which is needed for regular placement. The staged immediate strict genus is live Polygon: a regular polygon remains a finite planar closed straight-edge cycle, then adds uniform vertex orbit and fixed connected chord step. Symmetry is not proposed as an extra direct DAG parent.[1][2]
Domain-bound mechanism. The cycle construction admits a square and, under a star-inclusive convention, a pentagram. Square tiling is an external arrangement; the pentagram's step-two self-intersection changes interior and perimeter conventions. Inradius, convex interior angles and constructibility are derived or case-limited, not universal roles.[1][2][3]
Why not prime. Symmetry travels to language, physics and computation, but those instances lack a Euclidean polygon's vertices, straight edges and connection-step closure. The live prime contains the portable invariance; this entry's admission test remains geometric rather than a general-purpose prime for “regularity.”
Instantiates / Related Primes¶
This entry is a kind of Polygon.
Live prime Symmetry is a necessary broad property but not the genus of this geometric object. No canonical edge has been applied.
Relationships to Other Abstractions¶
Current abstraction Regular Polygon Domain-specific
Parents (1) — more general patterns this builds on
-
Regular Polygon is a kind of Polygon Domain-specific
A regular polygon is a closed straight-edge planar polygon with uniform vertex orbit and repeated edge step.The live Polygon entry admits a finite closed cyclic straight-edge boundary and explicitly leaves simplicity/self-intersection to a declared convention. Regular Polygon retains that genus while requiring n equally spaced circular vertices and one connected constant step. The staged strict edge does not make every polygon regular or every regular polygon a tiling.
Hierarchy path (1) — routes to 1 parentless root
- Regular Polygon → Polygon
Neighborhood in Abstraction Space¶
Regular Polygon sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Geometric Figures & Constructions (32 abstractions)
Nearest neighbors
- Polygon — 0.86
- Uniform polyhedron — 0.85
- Reuleaux polygon — 0.84
- Hexagon — 0.84
- Ideal polyhedron — 0.84
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
A regular \(n\)-gon is not necessarily a regular \(n\)-gon tessellation. A star crossing need not be a new polygon vertex. Equal edge lengths alone, or cyclic placement alone, is weaker than the full repeated-step structure. The notation \(\{n/m\}\) for noncoprime indices may denote a compound star figure, not one connected polygon; this entry keeps the distinction explicit.[1][2][3]
References¶
[1] Eric W. Weisstein, “Regular Polygon,” MathWorld (Wolfram Research), definition and regular-polygon geometry. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q
[2] Eric W. Weisstein, “Star Polygon,” MathWorld (Wolfram Research), opening construction, coprime-step condition and \(\{5/2\}\) example. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s ↩t ↩u ↩v ↩w
[3] Eric W. Weisstein, “Regular Tessellation,” MathWorld (Wolfram Research), equations (1)–(6) and the three Euclidean regular tilings. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h