ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B={0,1}nB=\{0,1\}^n, and let μ\mu be the uniform measure on BtB^t. An intersecting family is a set W⊆{0,1}nW\subseteq\{0,1\}^n such that for every x,y∈Wx,y\in W there is a coordinate ii with xi=yi=1x_i=y_i=1. Let pintersecting(t,n)p_{\mathrm{intersecting}}(t,n) be the maximum of μ(W)\mu(W) over tt-tuples of intersecting families, and let

pintersecting(t):=lim⁡n→∞pintersecting(t,n).p_{\mathrm{intersecting}}(t):=\lim_{n\to\infty}p_{\mathrm{intersecting}}(t,n).

Intersecting-family conjecture. The success probability pintersecting(t)p_{\mathrm{intersecting}}(t) tends to 00 as tt grows. This is stronger than the dictatorship version because every dictatorship is an intersecting family; the paper relates it to the normalized independence number of Hamming powers of Kneser graphs.

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.