Large subsets of [Formula: see text] without arithmetic progressions

For integers m and n, we study the problem of finding good lower bounds for the size of progression-free sets in [Formula: see text] . Let [Formula: see text] denote the maximal size of a subset of [Formula: see text] without arithmetic progressions of length k and let [Formula: see text] denote the...

Descripción completa

Detalles Bibliográficos
Autores principales: Elsholtz, Christian, Klahn, Benjamin, Lipnik, Gabriel F.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10073169/
https://www.ncbi.nlm.nih.gov/pubmed/37035093
http://dx.doi.org/10.1007/s10623-022-01145-w

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10073169/
https://www.ncbi.nlm.nih.gov/pubmed/37035093
http://dx.doi.org/10.1007/s10623-022-01145-w

Ejemplares similares