Maximal subsets free of arithmetic progressions in arbitrary sets

DOI10.1134/S0001434617090097zbMATH Open1430.11018arXiv2010.04490MaRDI QIDQ679856FDOQ679856

Authors: A. S. Semchankau 

Publication date: 22 January 2018

Published in: Mathematical Notes (Search for Journal in Brave)

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.

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

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.

zbMATH Keywords

combinatorial number theoryadditive combinatorics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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)