Symplectic linear independence conjecture

Let Cm(R3)\mathcal{C}_m(\mathbb{R}^3) consist of tuples x=(x1,,xm)\mathbf{x}=(\mathbf{x}_1,\ldots,\mathbf{x}_m) such that xa0\mathbf{x}_a\neq\mathbf{0} and xa±xb0\mathbf{x}_a\pm\mathbf{x}_b\neq\mathbf{0} for a<ba<b. Set I={1,,m}{1ˉ,,mˉ}I=\{1,\ldots,m\}\cup\{\bar{1},\ldots,\bar{m}\} with order 1<1ˉ<<m<mˉ1<\bar{1}<\cdots<m<\bar{m}, define xa\mathbf{x}_a as given and xaˉ=xa\mathbf{x}_{\bar a}=-\mathbf{x}_a, choose Hopf lifts of all differences xβxα\mathbf{x}_\beta-\mathbf{x}_\alpha, and set pαβ(t)=uαβtvαβp_{\alpha\beta}(t)=u_{\alpha\beta}t-v_{\alpha\beta} and

pα(t)=βI{α}pαβ(t).p_\alpha(t)=\prod_{\beta\in I\setminus\{\alpha\}}p_{\alpha\beta}(t).

Symplectic LIC. The polynomials pαp_\alpha, for αI\alpha\in I, are linearly independent over C\mathbb{C}. This is the symplectic analogue of the Atiyah-Sutcliffe LIC for the root system associated with Sp(m)Sp(m); the source gives no resolution.

Sources & referencesView supporting material

Primary source

Joseph Malkoun, “Root Systems and the Atiyah-Sutcliffe Problem”, arXiv:1903.00325 (2019).

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.