# Improved Bounds on Diffsequences with Gaps in Powers of 2

## TL;DR

This paper establishes a new lower bound on the minimum length needed to guarantee a monochromatic diffsequence with gaps in powers of two in 2-colorings, improving previous exponential bounds.

## Contribution

It introduces an improved asymptotic lower bound for the minimal length of monochromatic diffsequences with gaps in powers of two, advancing prior exponential bounds.

## Key findings

- New lower bound for (D,k) with asymptotic improvement
- Enhanced understanding of diffsequence coloring thresholds
- Refined exponential growth rate in bounds

## Abstract

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that there exists a minimum integer $n$, denoted by $\Delta(D,k)$, such that every $2$-coloring of $\{1,\ldots n \}$ admits a monochromatic $D$-diffsequence of length $k$. In this work, we prove a new lower bound for $\Delta(D,k)$ to $\Delta(D,k)\ge \left(\sqrt{\frac{8k-5}{12}}-\frac12\right)2^{\left(\sqrt{\frac{8k-5}{3}}-3\right)}$, asymptotically improving the exponential constant in the bound proved by Clifton.