ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pt(n)P_t(n) be the graph whose vertices are the permutations of an nn-set, with two vertices adjacent when the corresponding permutations agree on no more than tt points. Let vSv_S be the characteristic vector of a maximum independent set in P1(n)P_1(n), let 1{\bf1} be the all-ones vector, and define the depth of a partition λ=(λ1,λ2,…,λk)⊢n\lambda=(\lambda_1,\lambda_2,\dots,\lambda_k)\vdash n by n−λ1n-\lambda_1. Module-support conjecture. The vector

vS−∣S∣n!1v_S-\frac{|S|}{n!}{\bf1}

lies in the sum of the modules whose partitions have depth no more than 22, namely

[n],[n−1,1],[n−2,2],[n−2,1,1].[n],\quad [n-1,1],\quad [n-2,2],\quad [n-2,1,1].

The conjecture proposes a representation-theoretic restriction on maximum 2-intersecting permutation families; the source notes agreement of relevant dimensions for n=4,5,6n=4,5,6, but leaves the assertion open.

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.