ABACABA pattern

Last updated
DABACABA patterns in (3-bit) binary numbers Binary number dabacaba pattern.png
DABACABA patterns in (3-bit) binary numbers

The ABACABA pattern is a recursive fractal pattern that shows up in many places in the real world (such as in geometry, art, music, poetry, number systems, literature and higher dimensions). [1] [2] [3] [4] Patterns often show a DABACABA type subset. AA, ABBA, and ABAABA type forms are also considered. [5]

Contents

Generating the pattern

In order to generate the next sequence, first take the previous pattern, add the next letter from the alphabet, and then repeat the previous pattern. The first few steps are listed here. [4]

StepPatternLetters
1A21 − 1 = 1
2ABA3
3ABACABA7
4ABACABADABACABA15
5ABACABADABACABAEABACABADABACABA31
6ABACABADABACABAEABACABADABACABAFABACABADABACABAEABACABADABACABA63

ABACABA is a "quickly growing word", often described as chiastic or "symmetrically organized around a central axis" (see: Chiastic structure and Χ). [4] The number of members in each iteration is a(n) = 2n − 1, the Mersenne numbers ( OEIS:  A000225 ).

See also

Notes

  1. The strength, emphasis, or importance of the beginning of each duration the length of a single measure in 4
    4
    (eighth-notes) is, divisively (, , ), determined by each eighth-note's position in a DABACABA structure, while the eighth notes of two measures grouped, additively (), are determined by an EABACABADABACABA structure. [3]

Related Research Articles

In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and mentioned by German mathematician Georg Cantor in 1883.

The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that these sequences always reach 1, no matter which positive integer is chosen to start the sequence. The conjecture has been shown to hold for all positive integers up to 2.95×1020, but no general proof has been found.

The reflected binary code (RBC), also known as reflected binary (RB) or Gray code after Frank Gray, is an ordering of the binary numeral system such that two successive values differ in only one bit.

10 (ten) is the even natural number following 9 and preceding 11. Ten is the base of the decimal numeral system, the most common system of denoting numbers in both spoken and written language.

<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.

In mathematics, a fractal dimension is a term invoked in the science of geometry to provide a rational statistical index of complexity detail in a pattern. A fractal pattern changes with the scale at which it is measured. It is also a measure of the space-filling capacity of a pattern, and it tells how a fractal scales differently, in a fractal (non-integer) dimension.

22 (twenty-two) is the natural number following 21 and preceding 23.

23 (twenty-three) is the natural number following 22 and preceding 24.

<span class="mw-page-title-main">Power of two</span> Two raised to an integer power

A power of two is a number of the form 2n where n is an integer, that is, the result of exponentiation with number two as the base and integer n as the exponent.

73 (seventy-three) is the natural number following 72 and preceding 74. In English, it is the smallest natural number with twelve letters in its spelled out name.

In mathematics, the Thue–Morse sequence or Prouhet–Thue–Morse sequence or parity sequence is the binary sequence obtained by starting with 0 and successively appending the Boolean complement of the sequence obtained thus far. The first few steps of this procedure yield the strings 0 then 01, 0110, 01101001, 0110100110010110, and so on, which are prefixes of the Thue–Morse sequence. The full sequence begins:

126 is the natural number following 125 and preceding 127.

<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.

The Wedderburn–Etherington numbers are an integer sequence named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn that can be used to count certain kinds of binary trees. The first few numbers in the sequence are

<span class="mw-page-title-main">1,000,000,000</span> Natural number

1,000,000,000 is the natural number following 999,999,999 and preceding 1,000,000,001. With a number, "billion" can be abbreviated as b, bil or bn.

10,000,000 is the natural number following 9,999,999 and preceding 10,000,001.

<span class="mw-page-title-main">5</span> Integer number 5

5 (five) is a number, numeral and digit. It is the natural number, and cardinal number, following 4 and preceding 6, and is a prime number.

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.

<span class="mw-page-title-main">Centered octahedral number</span> Figurate number

A centered octahedral number or Haüy octahedral number is a figurate number that counts the points of a three-dimensional integer lattice that lie inside an octahedron centered at the origin. The same numbers are special cases of the Delannoy numbers, which count certain two-dimensional lattice paths. The Haüy octahedral numbers are named after René Just Haüy.

<span class="mw-page-title-main">Ulam–Warburton automaton</span>

The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting with one square initially ON and all others OFF, successive iterations are generated by turning ON all squares that share precisely one edge with an ON square. This is the von Neumann neighborhood. The automaton is named after the Polish-American mathematician and scientist Stanislaw Ulam and the Scottish engineer, inventor and amateur mathematician Mike Warburton.

References

  1. 1 2 3 4 5 6 7 8 9 10 11 12 13 Naylor, Mike (February 2013). "ABACABA Amazing Pattern, Amazing Connections". Math Horizons. Retrieved June 13, 2019.
  2. 1 2 3 4 SheriOZ (2016-04-21). "Exploring Fractals with ABACABA". Chicago Geek Guy. Archived from the original on 22 January 2021. Retrieved January 22, 2021.
  3. 1 2 Naylor, Mike (2011). "Abacaba! – Using a mathematical pattern to connect art, music, poetry and literature" (PDF). Bridges. Retrieved October 6, 2017.
  4. 1 2 3 Conley, Craig (2008-10-01). Magic Words: A Dictionary. Weiser Books. p. 53. ISBN   9781609250508.
  5. Halter-Koch, Franz and Tichy, Robert F.; eds. (2000). Algebraic Number Theory and Diophantine Analysis, p.478. W. de Gruyter. ISBN   9783110163049.
  6. Wright, Craig (2016). Listening to Western Music, p.48. Cengage Learning. ISBN   9781305887039.