Palindromicity conjecture for recurrence polynomials
Palindromicity conjecture for recurrence polynomials
Let be a vertex in a classified -system outside the tensor-product case with finite factor of type , , or , and let be its recurrence polynomial. The palindromicity conjecture. The recurrence polynomial is palindromic. This is the complementary case to the Dynkin-involution reciprocity conjecture and is not resolved in the source.
Sources & referencesView supporting material
Primary source
Pavel Galashin and Pavlo Pylyavskyy, “Quivers with subadditive labelings: classification and integrability”, arXiv:1606.04878 (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
Sign in to submit a solution.
No solutions have been posted yet.