Nonzero-coefficient conjecture for the Combinatorial Nullstellensatz framework
Statement
Let be an -uniform linear hypergraph with edges. For each pair of indices , let be the polynomial defined from the chosen identifier spanning trees, and let a Vandermonde-completable monomial mean a monomial corresponding to an orientation whose base cliques can be oriented as transitive tournaments with every total in-degree at most .
Nonzero-coefficient conjecture. One can choose the identifier spanning trees in a way that there is a Vandermonde-completable monomial with nonzero coefficient in
The conjecture is the missing algebraic step in the paper's approach to the Erdős–Faber–Lovász conjecture. The corresponding existence of Vandermonde-completable orientations is proved, but the required nonvanishing of the coefficient sum is left open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.