ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a triangulation of the partition simplex Δn−1\Delta^{n-1}, and let L:Vert⁡(T)→2[n]L:\operatorname{Vert}(T)\to 2^{[n]} be a consistent labeling of TT. A triangulation is friendly when it has the ownership structure required for the labeling LL in the paper, and a labeling is single-valued when it assigns one element of [n][n] to each vertex.

Permutation-degree conjecture. The labeling LL induces a single-valued labeling ℓ:Vert⁡(T)→[n]\ell:\operatorname{Vert}(T)\to [n] such that

bdeg⁡(ℓ)≢0(modn).\operatorname{bdeg}(\ell)\not\equiv 0\pmod n.

This conjecture is the extension to n>3n>3 of the lemma used to prove the existence of connected envy-free divisions for three selective agents. Establishing it would extend the combinatorial argument to more agents; the paper states that the authors could not prove it for n>3n>3.

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.