Table of Contents
Fetching ...

Strong paucity in the Brüdern-Robert Diophantine system

Trevor D. Wooley

Abstract

Let $k$ be a natural number with $k\ge 2$, and let $\varepsilon>0$. We consider the number $V_k^*(P)$ of integral solutions of the system of simultaneous Diophantine equations \[ x_1^{2j-1}+\ldots +x_{k+1}^{2j-1}=y_1^{2j-1}+\ldots +y_{k+1}^{2j-1}\quad (1\le j\le k), \] with $1\le x_i,y_i\le P$ $(1\le i\le k+1)$. Writing $L_k^*(P)$ for the number of diagonal solutions with $\{x_1,\ldots ,x_{k+1}\}=\{y_1,\ldots ,y_{k+1}\}$, so that $L_k^*(P)\sim (k+1)!P^{k+1}$, we prove that \[ V_k^*(P)-L_k^*(P)\ll P^{\sqrt{8k+9}-1+\varepsilon}. \] This establishes a strong paucity result improving on earlier work of Brüdern and Robert.

Strong paucity in the Brüdern-Robert Diophantine system

Abstract

Let be a natural number with , and let . We consider the number of integral solutions of the system of simultaneous Diophantine equations with . Writing for the number of diagonal solutions with , so that , we prove that This establishes a strong paucity result improving on earlier work of Brüdern and Robert.
Paper Structure (6 sections, 6 theorems, 111 equations)

This paper contains 6 sections, 6 theorems, 111 equations.

Key Result

Theorem 1.1

When $k\geqslant 2$, one has In particular, one has

Theorems & Definitions (12)

  • Theorem 1.1
  • Theorem 1.2
  • Lemma 2.1
  • proof
  • Lemma 2.2
  • proof
  • proof : Proof of Theorem \ref{['theorem1.1']}
  • proof : Proof of Theorem \ref{['theorem1.2']}
  • Theorem 5.1
  • proof : Proof of Theorem \ref{['theorem5.1']}
  • ...and 2 more