Polynomial-time computation of fixed points and spectral norms for nonsingular symmetric tensors

Fix nNn\in\mathord{\mathbb N} with 2<n2<n, and let SSdCn{\cal S}\in\mathrm{S}^d\mathord{\mathbb C}^n be nonsingular. Let H\mathbf H denote the polynomial map whose fixed points are used to compute the spectral norm of S{\cal S}. Nonsingular fixed-point computation conjecture. With probability 11, all fixed points of H\mathbf H can be found within ε\varepsilon approximation in time polynomial in dd; in particular, Sσ\|{\cal S}\|_{\sigma} can be computed within ε\varepsilon approximation in time polynomial in dd, with probability 11. The conjecture arises from applying homotopy methods to the (d1)2n(d-1)^{2n} fixed points associated with a nonsingular tensor. It remains open in the supplied text.

Sources & referencesView supporting material

Primary source

Shmuel Friedland and Li Wang, “Geometric measure of entanglement of symmetric d-qubits is polynomial-time computable”, arXiv:1608.01354 (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.