The covering-system asymptotic conjecture
The covering-system asymptotic conjecture
Let denote the minimum size of a covering system of vectors over . In particular, consider the case as tends to infinity. The asymptotic conjecture.
The source gives a lower bound of order for 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
Sign in to submit a solution.
No solutions have been posted yet.