Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

The number of configurations in lattice point counting II

Huxley, Martin Neil and Zunic, Jovisa 2013. The number of configurations in lattice point counting II. Proceedings of the London Mathematical Society 107 (6) , pp. 1331-1352. 10.1112/plms/pdt011

Full text not available from this repository.


A convex plane set S is discretized by first mapping the centre of S to a point (u, v), preserving orientation, enlarging by a factor t to obtain the image S(t, u, v) and then taking the discrete set J(t, u, v) of integer points in S(t, u, v). Let N(t, u, v) be the size of the ‘configuration’ J(t, u, v). Let L(N) be the number of different configurations (up to equivalence by translation) of size N(t, u, v) = N and let M(N) be the number of different configurations with 1 ≤ N(t, u, v) ≤ N. Then L(N) ≤ 2N−1, M(N) ≤ N2, with equality if S satisfies the Quadrangle Condition, that no image S(t, u, v) has four or more integer points on the boundary. For the circle, which does not satisfy the Quadrangle Condition, we expect that L(N) should be asymptotic to 2N, despite the numerical evidence.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Additional Information: Online publication date: 21 June 2013.
Publisher: Oxford University Press
ISSN: 0024-6115
Last Modified: 04 Jun 2017 05:09

Citation Data

Cited 3 times in Google Scholar. View in Google Scholar

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item