The conjecture on infinitely many grids with discrepancy 2

At least 3 years old · documented by

Let dnd_n denote the discrepancy associated with the grid of size nn. The discrepancy-2 conjecture. There are infinitely many nn such that dn=2d_n=2. In particular, for all k∈Nk\in\mathbb{N}, d2⋅3k−1=2d_{2\cdot 3^k-1}=2. This parallels Sutner's result that there are infinitely many nn such that dn=0d_n=0; the statement is presented as unproved future work.

References

Primary source

William Boyles, “Resolution to Sutner's Conjecture”, arXiv:2202.09878 (2022).

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.