Content deleted Content added
No edit summary |
m →Equivalent definitions: use inline 1/2 to avoid pushing text lines apart |
||
| (31 intermediate revisions by 21 users not shown) | |||
Line 1:
In mathematics, the '''Wythoff array''' is an infinite [[Matrix (mathematics)|matrix]] of [[positive integer]]s derived from the [[Fibonacci sequence]] and named after Dutch mathematician [[Willem Abraham Wythoff]]. Every positive integer occurs exactly once in the array, and every integer sequence defined by the Fibonacci recurrence can be derived by shifting a row of the array.
The Wythoff array was first defined by {{harvtxt|Morrison|1980}} using Wythoff pairs, the coordinates of winning positions in [[Wythoff's game]]. It can also be defined using [[Fibonacci number]]s and [[Zeckendorf's theorem]], or directly from the [[golden ratio]] and the [[recurrence relation]] defining the Fibonacci numbers.
==
The Wythoff array has the values
:<math>\begin{matrix}
1&2&3&5&8&13&21&\cdots\\
4&7&11&18&29&47&76&\cdots\\
6&10&16&26&42&68&110&\cdots\\
9&15&24&39&63&102&165&\cdots\\
12&20&32&52&84&136&220&\cdots\\
14&23&37&60&97&157&254&\cdots\\
17&28&45&73&118&191&309&\cdots\\
\vdots&\vdots&\vdots&\vdots&\vdots&\vdots&\vdots&\ddots\\
\end{matrix}</math> {{OEIS|A035513}}.
==Equivalent definitions==
Inspired by a similar [[Stolarsky array]] previously defined by {{harvtxt|Stolarsky|1977}}, {{harvtxt|Morrison|1980}} defined the Wythoff array as follows. Let <math>\varphi=\tfrac12\bigl(1+\sqrt{5}~\!\bigr)</math> denote the [[golden ratio]]; then the <math>i</math>th winning position in [[Wythoff's game]] is given by the pair of positive integers <math>(\lfloor i\varphi\rfloor, \lfloor i\varphi^2\rfloor)</math>, where the numbers on the left and right sides of the pair define two complementary [[Beatty sequence]]s that together include each positive integer exactly once. Morrison defines the first two numbers in row <math>m</math> of the array to be the Wythoff pair given by the equation <math>i=\lfloor m\varphi\rfloor</math>, and where the remaining numbers in each row are determined by the Fibonacci recurrence relation. That is, if <math>A_{m,n}</math> denotes the entry in row <math>m</math> and column <math>n</math> of the array, then
:<math>A_{m,1} = \left\lfloor \lfloor m\varphi \rfloor \varphi \right\rfloor</math>,
:<math>A_{m,2} = \left\lfloor \lfloor m\varphi \rfloor \varphi^2 \right\rfloor</math>, and
:<math>A_{m,n} = A_{m,n-2}+A_{m,n-1}</math> for <math>n > 2</math>.
The [[Zeckendorf's theorem|Zeckendorf representation]] of any positive integer is a representation as a sum of distinct Fibonacci numbers, no two of which are consecutive in the Fibonacci sequence. As {{harvtxt|Kimberling|1995}} describes, the numbers within each row of the array have Zeckendorf representation that differ by a shift operation from each other, and the numbers within each column have Zeckendorf representations that all use the same smallest Fibonacci number. In particular the entry <math>A_{m,n}</math> of the array is the <math>m</math>th smallest number whose Zeckendorf representation begins with the <math>(n+1)</math>th Fibonacci number.
==
Each Wythoff pair occurs exactly once in the Wythoff array, as a consecutive pair of numbers in the same row, with an odd index for the first number and an even index for the second. Because each positive integer occurs in exactly one Wythoff pair, each positive integer occurs exactly once in the array {{harv|Morrison|1980}}.
Every sequence of positive integers satisfying the Fibonacci recurrence occurs, shifted by at most finitely many positions, in the Wythoff array. In particular, the Fibonacci sequence itself is the first row, and the sequence of [[Lucas number]]s appears in shifted form in the second row {{harv|Morrison|1980}}.
▲The Wythoff Array is derived from the [[Fibonacci sequence]].
==References==▼
*{{citation
| last = Kimberling | first = Clark | author-link = Clark Kimberling
| issue = 1
| journal = [[Fibonacci Quarterly]]
| pages = 3–8
| title = The Zeckendorf array equals the Wythoff array
| url = http://www.fq.math.ca/Scanned/33-1/kimberling.pdf
| volume = 33
| year = 1995| doi = 10.1080/00150517.1995.12429166 }}.
*{{citation
| last = Morrison | first = D. R. | author-link = David R. Morrison (mathematician)
| contribution = A Stolarsky array of Wythoff pairs
| ___location = Santa Clara, Calif
| pages = 134–136
| publisher = The Fibonacci Association
| title = A Collection of Manuscripts Related to the Fibonacci Sequence
| url = http://web.math.ucsb.edu/~drm/papers/stolarsky.pdf
| year = 1980}}.
*{{citation
| last = Stolarsky | first = K. B.
| issue = 3
| journal = [[Fibonacci Quarterly]]
| page = 224
| title = A set of generalized Fibonacci sequences such that each natural number belongs to exactly one
| url = http://www.fq.math.ca/Scanned/15-3/stolarsky.pdf
| volume = 15
| year = 1977| doi = 10.1080/00150517.1977.12430440
}}.
==External links==▼
*{{mathworld|urlname=WythoffArray|title=Wythoff Array}}
*[https://oeis.org/A035513/ The Wythoff Array (Online Encyclopedia of Integer Sequences)]
[[Category:Triangles of numbers]]
▲==References==
[[Category:Fibonacci numbers]]
▲==External links==
| |||