Multidimensional configurations in the primes with shifted prime steps (Q2039637)

The celebrated theorem of \textit{E. Szemerédi} [Proc. int. Congr. Math., Vancouver 1974, Vol. 2, 503--505 (1975; Zbl 0335.10054)] states that any dense subset of the integers must contain arbitrarily long arithmetic progressions. After the ergodic theoretic proof of \textit{H. Furstenberg} [J. Anal. Math. 31, 204--256 (1977; Zbl 0347.28016)], many generalizations have been obtained. \par Let \(P\) denote the set of primes. The theorem of \textit{B. Green} and \textit{T. Tao} [Ann. Math. (2) 167, No. 2, 481--547 (2008; Zbl 1191.11025)] states that any dense subset of \(P\) must contain an arbitrarily long arithmetic progression. \textit{T. Tao} and \textit{T. Ziegler} [Isr. J. Math. 207, Part 1, 203--228 (2015; Zbl 1414.11019)] generalized this to polynomial configurations. \textit{B. Cook} et al. [Ann. Comb. 22, No. 4, 711--768 (2018; Zbl 1403.05106)] and \textit{T. Tao} and \textit{T. Ziegler} [Isr. J. Math. 207, Part 1, 203--228 (2015; Zbl 1414.11019)] independently proved a prime version of the Furstenberg-Katznelson theorem. \textit{J. Fox} and \textit{Y. Zhao} [Am. J. Math. 137, No. 4, 1139--1145 (2015; Zbl 1391.11120)] obtained a very short proof of the same result. Tao-Ziegler and Fox-Zhao's proofs depend on the program of counting linear configurations in the primes by Green, Tao and Ziegler. However, Cook-Magyar-Titichetrakun used a hypergraph removal lemma for weighted hypergraphs. \textit{T. H. Lê} and \textit{J. Wolf} [Int. Math. Res. Not. 2014, No. 23, 6448--6473 (2014; Zbl 1369.11010)] proved a hybrid of Tao-Ziegler and Wooley-Ziegler's results. Their proof used comparison method of Frantzikinakis-Host-Kra. In this paper, it is shown that the step \(r\) in the multidimensional result of Cook-Magyar-Titichetrakun, Tao-Ziegler and Fox-Zhao can also be taken to be of the form \(p -1\) or \(p+1\). In fact, it is proved that if \( A \subset P^{d} \) be of positive relative upper density, then for every \( h_{1},\cdots, h_{k} \in Z_{d} \), there exists \( a \in Z_{d} \) and \( p \in P \) such that \( a+(p-1)h_{1}, \cdots, a + (p - 1)h_{k} \in A \). The same is true if \(p - 1\) is replaced by \( p + 1\). A lower bound for the number of such configurations has been obtained. Simple examples show that \( P-1 \) and \( P+ 1 \) are the only translates of the primes having this property.