On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
From MaRDI portal
Publication:5834918
DOI10.1073/pnas.28.12.561zbMath0060.10301OpenAlexW1977699786WikidataQ33747127 ScholiaQ33747127MaRDI QIDQ5834918
Publication date: 1942
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.28.12.561
Related Items
Bounds on certain multiplications of affine combinations, Finite configurations in sparse sets, Parallelepipeds in sets of integers, Rectangular matrix multiplication revisited, New applications of the polynomial method: The cap set conjecture and beyond, On certain other sets of integers, On sunflowers and matrix multiplication, Quantitative multiple recurrence for two and three transformations, Sunflowers and testing triangle-freeness of functions, New lower bounds for van der Waerden numbers, Unique sequences containing no \(k\)-term arithmetic progressions, Arithmetic progressions in multiplicative groups of finite fields, Nearly equal distances in metric spaces, Exponentially larger affine and projective caps, Asymptotic tensor rank of graph tensors: beyond matrix multiplication, On some properties of sparse sets: a survey, The Minkowski sum of linear Cantor sets, On arithmetic sums of Cantor-type sequences of integers, The matrix capacity of a tensor, Covering a set with arithmetic progressions is NP-complete, On Roth's theorem on progressions, On sets of integers not containing arithmetic progressions of prescribed length, Linear problems in combinatorial number theory, Matrix multiplication via arithmetic progressions, On sets not containing arithmetic progressions of a certain kind, Erdős and the integers, Finding large 3-free sets. I. The small \(n\) case, Further Limitations of the Known Approaches for Matrix Multiplication, Fast rectangular matrix multiplication and some applications, Solving linear equations in a vector space over a finite field, Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions, An improved construction of progression-free sets, Caps and progression-free sets in \(\mathbb{Z}_m^n\), Asymptotic entanglement transformation between W and GHZ states, Roth's theorem in many variables, A note on compressed sensing and the complexity of matrix multiplication, Improved bound in Roth's theorem on arithmetic progressions, A generalization of sets without long arithmetic progressions based on Szekeres algorithm, Irregularities of sequences relative to arithmetic progressions. II, The asymptotic density of sequences, Fast rectangular matrix multiplication and applications, Barriers for fast matrix multiplication from irreversibility, Arithmetic progressions in sets of fractional dimension, Greedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, Greedy algorithm, arithmetic progressions, subset sums and divisibility, Dimensions of Sets Which Uniformly Avoid Arithmetic Progressions, Trigonometric series with gaps
