On the Convex Closure of the Graph of Modular Inversions

Abstract

In this paper we give upper and lower bounds as well as a heuristic estimate on the number of vertices of the convex closure of the set $$G_n=\left\{(a,b):a,b\in \mathbb{Z},ab\equiv 1(\mathrm{mod}n),1\le a,b\le n-1\right\}.$$ The heuristic is based on an asymptotic formula of Rényi and Sulanke. After describing two algorithms to determine the convex closure, we compare the numeric results with the heuristic estimate. The numeric results do not agree with the heuristic estimate -- there are some interesting peculiarities for which we provide a heuristic explanation. We then describe some numerical work on the convex closure of the graph of random quadratic and cubic polynomials over ${\mathbb{Z}}_n$. In this case the numeric results are in much closer agreement with the heuristic, which strongly suggests that the the curve $xy=1(\mathrm{mod}n)$ is ``atypical''.

33 pages, 14 figures

Cited by in corpus (1)

• On a Generalisation of a Lehmer Problem