Denominator-matrix recursion for source-sink moves

Let t0\[0.4em]\[0.2em]kt1\begin{matrix}t_0\[-0.4em]\[-0.2em]\end{matrix}\xrightarrow{k}t_1 be an edge in the nn-regular tree Tn\mathbb{T}_n, and let B1=μk(B0)B_1=\boldsymbol{\mu_k}(B_0). Assume that all entries in row kk of B0B_0 weakly agree in sign. Let DtB0;t0D_t^{B_0;t_0} and DtB1;t1D_t^{B_1;t_1} denote the corresponding denominator matrices, JkJ_k the matrix associated with mutation in direction kk, and []+[\,\cdot\,]_+ the entrywise positive-part operation. Define B0k|B_0^{k\bullet}| as the entrywise absolute value of row kk of B0B_0.

Source-sink denominator recursion conjecture.

DtB1;t1=JkDtB0;t0+[B0kDtB0;t0]+.D_t^{B_1;t_1}=J_kD_t^{B_0;t_0}+\bigl[|B_0^{k\bullet}|D_t^{B_0;t_0}\bigr]_+.

This is presented as an explicit form of the initial-seed denominator-vector recursion for source-sink moves. The source gives no evidence that it has been resolved.

Sources & referencesView supporting material

Primary source

Nathan Reading and Salvatore Stella, “Initial-seed recursions and dualities for d-vectors”, arXiv:1409.4723 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.