On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
From MaRDI portal
Publication:5834919
DOI10.1073/pnas.32.12.331zbMath0060.10302OpenAlexW2023600080WikidataQ53055067 ScholiaQ53055067MaRDI QIDQ5834919
Publication date: 1946
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.32.12.331
Related Items
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques, The length of an s-increasing sequence of r-tuples, A blurred view of Van der Waerden type theorems, Removal lemmas and approximate homomorphisms, Polynomial removal lemmas for ordered graphs, Perfect Hash Families: Constructions and Existence, Khintchine-type recurrence for 3-point configurations, Reciprocal Sums and Counting Functions, Separating Hash Families: A Johnson-type bound and New Constructions, Efficient Removal Lemmas for Matrices, New lower bounds for van der Waerden numbers, Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols, Large subsets of Euclidean space avoiding infinite arithmetic progressions, Tower-type bounds for Roth's theorem with popular differences, Sums of transcendental dilates, Four‐term progression free sets with three‐term progressions in all large subsets, Reachability Preservers: New Extremal Bounds and Approximation Algorithms, On the running time of hypergraph bootstrap percolation, Almost every matroid has an \(M(K_4)\)- or a \(\mathcal{W}^3\)-minor, On some properties of sparse sets: a survey, Extremal independent set reconfiguration, On classification of sequences containing arbitrarily long arithmetic progressions, Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes, Multiple recurrence and large intersections for abelian group actions, The Kelley-Meka bounds for sets free of three-term arithmetic progressions, Felix Adalbert Behrend, Lower bounds for the Turán densities of daisies, Local-vs-global combinatorics, Easily Testable Graph Properties, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, A Class of Random Cantor Measures, with Applications, Sparse Hypergraphs with Applications to Coding Theory, Optimal lower bounds for multiple recurrence, Unexpected upper bounds on the complexity of some communication games, The Erdős–Moser Sum-free Set Problem, Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers, RAMSEY GROWTH IN SOME NIP STRUCTURES, Sumsets as unions of sumsets of subsets, Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts, Star Chromatic Index, Parent-identifying codes, Compression using efficient multicasting, Unnamed Item, Testing subgraphs in directed graphs, What is good mathematics?, Many \(T\) copies in \(H\)-free graphs, Triforce and corners, Three-term arithmetic progressions in subsets of F_q^∞ of large Fourier dimension, Local Properties via Color Energy Graphs and Forbidden Configurations, Unnamed Item, The asymptotic density of sequences, Barriers for fast matrix multiplication from irreversibility, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, Further bounds in the polynomial Szemer, New Results on Linear Size Distance Preservers, Large sets avoiding linear patterns, Unnamed Item, Popular differences for matrix patterns, The regularity method for graphs with few 4‐cycles, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, A construction of maximally recoverable codes, On some metric and combinatorial geometric problems, Scheduling lower bounds via AND subset sum, Anti-van der Waerden numbers of 3-term arithmetic progression, Finite configurations in sparse sets, On the Erdős-Straus non-averaging set problem, On subsets of abelian groups with no 3-term arithmetic progression, Parallelepipeds in sets of integers, Some Properties of Lower Level-Sets of Convolutions, The equidistant dimension of graphs, Short proofs of some extremal results. II., The number of \(k\)-dimensional corner-free subsets of grids, A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1., Blocking visibility for points in general position, A Hierarchy of Lower Bounds for Sublinear Additive Spanners, New applications of the polynomial method: The cap set conjecture and beyond, On certain other sets of integers, Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions, Nearly complete graphs decomposable into large induced matchings and their applications, On solution-free sets of integers, Quantitative multiple recurrence for two and three transformations, On the density of a graph and its blowup, Patterns without a popular difference, Sunflowers and testing triangle-freeness of functions, Nonlinear Roth type theorems in finite fields, Improved bounds for progression-free sets in \(C_8^n\), Uniform hypergraphs containing no grids, Efficient removal lemmas for matrices, Unique sequences containing no \(k\)-term arithmetic progressions, Arithmetic progressions in multiplicative groups of finite fields, Nearly equal distances in metric spaces, Multiple recurrence and convergence results associated to \(\mathbb F_P^\omega\)-actions, The removal lemma for tournaments, Injective colorings with arithmetic constraints, Novel structures in Stanley sequences, Distinct angles in general position, The matrix capacity of a tensor, A new proof of the density Hales-Jewett theorem, Threshold functions and Poisson convergence for systems of equations in random sets, Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions, A new proof of the graph removal lemma, On Roth's theorem on progressions, Coloring the cube with rainbow cycles, On sets of integers not containing arithmetic progressions of prescribed length, Matrix multiplication via arithmetic progressions, On the combinatorial problems which I would most like to see solved, Erdős and the integers, Multiple ergodic averages for three polynomials and applications, Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs, Density and Ramsey type results on algebraic equations with restricted solution sets, Colorings with only rainbow arithmetic progressions, Finding large 3-free sets. I. The small \(n\) case, Sparse hypergraphs: new bounds and constructions, The Namer-Claimer game, Chessboard domination problems, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The joints problem for matroids, The Green-Tao theorem: an exposition, More Turán-type theorems for triangles in convex point sets, The NOF multiparty communication complexity of composed functions, Enumerating solution-free sets in the integers, On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression, Maximal subsets free of arithmetic progressions in arbitrary sets, Large sets avoiding patterns, On generalized Stanley sequences, Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions, An improved construction of progression-free sets, An improved lower bound related to the Furstenberg-Sárközy theorem, Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching, Caps and progression-free sets in \(\mathbb{Z}_m^n\), On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions, Roth's theorem in many variables, Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa), More distinct distances under local conditions, ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS, Some remarks on barycentric-sum problems over cyclic groups, On distinct distances and \(\lambda \)-free point sets, Finite field models in arithmetic combinatorics -- ten years on, Improved bound in Roth's theorem on arithmetic progressions, A note on multiparty communication complexity and the Hales-Jewett theorem, A generalization of sets without long arithmetic progressions based on Szekeres algorithm, Irregularities of sequences relative to arithmetic progressions. II, Degenerate Turán densities of sparse hypergraphs, Fast rectangular matrix multiplication and applications, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Unnamed Item, Multiple recurrence of Markov shifts and other infinite measure preserving transformations, Arithmetic progressions in sets of fractional dimension, Non-averaging subsets and non-vanishing transversals, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, On distinct distances among points in general position and other related problems, Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings, MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS, On partitioning integers into progression free sets, Greedy algorithm, arithmetic progressions, subset sums and divisibility, Trigonometric series with gaps, A new bound for the Brown-Erdős-Sós problem, On the diagonal queens domination problem, Fourier dimension and avoidance of linear patterns
