Sets of integers that do not contain long arithmetic progressions
From MaRDI portal
Publication:540042
zbMath1215.11006arXiv0811.3057MaRDI QIDQ540042
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.3057
Related Items
A blurred view of Van der Waerden type theorems, The number of \(k\)-dimensional corner-free subsets of grids, Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions, A new lower bound for van der Waerden numbers, Threshold functions and Poisson convergence for systems of equations in random sets, Szemerédi's Theorem in the Primes, The NOF multiparty communication complexity of composed functions, Colourings of Uniform Hypergraphs with Large Girth and Applications, A note on multiparty communication complexity and the Hales-Jewett theorem, A generalization of sets without long arithmetic progressions based on Szekeres algorithm, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Dimensions of Sets Which Uniformly Avoid Arithmetic Progressions, 3SUM, 3XOR, triangles