Denominators of certain Laurent polynomials

Denominators of certain Laurent polynomials



Consider the following somos-like sequence
$$x_n=fracx_n-1^2+x_n-2^2x_n-3.$$
It's known that $x_n$ is a Laurent polynomial in $x_0, x_1$ and $x_2$. I got interested in the denominators of the sequence $x_n$. Some initial observations indicate particular structures regarding the exponents of the denominators, so I am tempted to ask:



Question: Is this true?
$$x_n=P_n(x_0,x_1,x_2)x_0^1-F_n-3x_1^1-F_n-4x_2^1-F_n-5,$$
where $P_n$ is some polynomial and $F_n$ is the Fibonacci sequence.





Not quite. In an OEIS sequence A064098 comment of mine from 2013, I explicitly state the Laurent property with denominators $a_1^e_na_2^e_n-1a_3^e_n-2$ where $e_n:=F_n-1$. The initial values in OEIS are $a_1,a_2,a_3$ but otherwise the sequences are the same. Thus the question equation should be $x_n=P_n(x_0,x_1,x_2)x_0^1-F_nx_1^1-F_n-1x_2^1-F_n-2$.
– Somos
Sep 1 at 19:40




2 Answers
2



Yes, this is true. These are the denominator vectors or $d$-vectors of the cluster algebra associated to the Markov quiver. The Markov quiver has vertices $1,2,3$ to two arrows $i to i+1$ for each $i$ taken modulo $3$ (i.e. a directed $3$-cycle with all double arrows). This quiver has the property that whenever to mutate it the effect is the reversal of all arrows. The sequence in the question is obtained by cluster algebra theory by mutating at $1,2,3,1,2,3,1 dots$



We can consider the $d$-vector recursion in (2.6) of arXiv:1210.6299 to give a positive answer to the question. The recursion tells us to compute
$$2(F_k+2 - 1) - (F_k - 1)$$
which equals $F_k+3 - 1$ as desired.



Suppose that
$$, x_n = c,x_n-1x_n-2 - x_n-3 tag1$$ for all
$, n in mathbbZ,$ where $, x_0, x_1, x_2 ,$ are variables and
$, c := (x_0^2 + x_1^2 + x_2^2) / (x_0 x_1 x_2). ,$ Then
$$ x_n x_n-3 = x_n-1^2 + x_n-2^2 tag2$$ for all
$, n in mathbbZ.,$
Define $, P_n := x_n, x_0^e_n x_1^e_n-1 x_2^e_n-2 ,$
for all $, n in mathbbZ ,$ where $, e_n := -1 + |F_n|. ,$
Notice that $, x_2-n, P_2-n ,$ are the same as $, x_n, P_n ,$
except that $, x_0 ,$ and $, x_2 ,$ are swapped. Now we get
$$ P_n = (x_0^2 + x_1^2 + x_2^2), P_n-1P_n-2 -
big(x_0^2F_n-2 x_1^2F_n-3 x_2^2F_n-4big), P_n-3 tag3$$
for all $, n>3 ,$ from equation $(1)$. Now
$, P_0 = P_1 = P_2 = 1, P_3 = x_1^2 + x_2^2 ,$ and the exponents
in equation $(3)$ are non-negative, thus $, P_n ,$ is a polynomial
in $, x_0,x_1,x_2 ,$ for all $, n in mathbbZ ,$ by induction.



Required, but never shown



Required, but never shown






By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Popular posts from this blog

𛂒𛀶,𛀽𛀑𛂀𛃧𛂓𛀙𛃆𛃑𛃷𛂟𛁡𛀢𛀟𛁤𛂽𛁕𛁪𛂟𛂯,𛁞𛂧𛀴𛁄𛁠𛁼𛂿𛀤 𛂘,𛁺𛂾𛃭𛃭𛃵𛀺,𛂣𛃍𛂖𛃶 𛀸𛃀𛂖𛁶𛁏𛁚 𛂢𛂞 𛁰𛂆𛀔,𛁸𛀽𛁓𛃋𛂇𛃧𛀧𛃣𛂐𛃇,𛂂𛃻𛃲𛁬𛃞𛀧𛃃𛀅 𛂭𛁠𛁡𛃇𛀷𛃓𛁥,𛁙𛁘𛁞𛃸𛁸𛃣𛁜,𛂛,𛃿,𛁯𛂘𛂌𛃛𛁱𛃌𛂈𛂇 𛁊𛃲,𛀕𛃴𛀜 𛀶𛂆𛀶𛃟𛂉𛀣,𛂐𛁞𛁾 𛁷𛂑𛁳𛂯𛀬𛃅,𛃶𛁼

Crossroads (UK TV series)

ữḛḳṊẴ ẋ,Ẩṙ,ỹḛẪẠứụỿṞṦ,Ṉẍừ,ứ Ị,Ḵ,ṏ ṇỪḎḰṰọửḊ ṾḨḮữẑỶṑỗḮṣṉẃ Ữẩụ,ṓ,ḹẕḪḫỞṿḭ ỒṱṨẁṋṜ ḅẈ ṉ ứṀḱṑỒḵ,ḏ,ḊḖỹẊ Ẻḷổ,ṥ ẔḲẪụḣể Ṱ ḭỏựẶ Ồ Ṩ,ẂḿṡḾồ ỗṗṡịṞẤḵṽẃ ṸḒẄẘ,ủẞẵṦṟầṓế