The exponent for the Markov-Hurwitz equations (Q1366626): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2140/pjm.1998.182.1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2048858343 / rank | |||
Normal rank |
Latest revision as of 23:32, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The exponent for the Markov-Hurwitz equations |
scientific article |
Statements
The exponent for the Markov-Hurwitz equations (English)
0 references
16 September 1997
0 references
We study the Markoff-Hurwitz equations \(x_0^2+\dots+ x_n^2= ax_0\cdots x_n\). The variety \(V\) defined by this equation admits a group of automorphisms \({\mathcal A}\cong \mathbb{Z}/2*\cdots* \mathbb{Z}/2\) (an \(n+1\)-fold free product). For a solution \(P\) on this variety, we consider the number \(N_P(t)\) of points \(Q\) in the \({\mathcal A}\)-orbit of \(P\) with logarithmic height \(h(Q)\) less than \(t\). We show that if \(a\) is rational, and \(P\) is a non-trivial rational solution to this equation, then the limit \[ \lim_{t\to\infty} \frac{\log N_P(t)}{\log t}=\alpha(n) \] exists and depends only on \(n\). We give an effective algorithm for determining these exponents. For large \(n\), this gives the asymptotic result \[ \frac{\log n}{\log 2}<\alpha(n)< \frac{\log n}{\log 2}+o(n^{-.58}). \]
0 references
integer points
0 references
rational points
0 references
orbits
0 references
quadratic diophantine equations
0 references
Markoff-Hurwitz equations
0 references
asymptotic result
0 references