The divisibility conjecture for morphisms of n-circular bayonet codes
The divisibility conjecture for morphisms of n-circular bayonet codes
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.
Sources & referencesView supporting material
Primary source
Christophe Cordero, “Factorizations of Cyclic Groups and Bayonet Codes”, arXiv:2301.13566 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.