New lower bounds for $r_3(N)$

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Hunter, Zach
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909237472395264
author Hunter, Zach
author_facet Hunter, Zach
contents We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of $\{1,\dots,N\}$ that lack arithmetic progressions of length $3$. This gives the first quasipolynomial improvement since the original construction of Behrend.
format Preprint
id arxiv_https___arxiv_org_abs_2401_16106
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle New lower bounds for $r_3(N)$
Hunter, Zach
Combinatorics
Number Theory
We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of $\{1,\dots,N\}$ that lack arithmetic progressions of length $3$. This gives the first quasipolynomial improvement since the original construction of Behrend.
title New lower bounds for $r_3(N)$
topic Combinatorics
Number Theory
url https://arxiv.org/abs/2401.16106