ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥1n\geq1, let QnQ_n be the nn-dimensional hypercube and let pmd(Qn)\mathrm{pmd}(Q_n) denote its positive matching decomposition number. Hypercube formula.

pmd(Qn)=2n−1,\mathrm{pmd}(Q_n)=2n-1,

for all n≥1n\geq1. The source presents this assertion in a conjecture environment immediately after proving the upper bound pmd(Qn)≤2n−1\mathrm{pmd}(Q_n)\leq2n-1, but the supplied text gives no evidence that the lower bound or the equality has been resolved.

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.