Markoff triples and strong approximation
Author(s): Bourgain, Jean; Gamburd, Alexander; Sarnak, Peter C
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr17x0c
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bourgain, Jean | - |
dc.contributor.author | Gamburd, Alexander | - |
dc.contributor.author | Sarnak, Peter C | - |
dc.date.accessioned | 2018-07-20T15:11:16Z | - |
dc.date.available | 2018-07-20T15:11:16Z | - |
dc.date.issued | 2016-02 | en_US |
dc.identifier.citation | Bourgain, Jean, Gamburd, Alexander, Sarnak, Peter. (2016). Markoff triples and strong approximation. COMPTES RENDUS MATHEMATIQUE, 354 (131 - 135. doi:10.1016/j.crma.2015.12.006 | en_US |
dc.identifier.issn | 1631-073X | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr17x0c | - |
dc.description.abstract | We investigate the transitivity properties of the group of morphisms generated by Vieta involutions on the solutions in congruences to the Markoff equation as well as to other Markoff type affine cubic surfaces. These are dictated by the finite (Q) over bar orbits of these actions and these can be determined effectively. The results are applied to give forms of strong approximation for integer points, and to sieving, on these surfaces. (C) 2016 Published by Elsevier Masson SAS on behalf of Academie des sciences. | en_US |
dc.format.extent | 131 - 135 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | COMPTES RENDUS MATHEMATIQUE | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Markoff triples and strong approximation | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | doi:10.1016/j.crma.2015.12.006 | - |
dc.date.eissued | 2016-01-26 | en_US |
dc.identifier.eissn | 1778-3569 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1505.06411.pdf | 142.27 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.