The divisibility conjecture for morphisms of n-circular bayonet codes
Statement
Let an -cbc be a bayonet code of the type defined in the source, and let be an integer prime to . For integers , let denote the representative of modulo . Define
Divisibility conjecture for n-circular bayonet codes. For any -cbc and any prime to , the set is an -cbc.
The source says that this conjecture was proposed in earlier work and places it in the study of divisibility conditions for an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.