On sets of integers containing no four elements in arithmetic progression
From MaRDI portal
Publication:5563457
DOI10.1007/BF01894569zbMath0175.04301OpenAlexW2132134025WikidataQ56341549 ScholiaQ56341549MaRDI QIDQ5563457
Publication date: 1969
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01894569
Related Items
A Furstenberg-Zimmer structure theorem for \(\sigma\)-finite measure spaces, Number theory -- probabilistic, heuristic, and computational approaches, Additive combinatorics and graph theory, A Szemerédi-type theorem for subsets of the unit cube, GOWERS UNIFORMITY NORM AND PSEUDORANDOM MEASURES OF THE PSEUDORANDOM BINARY SEQUENCES, An upper bound for Hilbert cubes, New applications of the polynomial method: The cap set conjecture and beyond, Hilbert’s Proof of His Irreducibility Theorem, Popular differences for right isosceles triangles, Hilbert cubes in progression-free sets and in the set of squares, On some properties of sparse sets: a survey, The polynomial Carleson operator, Arithmetic progressions in certain subsets of finite fields, Local-vs-global combinatorics, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, Box-counting dimensions of popcorn subsets, On sets of integers not containing arithmetic progressions of prescribed length, Linear problems in combinatorial number theory, A density version of a geometric Ramsey theorem, Unnamed Item, Unnamed Item, Discrete quantum subgroup asymptotically fixing a sequence of finite subsets, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Szemerédi's proof of Szemerédi's theorem, Finding large 3-free sets. I. The small \(n\) case, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Boolean algebras and Lubell functions, A general nonlinear version of Roth's theorem on the real line, The Gaussian primes contain arbitrarily shaped constellations, The structure theory of set addition revisited, On Assouad dimension and arithmetic progressions in sets defined by digit restrictions, On a problem of P. Erdős, On the number of squares in an arithmetic progression, Behrend's theorem for sequences containing no k-element arithmetic progression of a certain type, Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions, Arithmetic progressions in self-similar sets, Graph norms and Sidorenko's conjecture, What is good mathematics?, Approximation by special values of Dirichlet series, Arithmetic progressions, different regularity lemmas and removal lemmas, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Irregularities of sequences relative to arithmetic progressions. IV, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, From harmonic analysis to arithmetic combinatorics, On partitioning integers into progression free sets, Growth in groups: ideas and perspectives, Trigonometric series with gaps, A new bound for the Brown-Erdős-Sós problem, A Ramsey variant of the Brown–Erdős–Sós conjecture, The Green-Tao Theorem and the Infinitude of Primes in Domains, Multiplicatively large sets and ergodic Ramsey theory, Fourier dimension and avoidance of linear patterns
