ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an nn-cbc XX be a bayonet code of the type defined in the source, and let dd be an integer prime to nn. For integers d,j,nd,j,n, let dj‾n\overline{dj}^{n} denote the representative of djdj modulo nn. Define

φd(X):={aibadj‾n such that aibaj∈X}.\varphi_d(X):=\left\{a^i b a^{\overline{dj}^{n}}\text{ such that }a^i b a^j\in X\right\}.

Divisibility conjecture for n-circular bayonet codes. For any nn-cbc XX and any dd prime to nn, the set φd(X)\varphi_d(X) is an nn-cbc.

The source says that this conjecture was proposed in earlier work and places it in the study of divisibility conditions for an nn-cbc containing a given bayonet code. No resolution is supplied in the provided text.

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.