Legendre-symbol triangulation polynomial congruence

From papers

Let pp be an odd prime, and let Ep+E_p^+ and EpE_p^- be the convex (p+1)(p+1)-near-edges associated respectively to the sequences of Legendre symbols and their negatives. Let pEp+p_{E_p^+} and pEpp_{E_p^-} denote their maximal triangulation polynomials. For a polynomial P(t)P(t) of the form

tpEp+2,tpEp2,ortpEp+pEp,t p_{E_p^+}^2,\qquad t p_{E_p^-}^2,\qquad\text{or}\qquad t p_{E_p^+}p_{E_p^-},

and with GC(t)G_C(t) and the pairing  t\langle\,\ \rangle_t defined as in the source's formulas, Legendre-symbol triangulation polynomial conjecture.

P(t),t2GC(t)t(1p)(modp)={1p1(mod4),1p3(mod4).\langle P(t),t^2G_C(t)\rangle_t\equiv\left(\frac{-1}{p}\right)\pmod p =\begin{cases}1& p\equiv1\pmod4,\\-1& p\equiv3\pmod4. \end{cases}

This conjecture concerns congruences detected by maximal triangulation polynomials of near-edges constructed from Legendre symbols. The source reports computational evidence for all odd primes p<200p<200, but provides no proof or later resolution in the supplied material.

Progress summary

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

Sources & referencesView supporting material

Primary source

Roland Bacher and Frédéric Mouton, “Triangulations of nearly convex polygons”, arXiv:1012.2206 (2010).

Solutions 0

No solutions have been posted yet.