The Solomon–Terao palindromicity conjecture for free arrangements

Let A{\mathcal{A}} be a hyperplane arrangement in a vector space of dimension \ell, and let Ψ(A;x,t)\Psi({\mathcal{A}};x,t) denote its Solomon–Terao polynomial. A polynomial is palindromic when its coefficients are symmetric. The Solomon–Terao palindromicity conjecture. The arrangement A{\mathcal{A}} is free if and only if Ψ(A;x,1)\Psi({\mathcal{A}};x,-1) is palindromic; equivalently, there exist d1,,dd_1,\ldots,d_\ell such that

Ψ(A;x,1)=i=11xdi+11x.\Psi({\mathcal{A}};x,-1)=\prod_{i=1}^\ell \frac{1-x^{d_i+1}}{1-x}.

This is presented as a second open problem related to Solomon–Terao polynomials; the supplied text gives no resolution.

Sources & referencesView supporting material

Primary source

Takuro Abe, “Addition-deletion theorems for the Solomon-Terao polynomials and B-sequences of hyperplane arrangements”, arXiv:2305.10283 (2023).

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.