Stable-degree conjecture for permutation representations
Statement
Let be a finite group, let be a permutation representation of , and let be its permutation polytope. Set
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 such that
The statement was checked for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.