N-flake¶

Generate a family of polygonal self-similar attractors by placing contracted copies of a regular n-gon at its vertices, optionally adding a convention-controlled central copy, and iterating the resulting similarity system.

Version: v2 · 2026-08-30 · History
Domain-specific #: 2343
Origin domain: fractal geometry
Subdomain: polygonal iterated function systems

Core Idea¶

An (n)-flake, also called a Sierpiński (n)-gon or polyflake in qualified usage, is a self-similar polygonal fractal obtained as the attractor of similarity maps that place contracted regular (n)-gons at the vertices of a parent (n)-gon, with any central copy and scale convention stated explicitly.^[1] Each retained polygon is replaced by the same vertex-centered configuration at a fixed scale, so finite approximants converge in the Hausdorff metric to the invariant compact set of the iterated function system; under separation, the similarity dimension solves the copy-count scaling equation.

Its autonomous residual is the parameterized regular-polygon iterated-function-system family with vertex-copy placement, not every polygonal fractal, every object ending in flake, or one rendered finite pattern. The identity fails when the replacement rule changes between iterations, the maps are not contractions, copies overlap despite a formula requiring separation, the central-copy convention is left implicit, or a finite mosaic is treated as the mathematical limit.

Recognition requires an analyst to state n, every similarity map or equivalent placement rule, the contraction ratio and central-copy convention, verify contractivity and any claimed touching or separation property, distinguish finite approximants from the attractor, and derive rather than assume a dimension formula. Once established, it supports comparing Sierpiński polygon families, studying similarity dimension and separation, analyzing limiting behavior as n changes, generating controlled approximants, and distinguishing named triangle, pentaflake, hexaflake, and Vicsek-related variants without turning those uses into the definition.

Structural Signature¶

Carrier: a regular (n)-gon with \(n\geq3\), a declared set of similarity maps placing contracted copies at its vertices and possibly its center, and the unique compact attractor of that system
Inputs or antecedent state: number of sides, polygon orientation, contraction ratio, vertex maps, central-copy convention, touching and nonoverlap requirements, iteration depth, and open-set or separation conditions
Constitutive operation: Each retained polygon is replaced by the same vertex-centered configuration at a fixed scale, so finite approximants converge in the Hausdorff metric to the invariant compact set of the iterated function system; under separation, the similarity dimension solves the copy-count scaling equation
Invariant: one fixed family of contractive polygonal similarities is iterated indefinitely and its placement, copy count, and central-copy convention determine the limiting attractor
Recognition test: state n, every similarity map or equivalent placement rule, the contraction ratio and central-copy convention, verify contractivity and any claimed touching or separation property, distinguish finite approximants from the attractor, and derive rather than assume a dimension formula
Output or consequence: comparing Sierpiński polygon families, studying similarity dimension and separation, analyzing limiting behavior as n changes, generating controlled approximants, and distinguishing named triangle, pentaflake, hexaflake, and Vicsek-related variants
Failure boundary: the replacement rule changes between iterations, the maps are not contractions, copies overlap despite a formula requiring separation, the central-copy convention is left implicit, or a finite mosaic is treated as the mathematical limit

What It Is Not¶

It is not the whole field of fractal geometry; many objects in that field do not satisfy its constitutive rule.
It is not its canonical example. For n equal to three with one half scale copies at the three vertices and no central copy, the attractor is the usual Sierpiński triangle. That is an instance, not a definition.
It is not Apollonian Gasket. An Apollonian gasket recursively fills curvilinear gaps with tangent circles governed by Descartes configurations; an n-flake iterates a fixed finite family of polygonal similarity maps.
It is not an unrestricted metaphor. For even and odd n, adding a central polygon can require different placement or scale formulas, and for some n a naive vertex-only construction degenerates into a filled polygon rather than a nontrivial dust

Scope of Application¶

N-flake applies when the analyst can specify a regular (n)-gon with \(n\geq3\), a declared set of similarity maps placing contracted copies at its vertices and possibly its center, and the unique compact attractor of that system and establish that one fixed family of contractive polygonal similarities is iterated indefinitely and its placement, copy count, and central-copy convention determine the limiting attractor. The entry fixes the two-dimensional regular-polygon family and marks extensions explicitly. Images and formulas from one center convention must not be generalized to all n-flakes.^[2]

Recognition. state n, every similarity map or equivalent placement rule, the contraction ratio and central-copy convention, verify contractivity and any claimed touching or separation property, distinguish finite approximants from the attractor, and derive rather than assume a dimension formula
Comparison. Compare legitimate instances through n, regularity, orientation, contraction ratio, vertex placement, center inclusion, copy count, overlap, separation condition, finite iteration, and limiting dimension.
Boundary. For even and odd n, adding a central polygon can require different placement or scale formulas, and for some n a naive vertex-only construction degenerates into a filled polygon rather than a nontrivial dust
Use. Preserve every assumption when using the identity for comparing Sierpiński polygon families, studying similarity dimension and separation, analyzing limiting behavior as n changes, generating controlled approximants, and distinguishing named triangle, pentaflake, hexaflake, and Vicsek-related variants.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because n-flake, Sierpiński n-gon, and polyflake overlap in usage but do not always fix center inclusion or contraction ratio, so the IFS is the authoritative identity statement. The disciplined statement is that the object counts as N-flake exactly when one fixed family of contractive polygonal similarities is iterated indefinitely and its placement, copy count, and central-copy convention determine the limiting attractor

Identity and measurement remain separate. Under an appropriate separation condition the similarity dimension is obtained from the contraction ratios; overlap can make that value differ from Hausdorff dimension, and numerical renderings do not settle the issue. Approximation or noisy evidence may weaken a classification without changing its definition.

Manages Complexity¶

The abstraction compresses triangle, square and Vicsek variants, pentaflake, hexaflake, higher n, centered and uncentered rules, star-polygon forms, two- and higher-dimensional analogues, and finite approximants into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares n, regularity, orientation, contraction ratio, vertex placement, center inclusion, copy count, overlap, separation condition, finite iteration, and limiting dimension and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning¶

Type the carrier. Establish a regular (n)-gon with \(n\geq3\), a declared set of similarity maps placing contracted copies at its vertices and possibly its center, and the unique compact attractor of that system and reject examples from a different problem.
Lock the rule. Express that one fixed family of contractive polygonal similarities is iterated indefinitely and its placement, copy count, and central-copy convention determine the limiting attractor independently of one notation or implementation.
Derive carefully. Infer comparing Sierpiński polygon families, studying similarity dimension and separation, analyzing limiting behavior as n changes, generating controlled approximants, and distinguishing named triangle, pentaflake, hexaflake, and Vicsek-related variants only under the stated assumptions.
Stress-test. Contrast the legitimate boundary case—For even and odd n, adding a central polygon can require different placement or scale formulas, and for some n a naive vertex-only construction degenerates into a filled polygon rather than a nontrivial dust—with this counterexample: a decorative snowflake assembled from differently sized polygons without one invariant similarity system is not an n-flake under the strict recognition rule.

Knowledge Transfer¶

Transfer within fractal geometry is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from For n equal to three with one half scale copies at the three vertices and no central copy, the attractor is the usual Sierpiński triangle. to A pentaflake convention places five vertex copies and one central copy of a regular pentagon at a scale chosen so neighboring copies touch without overlapping. demonstrates that continuity.^[3]

Outside the domain, only the skeleton—replace each retained unit by a fixed constellation of smaller similar units and take the invariant limit—travels automatically. The terms regular polygon, similarity, contraction, iterated function system, attractor, self-similarity, open set condition, Hausdorff dimension, pentaflake, and hexaflake retain domain-specific meanings, so every role and inference must be revalidated.

Examples¶

Canonical¶

For n equal to three with one half scale copies at the three vertices and no central copy, the attractor is the usual Sierpiński triangle. Three similarity maps of ratio one half satisfy the separation condition, giving similarity and Hausdorff dimension log 3 divided by log 2. It is canonical because the carrier, rule, invariant, and consequence are all inspectable.^[1]

Mapped back: a regular (n)-gon with \(n\geq3\), a declared set of similarity maps placing contracted copies at its vertices and possibly its center, and the unique compact attractor of that system → Each retained polygon is replaced by the same vertex-centered configuration at a fixed scale, so finite approximants converge in the Hausdorff metric to the invariant compact set of the iterated function system; under separation, the similarity dimension solves the copy-count scaling equation → one fixed family of contractive polygonal similarities is iterated indefinitely and its placement, copy count, and central-copy convention determine the limiting attractor → comparing Sierpiński polygon families, studying similarity dimension and separation, analyzing limiting behavior as n changes, generating controlled approximants, and distinguishing named triangle, pentaflake, hexaflake, and Vicsek-related variants

Applied / In Practice¶

A pentaflake convention places five vertex copies and one central copy of a regular pentagon at a scale chosen so neighboring copies touch without overlapping. Removing the center produces a different attractor and dimension, so both objects may be called pentaflakes only when the convention is made explicit. It qualifies only after the same diagnostic and failure boundary are checked.^[2]

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Exact identity vs. practical recognition. The constitutive condition may be exact while evidence is indirect. Diagnostic: Can the reviewer state both the condition and the warrant?
T2: Canonical form vs. variants. triangle, square and Vicsek variants, pentaflake, hexaflake, higher n, centered and uncentered rules, star-polygon forms, two- and higher-dimensional analogues, and finite approximants can preserve or change the identity. Diagnostic: Which named role is invariant across the variants?
T3: Compression vs. hidden assumptions. The label is useful only while prerequisites remain visible. Diagnostic: Can each downstream inference be traced to a declared assumption?
T4: Autonomy vs. reduction. The candidate uses broader structures but claims the parameterized regular-polygon iterated-function-system family with vertex-copy placement, not every polygonal fractal, every object ending in flake, or one rendered finite pattern. Diagnostic: Does that residual still support independent recognition after the parent and neighbors are subtracted?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is replace each retained unit by a fixed constellation of smaller similar units and take the invariant limit; its identity-bearing terms are regular polygon, similarity, contraction, iterated function system, attractor, self-similarity, open set condition, Hausdorff dimension, pentaflake, and hexaflake. Those terms determine admissible objects, evidence, and consequences inside fractal geometry.

Structural Core vs. Domain Accent¶

The structural core is a carrier governed by Each retained polygon is replaced by the same vertex-centered configuration at a fixed scale, so finite approximants converge in the Hausdorff metric to the invariant compact set of the iterated function system; under separation, the similarity dimension solves the copy-count scaling equation and tested by state n, every similarity map or equivalent placement rule, the contraction ratio and central-copy convention, verify contractivity and any claimed touching or separation property, distinguish finite approximants from the attractor, and derive rather than assume a dimension formula. The domain accent is constitutive rather than decorative, so an analogy that preserves only the skeleton is not another instance of N-flake.

The proposed strict upward parent is prime:fractal_geometry. The object is literally a self-similar attractor generated across scales; the regular n-gon carrier and vertex or center placement rule provide the domain-specific residual. The edge is proposal-only and points to a frozen prior-baseline Prime.

The entry does not collapse into the parent because the parameterized regular-polygon iterated-function-system family with vertex-copy placement, not every polygonal fractal, every object ending in flake, or one rendered finite pattern A thematic neighbor is declined whenever it does not literally subsume that rule.

The prospective workspace queue contains one strict upward edge to prime:fractal_geometry. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction N-flake Domain-specific

Parents (1) — more general patterns this builds on

N-flake is a kind of Fractal Geometry Prime

The proposed strict upward parent is prime:fractal_geometry.

Hierarchy paths (5) — routes to 5 parentless roots

N-flake → Fractal Geometry → Scale Invariance → Invariance

Show alternative paths (4)

Neighborhood in Abstraction Space¶

N-flake sits in a sparse region of the domain-specific corpus (62^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Extremal & Geometric Combinatorics (13 abstractions)

Nearest neighbors

Map graph — 0.88
Lattice graph — 0.86
Expander graph — 0.85
Baranyai's theorem — 0.85
Triangulation (topology) — 0.85

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Sierpiński triangle. The n equals three special case under a particular no-center convention.
Vicsek fractal. A five-square cross or corner-center IFS often associated with a four-flake variant but requiring its own placement convention.
Koch snowflake. A boundary-replacement curve and enclosed region rather than the polygon-copy attractor defined here.
Polyflake tiling. A plane tiling by polyforms, unrelated despite the shared word flake.

References¶

[1] Kevin Dennis and Steven Schlicker, 'Sierpinski n-Gons,' Pi Mu Epsilon Journal 10(2), 81–89 (1995). registry ↩a ↩b

[2] John E. Hutchinson, 'Fractals and Self-Similarity,' Indiana University Mathematics Journal 30(5), 713–747 (1981), DOI 10.1512/iumj.1981.30.30055. registry ↩a ↩b

[3] Andrey Dmitruk et al., 'Strictly Self-Similar Fractals Composed of Star-Polygons That Are Attractors of Iterated Function Systems,' arXiv:1502.01384 (2015), treating Sierpiński n-gons, n-flakes, and polyflakes. registry ↩