On the Convex Closure of the Graph of Modular Inversions
From MaRDI portal
Publication:3546255
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,bin �, ab equiv 1 pmod{n}, 1leq a,bleq n-1
ight}. The heuristic is based on an asymptotic formula of R'{e}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 . In this case the numeric results are in much closer agreement with the heuristic, which strongly suggests that the the curve is ``atypical.
Recommendations
Cited in
(6)- On the number of distances between the coordinates of points on modular hyperbolas
- Geometric properties of points on modular hyperbolas
- On a generalisation of a Lehmer problem
- On the convex hull of the points on multivariate modular hyperbolas
- On the convex hull of solutions to polynomial congruences
- Modular hyperbolas
This page was built for publication: On the Convex Closure of the Graph of Modular Inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546255)