Skip to content
Preprint

Refined upper bounds on Schur-like numbers

Aug 2026 · 0 citations · 17 references
Mathematics

Abstract

For positive integers $r, m$ and $N$, every $r$-coloring of $\{1, \dots, N\}$ contains a monochromatic solution to $x_1+\dots+x_{m+1}=y_1+\dots+y_m$ provided that $N \ge 3^r (r!)^{1/m}$, which is qualitatively optimal when $m$ is logarithmic in $r$.

View source

Similar papers

Preprint Sep 2026

The Fibonacci numbers are not 3-accessible

A $D$-diffsequence is a sequence of integers $x_1<\dots<x_k$ such that $x_{i+1} -x_i \in D$ for $1 \le i \le k-1$. The set $D$ is called $r$-accessible if every $r$-coloring of the positive integers contains arbitrarily long monochromatic $D$-diffsequences. This note proves that the set of Fibonacci numbers is not 3-ac...

William J. Wesley · 0 citations
Open access Aug 2026

Triple exponential bounds for monochromatic sums equal to products

We show that any \(r\)-coloring of \(\{1,\dots,r^{r^{r^{2r}}}\}\) contains monochromatic sets \(\{a,b,a+b,x,y,xy\}\) with \(a+b=xy.\) Mathematics Subject Classifications: 05D10 Keywords: Ramsey, sums equal to products

Matt Bowen · 0 citations
Preprint Oct 2026

Further bounds in the polynomial Szemer\'edi theorem

We show that there exists $c>0$ such that any subset of $\{1,\ldots,N\}$ having size $\gg N / \exp( (\log\log\log N)^c )$ contains a nontrivial pattern of the form $x,x+y,x+2y,x+y^3$. It is the first configuration of complexity strictly greater than $0$, other than refinements of arithmetic progressions, for which quan...

Bartłomiej Bychawski, Bartosz Głowacki, Ivan Spyrydonov · 0 citations
Preprint Sep 2026

Box-Delaunay graphs of large chromatic number

For every $n$, we construct a 2-dimensional $n$-element poset whose Hasse diagram has independence number $n\exp(-\Omega(\sqrt{\log n}))$, and consequently, chromatic number $\exp(\Omega(\sqrt{\log n}))$. This also yields an $n$-point planar set whose box-Delaunay graph satisfies the same bounds.

István Tomon · 1 citation
Preprint Sep 2026

Counting sets with given doubling via dimension

We determine, up to a factor of $2^{o(k)}$, the number of $k$-sets $A \subset \{1, \ldots, n\}$ such that $|A + A| \leq m$, where $k = \Theta(\log n)$ and $m \leq k^{1 + \alpha}$, for small $\alpha>0$, answering a question of Green and Morris.

Marcelo Campos, Gabriel Dahia, João Pedro Marciano · 1 citation · ⚡1
Preprint Sep 2026

An Improved Upper Bound for Multicolour Ramsey Numbers

Let $R_r(k)$ denote the diagonal $r$-colour Ramsey number. We prove that there exist absolute constants $c,K>0$ such that $R_r(k)\le r^{rk}\exp\!\left(-c\frac{k}{r\log^2(2r)}\right)$ for every $r\ge2$ and every $k\ge Kr^2\log^6(2r)$. This improves the exponential saving in a recent bound of Yang and Mao by a factor of...

Sunghyeon Jo · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.