ArticleslgStudy

science

N-flake

N-flake is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand N-flake rather than just read about it. In short: An n-flake, polyflake, or Sierpinski n-gon, is a fractal constructed starting from an n-gon. This n-gon is replaced by a flake of smaller n-gons, such that the scaled polygons are placed at the vertices, and sometimes in the center.

N-flake — main illustration
N-flake — illustration

Key takeaways

  • N-flake belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect N-flake to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of N-flake from memory before moving on to harder problems.

Reference excerpt

An n-flake, polyflake, or Sierpinski n-gon, is a fractal constructed starting from an n-gon. This n-gon is replaced by a flake of smaller n-gons, such that the scaled polygons are placed at the vertices, and sometimes in the center. This process is repeated recursively to result in the fractal. Typically, there is also the restriction that the n-gons must touch yet not overlap.

In two dimensions The most common variety of n-flake is two-dimensional (in terms of its topological dimension) and is formed of polygons. The four most common special cases are formed with triangles, squares, pentagons, and hexagons, but it can be extended to any polygon. Its boundary is the von Koch curve of varying types – depending on the n-gon – and infinitely many Koch curves are contained within. The fractals occupy zero area yet have an infinite perimeter. The formula of the scale factor r for any n-flake is:

r = 1 2 ( 1 + ∑ k = 1 ⌊ n / 4 ⌋ cos ⁡ 2 π k n ) {\displaystyle r={\frac {1}{2\left(1+\displaystyle \sum _{k=1}^{\lfloor n/4\rfloor }{\cos {\frac {2\pi k}{n}}}\right)}}}

where cosine is evaluated in radians and n is the number of sides of the n-gon. The Hausdorff dimension of a n-flake is log ⁡ m log ⁡ r {\displaystyle \textstyle {\frac {\log m}{\log r}}} , where m is the number of polygons in each individual flake and r is the scale factor.

Sierpinski triangle The Sierpinski triangle is an n-flake formed by successive flakes of three triangles. Each flake is formed by placing triangles scaled by 1/2 in each corner of the triangle they replace. Its Hausdorff dimension is equal to log ⁡ ( 3 ) log ⁡ ( 2 ) {\displaystyle \textstyle {\frac {\log(3)}{\log(2)}}} ≈ 1.585. The log ⁡ ( 3 ) log ⁡ ( 2 ) {\displaystyle \textstyle {\frac {\log(3)}{\log(2)}}} is obtained because each iteration has 3 triangles that are scaled by 1/2.

Vicsek fractal

If a sierpinski 4-gon were constructed from the given definition, the scale factor would be 1/2 and the fractal would simply be a square. A more interesting alternative, the Vicsek fractal, rarely called a quadraflake, is formed by successive flakes of five squares scaled by 1/3. Each flake is formed either by placing a scaled square in each corner and one in the center or one on each side of the square and one in the center. Its Hausdorff dimension is equal to log ⁡ ( 5 ) log ⁡ ( 3 ) {\displaystyle \textstyle {\frac {\log(5)}{\log(3)}}} ≈ 1.4650. The log ⁡ ( 5 ) log ⁡ ( 3 ) {\displaystyle \textstyle {\frac {\log(5)}{\log(3)}}} is obtained because each iteration has 5 squares that are scaled by 1/3. The boundary of the Vicsek Fractal is a Type 1 quadratic Koch curve.

Pentaflake

… excerpt ends here. Continue reading the full article.

Illustrations

N-flake illustration
N-flake: The fifth iteration of the Vicsek fractal
The fifth iteration of the Vicsek fractal
N-flake: Zooming into the boundary of a variation of the pentaflake
Zooming into the boundary of a variation of the pentaflake
N-flake illustration
N-flake illustration

Worked examples

Example 1 — a first encounter with N-flake

Start with the simplest possible case. Write down what N-flake claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to N-flake before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about N-flake ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of N-flake

In research
N-flake appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses N-flake in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
N-flake is common in secondary-school and first-year university syllabi. It links to neighbouring topics Fractal curves, Fractals, so understanding it makes those chapters shorter.
In everyday life
Look for N-flake outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study N-flake in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what N-flake means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain N-flake out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is N-flake in simple terms?

An n-flake, polyflake, or Sierpinski n-gon, is a fractal constructed starting from an n-gon. This n-gon is replaced by a flake of smaller n-gons, such that the scaled polygons are placed at the vertices, and sometimes in the center.

Why does N-flake matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study N-flake?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on N-flake.

Tags

  • Fractal curves
  • Fractals

Keep exploring