ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a set family [?][?] and distinct sets A,B(∈A)A,B\begin{pmatrix}\in\mathcal{A}\end{pmatrix}, let peratornameop[?]([?])peratorname{op}[?]([?]) denote the number of pairs whose intersection has odd size. Here 2[n]2^{[n]} is the power set of [n]={1,…,n}[n]=\{1,\ldots,n\}, and [?][?] consists only of even-sized subsets.

Supersaturation conjecture. Let n≥1n\geq 1 and fix 3≤s≤2⌊n/2⌋−2⌊n/4⌋3\leq s\leq 2^{\lfloor n/2\rfloor}-2^{\lfloor n/4\rfloor}. If [?]⊂2[n][?]\subset 2^{[n]} consists of even-sized subsets with ∣[?]∣≥2⌊n/2⌋+s|[?]|\geq 2^{\lfloor n/2\rfloor}+s, then

op⁡(A)≥s⋅2⌊n/2⌋−1.\operatorname{op}(\mathcal{A})\geq s\cdot 2^{\lfloor n/2\rfloor-1}.

The statement extends the paper's proved cases s=1,2s=1,2 and asserts that the described even-town construction remains extremal throughout the indicated range; its status is presented as conjectural in the source.

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.