Maximal subsets free of arithmetic progressions in arbitrary sets

DOI10.1134/S0001434617090097MaRDI QIDQ679856zbMATH OpenFDO

Authors A. S. Semchankau

Publication date 22 January 2018

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.04490

zbMATH Keywords

combinatorial number theoryadditive combinatorics

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: We consider the problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length $k$ in a given set of size $n$. It is proved that it is sufficient, in a certain sense, to consider the interval $[1,dots,n]$. The study continues the work of Koml'os, Sulyok, and Szemer'edi.

Recommendations

• Sets without k‐term progressions can have many shorter progressions
• Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
• A note on maximal progression-free sets
• The number of subsets of integers with no \(k\)-term arithmetic progression
• Progression-free sets in finite abelian groups.

Cites work

• A new proof of Szemerédi's theorem
• Linear problems in combinatorial number theory
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Szemerédi's theorem and problems on arithmetic progressions
• Thick subsets that do not contain arithmetic progressions
• Translation invariant equations and the method of Sanders

Cited in

(10)

• Large subsets of Euclidean space avoiding infinite arithmetic progressions
• scientific article; zbMATH DE number 5138745 (Why is no real title available?)
• A note on maximal progression-free sets
• The number of subsets of integers with no \(k\)-term arithmetic progression
• The maximum size of subsets forbidding cyclic arithmetic progressions
• When will every maximal \(F\)-free subposet contain a maximal element?
• Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs
• SET MAPPINGS WITH FREE SETS WHICH ARE ARITHMETIC PROGRESSIONS
• Large minimal sets which force arithmetic progressions
• On the multiplicative Chung-Diaconis-Graham process

This page was built for publication: Maximal subsets free of arithmetic progressions in arbitrary sets

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