Table of Contents
Fetching ...

Diophantine approximation with sums of two squares

Stephan Baier, Habibur Rahaman

TL;DR

The paper investigates Diophantine approximation for integers $n$ represented by a positive definite integral binary quadratic form $Q$. It proves two main results: (i) for any irrational $\alpha$, there are infinitely many $n$ in $\mathcal{A}_Q$ with $||\alpha n||<n^{-1/2+\varepsilon}$, derived from Cook's bounds on diagonal forms; (ii) a quantitative version with a lower bound for the count of such $n$ when the exponent is any fixed $\gamma<3/7$, obtained by combining the Voronoi summation formula for $Q$ with fixed-modulus bilinear estimates for Kloosterman sums due to Kerr–Shparlinski–Wu–Xi. The authors reduce the problem to an asymptotic for a sum counting representations of integers in unions of residue classes, then carefully analyze the main term and an intricate error term using Gauss and Kloosterman-type sums, Bessel transforms, and Dirichlet-approximation techniques. This yields an explicit lower bound and, in particular, improves upon prior $1/3$-type exponents by achieving $3/7$ in the bounded-exponent regime, with additional information about the density of suitable $n$.

Abstract

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $α$, there exist infinitely many positive integers $n$ represented by $Q$ and satisfying $||αn||<n^{-(1/2-\varepsilon)}$ for any fixed but arbitrarily small $\varepsilon>0$. This is an easy consequence of a result by Cook on small fractional parts of diagonal quadratic forms. Secondly, we give a quantitative version with a lower bound of this result when the exponent $1/2-\varepsilon$ is replaced by any fixed $γ<3/7$. To this end, we use the Voronoi summation formula and a bound for bilinear forms with Kloosterman sums to fixed moduli by Kerr, Shparlinski, Wu and Xi.

Diophantine approximation with sums of two squares

TL;DR

The paper investigates Diophantine approximation for integers represented by a positive definite integral binary quadratic form . It proves two main results: (i) for any irrational , there are infinitely many in with , derived from Cook's bounds on diagonal forms; (ii) a quantitative version with a lower bound for the count of such when the exponent is any fixed , obtained by combining the Voronoi summation formula for with fixed-modulus bilinear estimates for Kloosterman sums due to Kerr–Shparlinski–Wu–Xi. The authors reduce the problem to an asymptotic for a sum counting representations of integers in unions of residue classes, then carefully analyze the main term and an intricate error term using Gauss and Kloosterman-type sums, Bessel transforms, and Dirichlet-approximation techniques. This yields an explicit lower bound and, in particular, improves upon prior -type exponents by achieving in the bounded-exponent regime, with additional information about the density of suitable .

Abstract

For any given positive definite binary quadratic form with integer coefficients, we establish two results on Diophantine approximation with integers represented by . Firstly, we show that for every irrational number , there exist infinitely many positive integers represented by and satisfying for any fixed but arbitrarily small . This is an easy consequence of a result by Cook on small fractional parts of diagonal quadratic forms. Secondly, we give a quantitative version with a lower bound of this result when the exponent is replaced by any fixed . To this end, we use the Voronoi summation formula and a bound for bilinear forms with Kloosterman sums to fixed moduli by Kerr, Shparlinski, Wu and Xi.

Paper Structure

This paper contains 7 sections, 16 theorems, 119 equations.

Key Result

Theorem 1

There are infinitely many integers $n\in\mathcal{A}_Q$ such that for any fixed but arbitrarily small $\varepsilon>0$.

Theorems & Definitions (27)

  • Theorem 1
  • Theorem 2: Main Theorem, Danicic
  • Theorem 3: Theorem 1, Cook
  • Theorem 4
  • Corollary 1
  • Remark 1
  • Lemma 1
  • proof
  • Lemma 2
  • proof
  • ...and 17 more