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

Hardy–Littlewood Tuple Conjecture Over Large Finite Fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
35
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(36 citation statements)
references
References 4 publications
1
35
0
Order By: Relevance
“…This plays a role in the proof, where we use that a certain Galois group is S s n [17], and we derive the statistic from an explicit Chebotarev theorem. Since we have not found the exact formulation that we need in the literature, we provide a proof in the appendix.…”
Section: Theorem 14 For Fixed Positive Integers N and S We Havementioning
confidence: 99%
See 1 more Smart Citation
“…This plays a role in the proof, where we use that a certain Galois group is S s n [17], and we derive the statistic from an explicit Chebotarev theorem. Since we have not found the exact formulation that we need in the literature, we provide a proof in the appendix.…”
Section: Theorem 14 For Fixed Positive Integers N and S We Havementioning
confidence: 99%
“…In [17], it is assumed that q is odd, but using [18] that restriction can now be removed for n > 2. This, in particular, implies that L ∩ F = F q (since the image of the restriction map Gal(…”
Section: ] Be Monic Separable and Of Degree M Viewed As A Polynomialmentioning
confidence: 99%
“…. , a 1 , t, and, by definition of B(j), they have degree d(n) as polynomials in t. Hence by lemma 3.4, Res(δ f (t), δ f +α j (t)) has total degree 2 in the coefficients a n−1 , . .…”
Section: (B) Bounding Degrees and Sizesmentioning
confidence: 92%
“…, which is equal to (n − 1)(3n − 5) for odd n and 3n 2 − 10n + 6 for even n. In either case, we may round this up to 3n 2 …”
Section: (E) Bounding a Nmentioning
confidence: 99%
See 1 more Smart Citation