Multiplicative reduction conjecture for the toroidal covering parameter

Let nn be an odd positive integer, and let ξ(n)\xi(n) denote the toroidal covering parameter. Multiplicative reduction conjecture.

ξ(n)=min{nmξ(m):m divides n}.\xi(n)=\min\left\{\frac{n}{m}\xi(m): m\text{ divides }n\right\}.

This conjecture proposes an exact reduction of the odd case to divisors of nn, complementing the paper's product upper bound. The paper gives no resolution and notes that few values of ξ(n)\xi(n) are known for odd nn.

Sources & referencesView supporting material

Primary source

João Paulo Costalonga, “Toroidal boards and code covering”, arXiv:1510.08413 (2019).

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.