Pythagoras tree (fractal)

Last updated
Animation of an imperfectly self-resembling Pythagoras tree
The Pythagoras tree with an angle of 25 degrees and smooth coloring Pythagoras Tree Colored.png
The Pythagoras tree with an angle of 25 degrees and smooth coloring

The Pythagoras tree is a plane fractal constructed from squares. Invented by the Dutch mathematics teacher Albert E. Bosman in 1942, [1] it is named after the ancient Greek mathematician Pythagoras because each triple of touching squares encloses a right triangle, in a configuration traditionally used to depict the Pythagorean theorem. If the largest square has a size of L × L, the entire Pythagoras tree fits snugly inside a box of size 6L × 4L. [2] [3] The finer details of the tree resemble the Lévy C curve.

Contents

Construction

The construction of the Pythagoras tree begins with a square. Upon this square are constructed two squares, each scaled down by a linear factor of 2/2, such that the corners of the squares coincide pairwise. The same procedure is then applied recursively to the two smaller squares, ad infinitum. The illustration below shows the first few iterations in the construction process. [2] [3]

Construction of the Pythagoras tree, order 0 PythagorasTree1.png
Construction of the Pythagoras tree, order 0
Order 1 PythagorasTree2.png
Order 1
Order 2 PythagorasTree3.png
Order 2
Order 3 PythagorasTree4.png
Order 3
Order 0Order 1Order 2Order 3

This is the simplest symmetric triangle. Alternatively, the sides of the triangle are recursively equal proportions, leading to the sides being proportional to the square root of the inverse golden ratio, and the areas of the squares being in golden ratio proportion.

Area

Iteration n in the construction adds 2n squares of area , for a total area of 1. Thus the area of the tree might seem to grow without bound in the limit as n  ∞. However, some of the squares overlap starting at the order 5 iteration, and the tree actually has a finite area because it fits inside a 6×4 box. [2]

It can be shown easily that the area A of the Pythagoras tree must be in the range 5 < A < 18, which can be narrowed down further with extra effort. Little seems to be known about the actual value of A.

Varying the angle

An interesting set of variations can be constructed by maintaining an isosceles triangle but changing the base angle (90 degrees for the standard Pythagoras tree). In particular, when the base half-angle is set to (30°) = arcsin(0.5), it is easily seen that the size of the squares remains constant. The first overlap occurs at the fourth iteration. The general pattern produced is the rhombitrihexagonal tiling, an array of hexagons bordered by the constructing squares.

Ptang4th.svg Ptang10th.svg
Order 4Order 10

In the limit where the half-angle is 90 degrees, there is obviously no overlap, and the total area is twice the area of the base square.

History

The Pythagoras tree was first constructed by Albert E. Bosman (1891–1961), a Dutch mathematics teacher, in 1942. [2] [4]

See also

Related Research Articles

<span class="mw-page-title-main">Sierpiński carpet</span> Plane fractal built from squares

The Sierpiński carpet is a plane fractal first described by Wacław Sierpiński in 1916. The carpet is a generalization of the Cantor set to two dimensions; another is Cantor dust.

<span class="mw-page-title-main">Sierpiński triangle</span> Fractal composed of triangles

The Sierpiński triangle, also called the Sierpiński gasket or Sierpiński sieve, is a fractal attractive fixed set with the overall shape of an equilateral triangle, subdivided recursively into smaller equilateral triangles. Originally constructed as a curve, this is one of the basic examples of self-similar sets—that is, it is a mathematically generated pattern that is reproducible at any magnification or reduction. It is named after the Polish mathematician Wacław Sierpiński, but appeared as a decorative pattern many centuries before the work of Sierpiński.

<span class="mw-page-title-main">Koch snowflake</span> Fractal curve

The Koch snowflake is a fractal curve and one of the earliest fractals to have been described. It is based on the Koch curve, which appeared in a 1904 paper titled "On a Continuous Curve Without Tangents, Constructible from Elementary Geometry" by the Swedish mathematician Helge von Koch.

<span class="mw-page-title-main">Fractal antenna</span> Antenna with a fractal shape

A fractal antenna is an antenna that uses a fractal, self-similar design to maximize the effective length, or increase the perimeter, of material that can receive or transmit electromagnetic radiation within a given total surface area or volume.

<span class="mw-page-title-main">Menger sponge</span> Three-dimensional fractal

In mathematics, the Menger sponge is a fractal curve. It is a three-dimensional generalization of the one-dimensional Cantor set and two-dimensional Sierpinski carpet. It was first described by Karl Menger in 1926, in his studies of the concept of topological dimension.

<span class="mw-page-title-main">Dragon curve</span> Fractal constructible with L-systems

A dragon curve is any member of a family of self-similar fractal curves, which can be approximated by recursive methods such as Lindenmayer systems. The dragon curve is probably most commonly thought of as the shape that is generated from repeatedly folding a strip of paper in half, although there are other curves that are called dragon curves that are generated differently.

<span class="mw-page-title-main">Sierpiński curve</span>

Sierpiński curves are a recursively defined sequence of continuous closed plane fractal curves discovered by Wacław Sierpiński, which in the limit completely fill the unit square: thus their limit curve, also called the Sierpiński curve, is an example of a space-filling curve.

In mathematics, the Lévy C curve is a self-similar fractal curve that was first described and whose differentiability properties were analysed by Ernesto Cesàro in 1906 and Georg Faber in 1910, but now bears the name of French mathematician Paul Lévy, who was the first to describe its self-similarity properties as well as to provide a geometrical construction showing it as a representative curve in the same class as the Koch curve. It is a special case of a period-doubling curve, a de Rham curve.

In mathematics, the T-square is a two-dimensional fractal. It has a boundary of infinite length bounding a finite area. Its name comes from the drawing instrument known as a T-square.

<span class="mw-page-title-main">Special right triangle</span> Right triangle with a feature making calculations on the triangle easier

A special right triangle is a right triangle with some regular feature that makes calculations on the triangle easier, or for which simple formulas exist. For example, a right triangle may have angles that form simple relationships, such as 45°–45°–90°. This is called an "angle-based" right triangle. A "side-based" right triangle is one in which the lengths of the sides form ratios of whole numbers, such as 3 : 4 : 5, or of other special numbers such as the golden ratio. Knowing the relationships of the angles or ratios of sides of these special right triangles allows one to quickly calculate various lengths in geometric problems without resorting to more advanced methods.

<span class="mw-page-title-main">H tree</span> Right-angled fractal canopy

In fractal geometry, the H tree is a fractal tree structure constructed from perpendicular line segments, each smaller by a factor of the square root of 2 from the next larger adjacent segment. It is so called because its repeating pattern resembles the letter "H". It has Hausdorff dimension 2, and comes arbitrarily close to every point in a rectangle. Its applications include VLSI design and microwave engineering.

<span class="mw-page-title-main">Vicsek fractal</span>

In mathematics the Vicsek fractal, also known as Vicsek snowflake or box fractal, is a fractal arising from a construction similar to that of the Sierpinski carpet, proposed by Tamás Vicsek. It has applications including as compact antennas, particularly in cellular phones.

Space-filling trees are geometric constructions that are analogous to space-filling curves, but have a branching, tree-like structure and are rooted. A space-filling tree is defined by an incremental process that results in a tree for which every point in the space has a finite-length path that converges to it. In contrast to space-filling curves, individual paths in the tree are short, allowing any part of the space to be quickly reached from the root. The simplest examples of space-filling trees have a regular, self-similar, fractal structure, but can be generalized to non-regular and even randomized/Monte-Carlo variants. Space-filling trees have interesting parallels in nature, including fluid distribution systems, vascular networks, and fractal plant growth, and many interesting connections to L-systems in computer science.

<span class="mw-page-title-main">Pythagorean theorem</span> Relation between sides of a right triangle

In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse is equal to the sum of the areas of the squares on the other two sides.

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.

The total active reflection coefficient (TARC) within mathematics and physics scattering theory, relates the total incident power to the total outgoing power in an N-port microwave component. The TARC is mainly used for multiple-input multiple-output (MIMO) antenna systems and array antennas, where the outgoing power is unwanted reflected power. The name shows the similarities with the active reflection coefficient, which is used for single elements. The TARC is the square root of the sum of all outgoing powers at the ports, divided by the sum of all incident powers at the ports of an N-port antenna. Similarly to the active reflection coefficient, the TARC is a function of frequency, and it also depends on scan angle and tapering. With this definition we can characterize the multi-port antenna’s frequency bandwidth and radiation performance. When the antennas are made of lossless materials, TARC can be computed directly from the scattering matrix by

<span class="mw-page-title-main">Rep-tile</span> Shape subdivided into copies of itself

In the geometry of tessellations, a rep-tile or reptile is a shape that can be dissected into smaller copies of the same shape. The term was coined as a pun on animal reptiles by recreational mathematician Solomon W. Golomb and popularized by Martin Gardner in his "Mathematical Games" column in the May 1963 issue of Scientific American. In 2012 a generalization of rep-tiles called self-tiling tile sets was introduced by Lee Sallows in Mathematics Magazine.

<span class="mw-page-title-main">Rakhesh Singh Kshetrimayum</span> Indian electrical engineer

Rakhesh Singh Kshetrimayum, FIET, SMIEEE is an electrical engineer, educator and Professor in the department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati. Recently, he was listed in the world's top 2% scientists for the year 2021 by the researchers from Stanford University. Earlier in 2021 and 2020, he was also listed in the world's top 2% scientists for the year 2020 and 2019.

In antenna theory, radiation efficiency is a measure of how well a radio antenna converts the radio-frequency power accepted at its terminals into radiated power. Likewise, in a receiving antenna it describes the proportion of the radio wave's power intercepted by the antenna which is actually delivered as an electrical signal. It is not to be confused with antenna efficiency, which applies to aperture antennas such as a parabolic reflector or phased array, or antenna/aperture illumination efficiency, which relates the maximum directivity of an antenna/aperture to its standard directivity.

References

  1. "Bruno's column (0402) Boom van Pythagoras". Archived from the original on 2009-01-18. Retrieved 2012-03-10..
  2. 1 2 3 4 Wisfaq.nl.
  3. 1 2 Pourahmadazar, J.; Ghobadi, C.; Nourinia, J. (2011). "Novel Modified Pythagorean Tree Fractal Monopole Antennas for UWB Applications". IEEE Antennas and Wireless Propagation Letters. New York: IEEE. 10: 484–487. Bibcode:2011IAWPL..10..484P. doi:10.1109/LAWP.2011.2154354.
  4. Arsetmathesis.nl Archived 2009-01-18 at the Wayback Machine