Jump to content

Toothpick sequence

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Bibcode Bot (talk | contribs) at 23:15, 20 June 2018 (Adding 0 arxiv eprint(s), 1 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The first three steps of the toothpick sequence and its emulation by a cellular automaton with the Margolus neighborhood
The 89th stage of the sequence, one of the stages at which T(n)/n2 is near its minimum

In geometry, the toothpick sequence is a sequence of 2-dimensional patterns which can be formed by repeatedly adding line segments ("toothpicks") to the previous pattern in the sequence.

The first stage of the design is a single "toothpick", or line segment. Each stage after the first is formed by taking the previous design and, for every exposed toothpick end, placing another toothpick centered at a right angle on that end.[1]

This process results in a pattern of growth in which the number of segments at stage n oscillates with a fractal pattern between 0.45n2 and 0.67n2. If T(n) denotes the number of segments at stage n, then values of n for which T(n)/n2 is near its maximum occur when n is near a power of two, while the values for which it is near its minimum occur near numbers that are approximately 1.43 times a power of two.[2] The structure of stages in the toothpick sequence often resemble the T-square fractal, or the arrangement of cells in the Ulam–Warburton cellular automaton.[1]

All of the bounded regions surrounded by toothpicks in the pattern, but not themselves crossed by toothpicks, must be squares or rectangles.[1] It has been conjectured that every open rectangle in the toothpick pattern (that is, a rectangle that is completely surrounded by toothpicks, but has no toothpick crossing its interior) has side lengths and areas that are powers of two, with one of the side lengths being at most two.[3]

References

  1. ^ a b c Applegate, David; Pol, Omar E.; Sloane, N. J. A. (2010). "The toothpick sequence and other sequences from cellular automata". Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium. Vol. 206. pp. 157–191. arXiv:1004.3036. Bibcode:2010arXiv1004.3036A. MR 2762248.
  2. ^ Cipra, Barry A. (2010). "What Comes Next?". Science. 327. AAAS: 943. doi:10.1126/science.327.5968.943. {{cite journal}}: Cite has empty unknown parameter: |1= (help)
  3. ^ Sloane, N. J. A. (ed.). "Sequence A139250 (Toothpick sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Toothpick_sequence&oldid=846795433"