Integer sets containing no arithmetic progressions

From MaRDI portal
Revision as of 10:23, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2640635

DOI10.1007/BF01903717zbMath0721.11007OpenAlexW1488916590WikidataQ56341563 ScholiaQ56341563MaRDI QIDQ2640635

No author found.

Publication date: 1990

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01903717




Related Items (40)

Logarithmic bounds for Roth's theorem via almost-periodicityAdditive combinatorics and graph theoryPerfect Hash Families: Constructions and ExistenceOn subsets of finite Abelian groups with no 3-term arithmetic progressionsGeneralizations of Fourier analysis, and how to apply themA quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.New applications of the polynomial method: The cap set conjecture and beyondOn certain other sets of integersUniform hypergraphs containing no gridsA generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. IIA generalization of Roth's theorem in function fieldsTower-type bounds for Roth's theorem with popular differencesInjective colorings with arithmetic constraintsRoth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primesRoth-type theorem for quadratic system in Piatetski-Shapiro primesNEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOROn Roth's theorem on progressionsProgression-free sets in finite abelian groups.Erdős and the integersFinding large 3-free sets. I. The small \(n\) caseEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsProgression-free sets in \(\mathbb{Z}_4^n\) are exponentially smallArithmetical progressions and the number of sumsMATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERSON IMPROVING ROTH'S THEOREM IN THE PRIMESRoth's theorem in many variablesTestability and repair of hereditary hypergraph propertiesROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETSOn distinct distances and \(\lambda \)-free point setsPolynomial configurations in difference setsImproved bound in Roth's theorem on arithmetic progressionsA new proof of Roth’s theorem on arithmetic progressionsA Prime Analogue of Roth’s Theorem in Function FieldsA generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progressionArithmetic progressions, different regularity lemmas and removal lemmasA GENERALIZATION OF ROTH'S THEOREM IN FUNCTION FIELDSOn a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsetsOn sets of integers which contain no three terms in geometric progressionFrom harmonic analysis to arithmetic combinatoricsGreedy algorithm, arithmetic progressions, subset sums and divisibility




Cites Work




This page was built for publication: Integer sets containing no arithmetic progressions