ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H=(V,E)H=(V,E) be a 33-uniform hypergraph with nn vertices. Quadratic bound conjecture. Its pair-matching decomposition number satisfies

pmd⁡(H)≤32n2−152n+10.\operatorname{pmd}(H)\leq \frac{3}{2}n^2-\frac{15}{2}n+10.

This bound would follow from the preceding positive-matching conjecture and would give bounds for the irreducibility of coordinate sections of symmetric tensor varieties. The source states it as an unproved conjecture.

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.