English

Lattice Size of Plane Convex Bodies

Combinatorics 2020-10-08 v4 Algebraic Geometry

Abstract

The lattice size lsΔ(P)\operatorname{ls}_{\Delta}(P) of a lattice polygon PP with respect to the standard simplex Δ\Delta was introduced and studied by Castryck and Cools in the context of simplification of the defining equation of an algebraic curve. Earlier, Schicho provided an "onion skins" algorithm for mapping a lattice polygon PP into a small integer multiple of the standard simplex, based on passing successively to the convex hull of the interior lattice points of PP. Castryck and Cools showed that this algorithm computes the lattice size of PP. In this paper we show that for a plane convex body PP a reduced basis of Z2\mathbb{Z}^2 computes the lattice size. This provides a lattice reduction algorithm for computing the lattice size, which works for any convex body PR2P\subset\mathbb{R}^2 and outperforms the "onion skins" algorithm in the case when PP is a lattice polygon.

Keywords

Cite

@article{arxiv.1709.03454,
  title  = {Lattice Size of Plane Convex Bodies},
  author = {Anthony Harrison and Jenya Soprunova and Patrick Tierney},
  journal= {arXiv preprint arXiv:1709.03454},
  year   = {2020}
}

Comments

The main result and the arguments have been reformulated in terms of lattice reduction. The results now apply to arbitrary convex bodies in $\mathbb{R}^2$, rather than lattice polygons as in the previous version