ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 2[n]2^{[n]} denote the Boolean lattice of subsets of [n]={1,…,n}[n]=\{1,\ldots,n\}, and let a chain be a subset whose elements are pairwise comparable by inclusion. For a positive integer nn, set

l=⌊2n(n⌊n/2⌋)⌋.l=\left\lfloor\frac{2^n}{\binom{n}{\lfloor n/2\rfloor}}\right\rfloor.

Füredi's conjecture. For every positive integer nn, the Boolean lattice 2[n]2^{[n]} can be partitioned into (n⌊n/2⌋)\binom{n}{\lfloor n/2\rfloor} chains such that the size of each chain is ll or l+1l+1.

If true, this would give a partition into chains of size (π/2+o(1))n(\sqrt{\pi/2}+o(1))\sqrt n. The conjecture remains open; a weaker result gives a partition into the same number of chains whose sizes lie between 0.8n0.8\sqrt n and 25n25\sqrt n.

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.