New citations: Brun-Titchmarsh type theorems

[CareyRunboLi]

1. Linnik's contant:
   Linnik (1994) < ∞
   Pan (1957) 10000
   Pan (1958) 5448
   Chen (1965) 777
   Jutila (1970) 630
   Chen (1977) 168
   Jutila (1977) 80
   Graham (1977) 36
   Graham (1981) 20
   Chen (1979) 17
   Wang (1986) 16
   Chen & Liu (1989) 13.5
   Wang (1991) 8
   Heath-Brown (1992) 5.5
   Xylouris (2009) 5.2 (Triantafyllos Xylouris, Über die Linniksche Konstante (On Linnik’s constant), thesis, http://arxiv.org/abs/0906.2749v1, 2009, in German)
   Xylouris (2011) 5.18
   Xylouris (2011) 5 (Triantafyllos Xylouris, Über die Nullstellen der Dirichletschen L-Funktionen und die kleinste Primzahl in einer arithmetischen Progression, thesis, Universität Bonn, https://bonndoc.ulb.uni-bonn.de/xmlui/handle/20.500.11811/5074, 2011)
   Meng(2000) 4.5 (under condition q is a prime) (Z. Meng, The distribution of the zeros of L-functions and the least prime in some arithmetic progression, Science in China (Series A), 43(9), 937-944, 2000)

2. Other types of B-T theorems:
   Lou and Yao (1986): (S. Lou and Q. Yao, On the Brun-Titchmarsh Theorem, Ziran Zazhi, 5, 393, 1986)
   Improves Iwaniec's Theorem 3 (1982): D(x, q)=min(x q^{-θ}, x^{2} q^{-12/5}) to D(x, q)=min(x q^{-θ}, x^{9/7} q^{-24/35}).

Baker and Harman (1996): (R. C. Baker and G. Harman, The Brun-Titchmarsh Theorem on average, In: Berndt, B.C., Diamond, H.G., Hildebrand, A.J. (eds) Analytic Number Theory. Progress in Mathematics, vol 138. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4086-0_4)
Provides an average version and some numerical bounds.

Baker (1996): (R. C. Baker, The Brun-Titchmarsh Theorem, Journal of Number Theory, 56, 343-365, 1996)
Improves Iwaniec's result (1982) under some conditions.

Xi and Zheng (2024): (P. Xi and J. Zheng, On the Brun-Titchmarsh theorem, https://arxiv.org/abs/2404.01003v2, 2024)
Improves several results under conditions like prime moduli or smooth moduli.

Iwaniec (1982) also got many conditional results and results in special cases.

3. Upper bounds for primes in short intervals.
   One can see citations [21], [27], [28] and [4] in my preprint https://arxiv.org/abs/2308.04458v5. A newer version with corrected numerical bounds (for example, lower constant 0.0300 and upper constant 2.7626 when θ=0.52) will appear soon. For θ≥0.522 Harman's sieve can produce better results than Iwaniec's upper bound 4/(1-θ).

[teorth]

Thanks! I have incorporated the references