On a plane convex arc with a large number of lattice points (Q843555)

\textit{V. Jarník} [Math. Z. 24, 500--518 (1926; JFM 51.0153.01)] showed that a strictly convex arc in the plane of length \(\ell\) contains at most \(3(4\pi)^{-1/3}\ell^{2/3}+o(\ell^{2/3})\) integer lattice points, and that the exponent and constant are best possible. \textit{H. P. F. Swinnerton-Dyer} [J. Number Theory 6, 128--135 (1974; Zbl 0285.10020)] showed the the upper bound may be improved for integer points on the dilation of a fixed curve, if additional smoothness is assumed. He showed that, if \(X\) is a fixed plane curve, strictly convex and \(C^3\), then the number \(N_M=N_M(X)\) of rational points on \(X\) with denominator (dividing) \(M\) is at most \(O_{X,\varepsilon}(M^{3/5+\varepsilon})\). \textit{W. M. Schmidt} [Monatsh. Math. 99, 45--72 (1985; Zbl 0551.10026)] gave a uniform version of this result. The question arises what is the best possible upper bound for \(N_M\) for a strictly convex \(X\). Work of \textit{A. Plagne} [Acta Arith 87, 255--267 (1999; Zbl 0924.11084)] and \textit{F. V. Petrov} [Funct. Anal. Appl. 40, No. 1, 24--33 (2006); translation from Funkts. Anal. Prilozh. 40, No. 1, 30--42 (2006; Zbl 1152.11030)] shows that \(N_M=o(M^{2/3})\). In this paper the author constructs a continuous, decreasing, strictly convex arc with \(N_M\geq M^{\log 2/\log 3}\). Note that \(\log 2/\log 3 > 0.639\).