ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, and let S⊆[n]3S\subseteq[n]^3 be a set that meets every line at most once. Write Sˉ\bar{S} for the closure of SS under the closure operation considered in the paper.

Closure-size conjecture. There are constants c1,c2>0c_1,c_2>0 such that, if

∣S∣≥n2(log⁡log⁡n)c1,|S|\geq\frac{n^2}{(\log\log n)^{c_1}},

then

∣Sˉ∣≥n3(log⁡log⁡n)c2.|\bar{S}|\geq\frac{n^3}{(\log\log n)^{c_2}}.

Non-trivial lower bounds on the closure size would improve the lower bounds on χ3(n,n){\chi}_3(n,n); the surrounding discussion indicates that this remains open, with only weak bounds known for higher dimensions.

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.