The integer hull of the set $\{(x,y)\in \mathbb{R}^2: xy\ge N\}$
Antal Balog, Imre B\'ar\'any

TL;DR
This paper investigates the structure of the integer convex hull of the set defined by the inequality xy ≥ N, revealing that the number of vertices and the area of the non-included region grow roughly as N^{1/3} log N, refining previous bounds.
Contribution
It establishes new bounds on the number of vertices and the area of the difference between the set and its integer convex hull, improving recent results by Alcántara et al.
Findings
Number of vertices of the integer hull is of order N^{1/3} log N.
Area of the non-included region in a specific square is of order N^{1/3} log N.
Provides tighter asymptotic bounds on the structure of the integer hull.
Abstract
The integer convex hull of the set is the convex hull of the lattice points in . The vertices of lie in the square . Improving on a recent result of Alc\'antara et al. ~\cite{Santos} we show that the number of vertices of is of order . We also show that the area of the part of that lies in the square is also of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Point processes and geometric inequalities · Mathematical Dynamics and Fractals
