The divisibility conjecture for morphisms of n-circular bayonet codes

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 djn\overline{dj}^{n} denote the representative of djdj modulo nn. Define

φd(X):={aibadjn such that aibajX}.\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.

Sources & referencesView supporting material

Primary source

Christophe Cordero, “Factorizations of Cyclic Groups and Bayonet Codes”, arXiv:2301.13566 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.