Y-system and functional dilogarithm identities

수학노트
imported>Pythagoras0님의 2013년 7월 14일 (일) 13:27 판
둘러보기로 가기 검색하러 가기

introduction

  • Bloch group element

$$ \sum_{(\mathbf{i},u)\in S_{+}} Y_{\mathbf{i}}(u)\wedge (1+Y_{\mathbf{i}}(u))=0\in \Lambda^2 \mathbb{Q}(y)^{\times} $$ where $S_{+}=\{(\mathbf{i},u) |0\leq u \leq 2(h+h')-1,(\mathbf{i},u)\in P_{+}\}$.

  • functional dilogarithm identity

$$ \sum_{(\mathbf{i},u)\in S_{+}}L\left(\frac{Y_\mathbf{i}(u)}{1+Y_\mathbf{i}(u)}\right)=h r r' L(1) $$


bicoloring

  • what's $P_{+}$?
  • We give an alternate bicoloring on the pair of Dynkin diagrams. Let us fix bipartite decompositions of $I$ and $I'$.
  • Let $ \mathbf{I}= I\times I'$ and $\mathbf{I}=\mathbf{I}_{+}\sqcup \mathbf{I}_{-}$ where $\mathbf{I}_{+}=(I_{+}\times I'_{+}) \sqcup (I_{-}\times I'_{-})$ and $\mathbf{I}_{-}=(I_{+}\times I'_{-}) \sqcup (I_{-}\times I'_{+})$.
  • Let $\epsilon : \mathbf{I}\to \{1,-1\}$ be the function defined by $\epsilon(\mathbf{i})=\pm 1$ for $\mathbf{i}\in \mathbf{I}_{\pm}$ and $P_{\pm} =\{(\mathbf{i},u)\in \mathbf{I}\times\mathbb{Z}| \epsilon(\mathbf{i})(-1)^u=\pm 1\}$.
  • Roughly speaking, we want our alternate bicoloring interchanges their colors as $u\in \mathbb{Z}$ changes by 1.


length of diagonals

 

  1. A := RecurrenceTable[{a[n] a[n - 2] + 1 == a[n - 1]^2, a[1] == x,
       a[2] == y}, a, {n, 10}]
    Simplify[A]
  • Laurent phenomenon is true
  • total positivity is broken
  • 정오각형의 경우
  • \(r_i^2=1+r_{i-1}r_{i+1}\), \(r_0=1,r_3=1\)
  • 3가지 점화식의 해가 존재
  • \(\{1,-1,0,1\}\), \(\{1,\frac{-\sqrt{5}+1}{2},\frac{-\sqrt{5}+1}{2},1 \}\) , \(\{1,\frac{\sqrt{5}+1}{2},\frac{\sqrt{5}+1}{2},1 \}\)

 

  1. A := RecurrenceTable[{a[n] a[n - 2] + 1 == a[n - 1]^2, a[1] == 1,
       a[2] == 2 y}, a, {n, 10}]
    Simplify[A]
    NSolve[-4 y + 8 y^3 == 1, y]
    {1, 2 y, -1 + 4 y^2, -4 y + 8 y^3,
       1 - 12 y^2 +
        16 y^4} /. {{y -> -0.5`}, {y -> -0.30901699437494745`}, {y ->
         0.8090169943749475`}} // TableForm

 

 

 

total positivity

  • \(r_{i-1}r_{i+1}=r_i^2+1\)
  1. A := RecurrenceTable[{a[n] a[n - 2] - 1 == a[n - 1]^2, a[1] == x,
       a[2] == y}, a, {n, 10}]
    Simplify[A]

 

 

relation to 5-term relation

 

 

five-term relation of dilogarithm

 

  1. f[{x_, y_, z_, w_}] := Simplify[(x - z)/(x - w)*(y - w)/(y - z)]
    A := Permutations[{0, 1, w, z}]
    Table[Limit[f[Ai], w -> \[Infinity]], {i, 24}]
    B := Subsets[{0, x*y, 1, y, z}, {4}]
    g[i_] := Table[
      Limit[f[n], z -> \[Infinity]], {n, Permutations[Bi]}]
    Table[f[Bi], {i, 1, 5}]
    Table[g[i], {i, 5}]

 


rank 2 example

\(y_{m-1}y_{m+1}=y_m+1\)

Start with two variables \(y_1,y_2\).

\(y_3y_1=y_2+1\). so \(y_3=\frac{y_2+1}{y_1}\)

\(y_2y_4=y_3+1 \)implies \(y_4=\frac{y_3+1}{y_2}=\frac{y_1+y_2+1}{y_1y_2}\)

\(y_3y_5=y_4+1\) implies \(y_5=\frac{y_4+1}{y_3}= \frac{y_1+1}{y_2}\) we are getting Laurent polynomials

\(y_4y_6=y_5\) implies \(y_6=\frac{y_5+1}{y_4}= \frac{\frac{y_1+1}{y_2}+1}{\frac{y_1+y_2+1}{y_1y_2}}=\frac{y_1(y_1+1)+y_1y_2}{y_1+y_2+1}=y_1\)


 

history

 

 

related items

 

 

expositions

 

 

articles