Table of Contents
Fetching ...

Higher Rédei reciprocity and integral points on conics

Peter Koymans, Carlo Pagano

Abstract

Fix an integer $l$ such that $|l|$ is a prime $3$ modulo $4$. Let $d > 0$ be a squarefree integer and let $N_d(x, y)$ be the principal binary quadratic form of $\mathbb{Q}(\sqrt{d})$. Building on a breakthrough of Alexander Smith, we give an asymptotic formula for the solubility of $N_d(x, y) = l$ in integers $x$ and $y$ as $d$ varies among squarefree integers divisible by $l$. As a corollary we give, in case $l > 0$, an asymptotic formula for the event that the Hasse Unit Index of the field $\mathbb{Q}(\sqrt{-l}, \sqrt{d})$ is $2$ as $d$ varies over all positive squarefree integers. We also improve the results of Fouvry and Klüners and recent results of Chan, Milovic and the authors on the solubility of the negative Pell equation. Our main new tool is a generalization of a classical reciprocity law due to Rédei.

Higher Rédei reciprocity and integral points on conics

Abstract

Fix an integer such that is a prime modulo . Let be a squarefree integer and let be the principal binary quadratic form of . Building on a breakthrough of Alexander Smith, we give an asymptotic formula for the solubility of in integers and as varies among squarefree integers divisible by . As a corollary we give, in case , an asymptotic formula for the event that the Hasse Unit Index of the field is as varies over all positive squarefree integers. We also improve the results of Fouvry and Klüners and recent results of Chan, Milovic and the authors on the solubility of the negative Pell equation. Our main new tool is a generalization of a classical reciprocity law due to Rédei.

Paper Structure

This paper contains 24 sections, 30 theorems, 236 equations.

Key Result

Theorem 1.1

Let $\ell$ be an integer such that $|\ell|$ is a prime $3$ modulo $4$. Then we have

Theorems & Definitions (81)

  • Theorem 1.1
  • Corollary 1.2
  • Corollary 1.3
  • Lemma 2.1
  • proof
  • Lemma 2.2
  • Lemma 2.3
  • proof
  • Definition 3.1
  • Lemma 3.2
  • ...and 71 more