ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, and let Fixed(σ)\mathrm{Fixed}(\sigma) denote the set of fixed points of σ\sigma. A family F⊂SnF\subset S_n is tt-intersecting if any two of its permutations agree on at least tt points. For n,t,rn,t,r with n∈Nn\in\mathbb N, 1≤t≤n1\leq t\leq n, define

Fn,t,r={σ∈Sn:∣Fixed(σ)∩{1,2,…,t+2r}∣≥t+r}.\mathcal F_{n,t,r}=\{\sigma\in S_n:|\mathrm{Fixed}(\sigma)\cap\{1,2,\ldots,t+2r\}|\geq t+r\}.

Ellis–Friedgut–Pilpel conjecture. For any n∈Nn\in\mathbb N and 1≤t≤n1\leq t\leq n, the maximum size of a tt-intersecting family in SnS_n is attained by one of the families Fn,t,r\mathcal F_{n,t,r}. In particular, for all t<n/2t<n/2, the maximum is attained by the tt-umvirate

Fn,t,0={σ∈Sn:Fixed(σ)⊃[t]}.\mathcal F_{n,t,0}=\{\sigma\in S_n:\mathrm{Fixed}(\sigma)\supset [t]\}.

Furthermore, every maximum-sized tt-intersecting family is a double translate τ1Fn,t,rτ2\tau_1\mathcal F_{n,t,r}\tau_2 for some rr and some τ1,τ2∈Sn\tau_1,\tau_2\in S_n. The source presents this as a daring conjecture after noting earlier partial results; the supplied status is unknown.

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.