The s=3s=3 covering-system asymptotic conjecture

Let R(s,q)R(s,q) denote the minimum size of a covering system of vectors over ZsqZ_s^q. In particular, consider the case s=3s=3 as qq tends to infinity. The s=3s=3 asymptotic conjecture.

R(3,q)=Θ(2q/q).R(3,q)=\Theta(2^q/\sqrt{q}).

The source gives a lower bound of order 2q/q2^q/\sqrt{q} for R(3,q)R(3,q) and notes that this conjecture would make that lower bound essentially optimal; proving the matching upper bound remains open.

Sources & referencesView supporting material

Primary source

Noga Alon and Ryan Alweiss, “On the product dimension of clique factors”, arXiv:1905.10483 (2020).

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.