ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let 4Sn44\mathfrak{S}_n4 be the symmetric group on nn symbols. For 4τ∈Sk44\tau\in\mathfrak{S}_k4 and 4σ∈Sn44\sigma\in\mathfrak{S}_n4, let 4Xτ(σ)44\mathbf{X}^{\tau}(\sigma)4 count the occurrences of the pattern 4τ44\tau4 in 4σ44\sigma4. Call 4σ44\sigma4 kk-symmetric when 4Xτ(σ)=Xτ′(σ)44\mathbf{X}^{\tau}(\sigma)=\mathbf{X}^{\tau'}(\sigma)4 for all 4τ,τ′∈Sk44\tau,\tau'\in\mathfrak{S}_k4. Let 4alldiv⁡k(n)44\operatorname{alldiv}_k(n)4 mean that 4div⁡j(n)44\operatorname{div}_j(n)4 holds for every 4j=1,…,k44j=1,\ldots,k4, where 4div⁡j(n)44\operatorname{div}_j(n)4 means 4j!∣(nj)44j!\mid\binom{n}{j}4. Existence conjecture for symmetric permutations. If 4alldiv⁡k(n)44\operatorname{alldiv}_k(n)4, then there exists a kk-symmetric permutation on nn symbols. The divisibility condition is necessary because each of the 4k!44k!4 patterns must occur equally often. The conjecture asks whether this necessary condition is sufficient; the paper notes that the first nontrivial unresolved search in the case 4k=444k=44 occurs at 4n=6444n=644.

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.