ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N(k)\mathbb{N}^{(k)} denote the family of kk-element subsets of N\mathbb{N}. For a family A\mathcal{A} of sets, write ⟨A⟩\langle\mathcal{A}\rangle for the union of the upward closures of its members. Define the max-lex order on N(k)\mathbb{N}^{(k)} by declaring A<BA<B if either max⁡A<max⁡B\max A<\max B, or max⁡A=max⁡B\max A=\max B and min⁡(A△B)∈A\min(A\mathbin{\triangle}B)\in A. Roberts's conjecture. Let k∈Nk\in\mathbb{N} and let A⊂N(k)\mathcal{A}\subset\mathbb{N}^{(k)}. If B\mathcal{B} is the initial segment of max-lex order on N(k)\mathbb{N}^{(k)} with ∣B∣=∣A∣|\mathcal{B}|=|\mathcal{A}|, then

∣⟨A⟩∣≥∣⟨B⟩∣.|\langle\mathcal{A}\rangle|\geq |\langle\mathcal{B}\rangle|.

This conjecture proposes the extremal ordering for all family sizes, extending the partial results discussed in the paper; the supplied source gives no resolution.

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.