Math 2.0

Number theory Example

Somos sequence

Example

For k≥4k \ge 4, the Somos-kk sequence is defined by a0=a1=⋯=ak−1=1a_0 = a_1 = \cdots = a_{k-1} = 1 and an an−k=∑j=1⌊k/2⌋an−j an−k+j(n≥k).a_n\, a_{n-k} = \sum_{j=1}^{\lfloor k/2 \rfloor} a_{n-j}\, a_{n-k+j} \qquad (n \ge k). This is a nonlinear difference equation: each new term is a quotient of a sum of products by an−ka_{n-k}. For k=4k = 4 the rule is an=(an−1an−3+an−22)/an−4a_n = (a_{n-1} a_{n-3} + a_{n-2}^2)/a_{n-4}. The Somos-4 sequence begins 1,1,1,1,2,3,7,23,59,314,1529,…1, 1, 1, 1, 2, 3, 7, 23, 59, 314, 1529, \dots. Check: a4=(1+1)/1=2a_4 = (1 + 1)/1 = 2, a5=(2⋅1+1)/1=3a_5 = (2 \cdot 1 + 1)/1 = 3, a6=(3⋅1+4)/1=7a_6 = (3 \cdot 1 + 4)/1 = 7, a7=(7⋅2+9)/1=23a_7 = (7 \cdot 2 + 9)/1 = 23, a8=(23⋅3+49)/2=59a_8 = (23 \cdot 3 + 49)/2 = 59, a9=(59⋅7+529)/3=314a_9 = (59 \cdot 7 + 529)/3 = 314. Although each step divides, the terms of Somos-44, 55, 66 and 77 are all integers. For Somos-88 this fails: a non-integer term appears. Fomin and Zelevinsky showed more for 4≤k≤74 \le k \le 7: with indeterminate initial values, each term is a Laurent polynomial in them with integer coefficients. For Somos-4 and Somos-5, this follows from the Laurent phenomenon for cluster algebras.

Further reading

  1. Web https://en.wikipedia.org/wiki/Somos_sequence
About this page
Tag27K5X7S4XN
URIm2://27K5X7S4XN
Kindexample
WritingW0 stub
MSC11B37, 13F60, 39A20
IllustratesLaurent phenomenon
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.