Odd-length linear equations are uncommon over the integers

About 2 years old · traced to

Let k≥3k\geq 3 be odd, and let a1,…,ak∈Z∖{0}a_1,\ldots,a_k\in\mathbb{Z}\setminus\{0\}. Consider the equation

a1x1+⋯+akxk=0.a_1x_1+\cdots+a_kx_k=0.

Call the equation uncommon over the integers when there is a 2-coloring of [n][n] with fewer monochromatic solutions than a uniformly random 2-coloring.

Odd-length uncommonness conjecture. The equation is uncommon over the integers.

The claim appears in the paper's further remarks as a plausible general statement; no resolution is supplied in the provided text, so it remains open in this record.

References

Primary source

Dingding Dong, Nitya Mani, Huy Tuan Pham and Jonathan Tidor, “On monochromatic solutions to linear equations over the integers”, arXiv:2410.13758 (2024).

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.