Characteristic-polynomial conjecture for parameter matrices of hypergraph transversals
Characteristic-polynomial conjecture for parameter matrices of hypergraph transversals
Let be the parameter matrix of a -transversal in a -uniform -regular hypergraph . Let be a -th primitive root of unity. Characteristic-polynomial conjecture. The characteristic polynomial of is
The preceding result identifies the eigenvalues of the parameter matrix; this conjecture further specifies their algebraic multiplicities through the characteristic polynomial. The source also notes the belief that all nonzero eigenvalues have the same algebraic multiplicity, but provides no resolution of the conjecture.
Sources & referencesView supporting material
Primary source
Anna A. Taranenko, “Perfect colorings of hypergraphs”, arXiv:2208.03447 (2024).
Additional references
2 papers in this index state this conjecture (2017–2022). The statement above is taken from the most recent of them; the others are arXiv:1705.03709.
Progress summary
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.