Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the new bound for the number of solutions of polynomial equations in subgroups and the structure of graphs of Markoff triples

Published 14 Nov 2017 in math.NT | (1711.05335v2)

Abstract: We sharpen the bounds of J. Bourgain, A. Gamburd and P. Sarnak (2016) on the possible number of nodes outside the "giant component" and on the size of individual connected components in the suitably defined functional graph of Markoff triples modulo $p$. This is a step towards the conjecture that there are no such nodes at all.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.