Linear constellations in primes with arithmetic restrictions
Christopher Frei, Joachim König, Magdaléna Tinková
TL;DR
This work extends Green–Tao type results on linear configurations in primes to primes under arithmetic restrictions, establishing both conditional (HRH-based) and unconditional (Artin-symbol) analogues. The authors develop a comprehensive framework combining nilsequence orthogonality, the W-trick, Hooley’s method, and an ideal von Mangoldt model to handle restricted primes, defining key densities $\delta(a,b,q)$, $\eta_{K,C}$, and $\tau_{\mathbf K,\mathbf C,\Psi}$, with leading terms given by $\mathfrak S$ constants. They prove asymptotics for finite-complexity systems of affine-linear forms and demonstrate an application to inverse Galois theory, producing infinitely many Galois extensions with prescribed local behavior. The results connect analytic number theory with algebraic number theory, providing a robust method to count constellations of primes under prescribed arithmetic constraints and enabling local–global compatibility in Galois realizations. The paper thereby broadens the reach of Green–Tao–Ziegler techniques to structured prime subsets and highlights new avenues for interplay between prime patterns and Galois theory.
Abstract
We prove analogues of the theorem of Green and Tao on linear constellations in primes, in which the primes under consideration are restricted by certain arithmetic conditions. Our first main result is conditional upon Hooley's Riemann hypothesis and imposes the extra condition that the primes have prescribed primitive roots. Our second main result is unconditional and imposes the extra condition that the primes have prescribed Artin symbols in given Galois number fields. In the appendix we present an application of the second result in inverse Galois theory.
