The Gaussian primes contain arbitrarily shaped constellations
From MaRDI portal
Publication:2479612
DOI10.1007/BF02789444zbMath1160.11006arXivmath/0501314OpenAlexW1996392660WikidataQ30048448 ScholiaQ30048448MaRDI QIDQ2479612
Publication date: 1 April 2008
Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0501314
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Other combinatorial number theory (11B75) Arithmetic progressions (11B25)
Related Items
Removal lemmas and approximate homomorphisms, Additive combinatorics and graph theory, A variant of the hypergraph removal lemma, Uniformity norms, their weaker versions, and applications, A multidimensional Szemerédi theorem in the primes via combinatorics, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, An analytic approach to sparse hypergraphs: hypergraph removal, An arithmetic transference proof of a relative Szemerédi theorem, Linear equations in primes, The primes contain arbitrarily long polynomial progressions, Walking to infinity on gaussian lines, The Green-Tao theorem for primes of the form \(x^2+y^2+1\), Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, A multi-dimensional Szemerédi theorem for the primes via a correspondence principle, A relative Szemerédi theorem
Cites Work
- A variant of the hypergraph removal lemma
- An ergodic Szemerédi theorem for commuting transformations
- Hypergraphs, quasi-randomness, and conditions for regularity
- A density version of the Hales-Jewett theorem
- The primes contain arbitrarily long arithmetic progressions
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Extremal problems on set systems
- The Gaussian Zoo
- Regularity Lemma for k-uniform hypergraphs
- A Note on a Question of Erdős and Graham
- Higher correlations of divisor sums related to primes III: small gaps between primes
- Applications of the regularity lemma for uniform hypergraphs
- On sets of integers containing no four elements in arithmetic progression
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item