On the Convex Closure of the Graph of Modular Inversions

From MaRDI portal
Publication:3546255

DOI10.1080/10586458.2008.10129021zbMATH Open1234.11005arXiv0711.4100OpenAlexW2033061148MaRDI QIDQ3546255FDOQ3546255


Authors: Christian L. Yankov, Mizan R. Khan, Igor E. Shparlinski Edit this on Wikidata


Publication date: 18 December 2008

Published in: Experimental Mathematics (Search for Journal in Brave)

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 mathbbZn. In this case the numeric results are in much closer agreement with the heuristic, which strongly suggests that the the curve xy=1pmodn is ``atypical.


Full work available at URL: https://arxiv.org/abs/0711.4100




Recommendations





Cited In (6)





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)