On the structure of sets with many k-term arithmetic progressions

DOI10.4064/AA138-2-4zbMATH Open1228.11016OpenAlexW2085771646MaRDI QIDQ3184315

György Elekes

Publication date: 14 October 2009

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa138-2-4

zbMATH Keywords

generalized arithmetic progressionk-term arithmetic progressionn-sets

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Arithmetic progressions (11B25) Extremal combinatorics (05D99)

Cited In (4)

• Sets without k‐term progressions can have many shorter progressions
• Homotheties and incidences
• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
• On the number of similar instances of a pattern in a finite set

Recommendations

• Title not available (Why is that?) 👍 👎
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression 👍 👎
• On the order of subsets of asymptotic bases 👍 👎
• On the maximum number of equilateral triangles. I 👍 👎
• Cofinite subsets of asymptotic bases for the positive integers 👍 👎
• All rationals occur as exponents 👍 👎
• \(h\)-fold sums from a set with few products 👍 👎
• Triangle free sets and arithmetic progressions---two Pisier type problems 👍 👎
• A generalization of maximal \(k\)-multiple-free sets of integers 👍 👎
• Upper bounds for $B_h[g$-sets with small $h$] 👍 👎

This page was built for publication: On the structure of sets with many k-term arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184315)