ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BnB_n denote the Boolean lattice of subsets of an nn-element set, and let VV be the three-element poset with elements a,b,ca,b,c and relations a<ba<b and a<ca<c. Let M1(V,n)M_1(V,n) be the maximum number of pairwise incomparable copies of VV in BnB_n. The construction described above consists of copies indexed by 1≤i≤⌊n+24⌋1\leq i\leq \left\lfloor {n+2\over 4}\right\rfloor, with the iith level contributing

(n−2i⌈n2⌉−2i+1){n-2i\choose \left\lceil {n\over 2} \right\rceil -2i+1}

copies. Extremal incomparable-copy conjecture. The maximum number of pairwise incomparable copies of VV in BnB_n is

M1(V,n)=∑i=1⌊n+24⌋(n−2i⌈n2⌉−2i+1).M_1(V,n)=\sum_{i=1}^{ \left\lfloor {n+2\over 4}\right\rfloor }{n-2i\choose \left\lceil {n\over 2} \right\rceil -2i+1}.

The displayed construction gives the lower bound, and the conjecture asserts that no larger collection of pairwise incomparable copies exists. The source provides no resolution, so the conjecture remains 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.