Parker's factorization and palindromicity conjecture for cyclotomic coordinator polynomials
Parker's factorization and palindromicity conjecture for cyclotomic coordinator polynomials
Let be a positive integer. Write for the squarefree part of , let , and let be the coordinator polynomial of the lattice with respect to the set of all th roots of unity. A degree- polynomial is palindromic when . Parker's conjecture. The coordinator polynomial satisfies
and is a palindromic polynomial of degree . This conjecture is partly proved in the paper: the factorization holds for every positive integer , while the palindromicity assertion is established for several families but remains open in general.
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
Matthias Beck and Serkan Hosten, “Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices”, arXiv:math/0508136 (2006).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.