2022
DOI: 10.1093/imrn/rnac130
|View full text |Cite
|
Sign up to set email alerts
|

Longer Gaps Between Values of Binary Quadratic Forms

Abstract: We prove new lower bounds on large gaps between integers that are sums of two squares or are represented by any binary quadratic form of discriminant $D$, improving the results of Richards. Let $s_1, s_2, \ldots $ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$, then $$ \begin{align*} & \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log s_n} \gg \frac{|D|}{\varphi(|D|)\log |D|}, \end{align*}$$improving a l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Our study of j f is motivated by Theorem 5 in [4]. This result gives an upper bound for the least integer γ k > 0 such that all the numbers γ k + j d for 1 ⩽ j ⩽ k are not sums of two squares.…”
Section: § 1 Introduction and Main Resultsmentioning
confidence: 99%
“…Our study of j f is motivated by Theorem 5 in [4]. This result gives an upper bound for the least integer γ k > 0 such that all the numbers γ k + j d for 1 ⩽ j ⩽ k are not sums of two squares.…”
Section: § 1 Introduction and Main Resultsmentioning
confidence: 99%
“…By increasing γ 1 to γ, if necessary, we conclude that (X, X + γX (1−1/d) 2 ) contains an element of S P for every X ≥ 1. Therefore, for every j ∈ N choosing X = s j , we deduce (5).…”
Section: Proof Of Theorem 11mentioning
confidence: 98%
“…For P (x) = x 2 the lower bound of the form s j+1 − s j ≫ log s j is due to Richards [11]. Then, the constant implicit in ≫ has been improved by Dietmann and Elsholtz [5], and by Kalmynin and Konyagin [9] (both preprints were included in a subsequent paper [6]). The upper bound s j+1 − s j ≪ s 1/4 j is due to Bambah and Chowla [1], with subsequent improvements by Uchiyama [14], Shiu [12], [13], and Jameson [8].…”
Section: Introductionmentioning
confidence: 99%