Divisibility by a binomial power of the first Gram determinant

Let GnG_n be the Gram matrix in the paper, and let divisibility be taken in its polynomial ring. The first-determinant divisibility conjecture. For every integer n1n\geq 1,

(detG1)(2nn1)detGn.(\det G_1)^{\binom{2n}{n-1}}\mid \det G_n.

The conjecture is motivated by computed low-dimensional cases and is offered as part of the paper's proposed factorization pattern; the source gives no proof or subsequent resolution.

Sources & referencesView supporting material

Primary source

Jozef H. Przytycki and Xiaoqi Zhu, “Gram determinant of planar curves”, arXiv:0810.4649 (2008).

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.