← All problems

Schmutz Schaller's counting-function conjecture for square and hexagonal lattices

24 years old · traced to

For j≥1j\geq 1, let bj(n)=1b_j(n)=1 if nn is represented by X2+jY2X^2+jY^2, and bj(n)=0b_j(n)=0 otherwise. Define

Bi(x)=∑n≤xbi(n),i∈{1,3}.B_i(x)=\sum_{n\leq x}b_i(n),\qquad i\in\{1,3\}.

Schmutz Schaller's counting-function conjecture. For every xx, one has

B1(x)≥B3(x).B_1(x)\geq B_3(x).

This is an equivalent reformulation of the square-versus-hexagonal lattice conjecture. The paper proves the inequality for every xx, so the conjecture is solved.

References
  1. Pieter Moree and Herman J. J. te Riele, “The hexagonal versus the square lattice”, arXiv:math/0204332 (2002).

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.