Optimal stretching for lattice points under convex curves

Sinan Ariturk, Richard S. Laugesen

Research output: Contribution to journalArticlepeer-review


Suppose we count the positive integer lattice points beneath a convex decreasing curve in the first quadrant having equal intercepts. Then stretch in the coordinate directions so as to preserve the area under the curve, and again count lattice points. Which choice of stretch factor will maximize the lattice point count? We show the optimal stretch factor approaches 1 as the area approaches infinity. In particular, when 0 < p < 1, among p-ellipses |sx|p + |s-1y|p = rp with s > 0, the one enclosing the most first-quadrant lattice points approaches a p-circle (s = 1) as r →∞. The case p = 2 was established by Antunes and Freitas, with generalization to 1 < p < ∞ by Laugesen and Liu. The behavior in the borderline case p = 1 (lattice points in right triangles) is quite different, as shown recently by Marshall and Steinerberger.

Original languageEnglish (US)
Pages (from-to)91-114
Number of pages24
JournalPortugaliae Mathematica
Issue number2
StatePublished - 2017


  • Lattice points
  • P-ellipse
  • Planar domain

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Optimal stretching for lattice points under convex curves'. Together they form a unique fingerprint.

Cite this