ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H\mathcal H be an nn-uniform linear hypergraph with nn edges. For each pair of indices 1≤i<k≤n1\leq i<k\leq n, let Φi,k(x)\Phi_{i,k}(\mathbf{x}) 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 n−1n-1.

Nonzero-coefficient conjecture. One can choose the identifier spanning trees in a way that there is a Vandermonde-completable monomial with nonzero coefficient in

∏i<kΦi,k(x).\prod_{i<k}\Phi_{i,k}(\mathbf{x}).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.