Somos sequence

From HandWiki

In mathematics, a Somos sequence is a sequence of numbers defined by a certain recurrence relation, described below. They were discovered by mathematician Michael Somos. From the form of their defining recurrence (which involves division), one would expect the terms of the sequence to be fractions, but surprisingly, a few Somos sequences have the property that all of their members are integers.

Recurrence equations

For an integer number k larger than 1, a Somos-k sequence {an}n∈ℤ is a solution of the equation anan−k=∑i=1⌊k/2⌋αian−ian−k+i where α1, α2, ..., α⌊k/2⌋ are fixed parameters. It can be rearranged into the form of an order k recurrence relation an=∑i=1⌊k/2⌋αian−ian−k+ian−k. Hence a non-degenerate solution is determined by a choice of k initial values a0, a1, ..., ak−1. The sequence yielded by setting α1=α2=…=α⌊k/2⌋=1 and a0=a1=…=ak−1=1 is referred to as the Somos-k sequence. The Somos-k sequence is symmetric, i.e., s−n=sn+k−1.

For k=2 or 3, the defining relations are very simple (there is no addition on the right-hand side).

In the first nontrivial case, k=4, the relation is an=αan−1an−3+βan−22an−4 where α and β are constant parameters. In the case k=5 the relation is an=αan−1an−4+βan−2an−3an−5.

Sequence values

The Somos-2 and Somos-3 sequences are the all-ones sequences (..., 1, 1, 1, 1, 1, ...).

The values in the Somos-4 sequence are

1, 1, 1, 1, 2, 3, 7, 23, 59, 314, 1529, 8209, 83313, 620297, 7869898, ... (sequence A006720 in the OEIS).

The values in the Somos-5 sequence are

1, 1, 1, 1, 1, 2, 3, 5, 11, 37, 83, 274, 1217, 6161, 22833, 165713, ... (sequence A006721 in the OEIS).

The values in the Somos-6 sequence are

1, 1, 1, 1, 1, 1, 3, 5, 9, 23, 75, 421, 1103, 5047, 41783, 281527, ... (sequence A006722 in the OEIS).

The values in the Somos-7 sequence are

1, 1, 1, 1, 1, 1, 1, 3, 5, 9, 17, 41, 137, 769, 1925, 7203, 34081, ... (sequence A006723 in the OEIS).

The first 17 values in the Somos-8 sequence are

1, 1, 1, 1, 1, 1, 1, 1, 4, 7, 13, 25, 61, 187, 775, 5827, 14815 [the next value is fractional].[1]

Integrality and the Laurent phenomenon

The form of the recurrences describing the Somos sequences involves divisions, making it appear likely that the sequences defined by these recurrence will contain fractional values. Nevertheless, for k≤7 the Somos sequences contain only integer values.[2][3][4] Generally, for k≤7, a Somos-k sequence satisfies the so-called Laurent property. That is, as a function of the initial terms a0, ..., ak−1, every term an is a multivariate Laurent polynomial with coefficients in ℤ[α1,…,α⌊k/2⌋]. Several mathematicians have studied the problem of proving and explaining this property of the Somos sequences; it is closely related to the combinatorics of cluster algebras.[5][3][6][7]

For k≥8 the Somos-k sequences eventually contain fractional values. For Somos-8 the first fractional value is the 18th term with value 420514/7.

Closed formula

Consider a Somos-4 relation anan−4=αan−1an−3+βan−22 with α≠0. Then a complex-valued Somos-4 sequence corresponds to an arithmetic sequence of points Q+nP on an elliptic curve E (see Elliptic curve). The general term is given by the formula[8] an=ABnσ(z0+nκ)σ(κ)n2 where σ(z)=σ(z;g2,g3) denotes the Weierstrass sigma function associated with the curve E written in the canonical form E:y2=4x3−g2x−g3. The six parameters g2,g3,A,B,z0,κ∈ℂ are determined uniquely (up to a choice of sign) by the coefficients α,β and the initial terms a0,a1,a2,a3. The (x,y) coordinates of the sequence Q+nP are given by (℘(z0+nκ),℘′(z0+nκ)), where ℘(z)=℘(z;g2,g3) denotes the Weierstrass elliptic function. The coefficients α and β are given as elliptic functions of κ by α=℘(κ)2,β=℘′(κ)2(℘(2κ)−℘(κ)).

See also

References

  1. ↑ Mase, Takafumi (2013), "The Laurent phenomenon and discrete integrable systems", The breadth and depth of nonlinear discrete integrable systems, RIMS Kôkyûroku Bessatsu, B41, Res. Inst. Math. Sci. (RIMS), Kyoto, pp. 43–64, https://www.kurims.kyoto-u.ac.jp/~kenkyubu/bessatsu/open/B41/pdf/B41_003.pdf 
  2. ↑ Malouf, Janice L. (1992), "An integer sequence from a rational recursion", Discrete Mathematics 110 (1–3): 257–261, doi:10.1016/0012-365X(92)90714-Q .
  3. ↑ 3.0 3.1 Carroll, Gabriel D.; Speyer, David E. (2004), "The Cube Recurrence", Electronic Journal of Combinatorics 11, doi:10.37236/1826 .
  4. ↑ A Bare-Bones Chronology of Somos Sequences, https://faculty.uml.edu/jpropp/somos/chronology.html, retrieved 2023-11-27 
  5. ↑ Fomin, Sergey; Zelevinsky, Andrei (2002), "The Laurent phenomenon", Advances in Applied Mathematics 28 (2): 119–144, doi:10.1006/aama.2001.0770 .
  6. ↑ Hone, Andrew N. W. (2023), "Casting light on shadow Somos sequences", Glasgow Mathematical Journal 65 (S1): S87–S101, doi:10.1017/S0017089522000167 
  7. ↑ Stone, Alex (18 November 2023), "The Astonishing Behavior of Recursive Sequences", Quanta Magazine, https://www.quantamagazine.org/the-astonishing-behavior-of-recursive-sequences-20231116/ 
  8. ↑ Hone, Andrew N. W. (2005), "Elliptic Curves and Quadratic Recurrence Sequences", Bulletin of the London Mathematical Society 37 (2): 161-171, doi:10.1112/S0024609304004163