ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group, let ρ\rho be a permutation representation of GG, and let P(ρ)P(\rho) be its permutation polytope. Set

d:=dim P(ρ).d:={\rm dim \,} P(\rho).

Two permutation representations are stably equivalent when they differ by the stabilization relation used in the paper.

Stable-degree conjecture. There exists a stably equivalent permutation representation ρ′ ⁣:G→Sn\rho'\colon G\to S_n such that

n≤2d.n\leq 2d.

The statement was checked for d≤4d\leq 4 in the paper and would imply the weak part of the strong embedding conjecture. Its general validity remains 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.