Maximal subsets free of arithmetic progressions in arbitrary sets

DOI10.1134/S0001434617090097zbMath1430.11018arXiv2010.04490MaRDI QIDQ679856

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

additive combinatoricscombinatorial number theory

Mathematics Subject Classification ID

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

Related Items

On the multiplicative Chung-Diaconis-Graham process, Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs

Cites Work

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