ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (M,d)(M,d) be a unicorn space with unicorn sequence {Ci}\{C_i\}, nontrivial isometry group GG, and symmetry strength t∈[0,∞)t\in[0,\infty). Partial-symmetry conjecture. There exists an i0i_0 such that for every i>i0i>i_0, if CC is an optimal code in (M,d)(M,d) of size ∣Ci∣−1|C_i|-1, then there exists g∈G∖{id⁡}g\in G\setminus\{\operatorname{id}\} for which

∣gC∩C∣>t.|gC\cap C|>t.

The conjecture predicts that deleting one point from sufficiently large uniquely optimal codes leaves a code with a nontrivial partial symmetry. The supplied text presents it as an open generalization of examples from distance geometry and coding theory.

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.