English

Improved Bounds on Diffsequences with Gaps in Powers of 2

Combinatorics 2025-09-01 v1

Abstract

Let DD be a set of positive integers. A DD-diffsequence of length kk is a sequence of positive integers a1<<aka_1 < \cdots < a_k such that ai+1aiDa_{i+1}-a_i\in D for i=1,,k1i=1,\ldots,k-1. For D={2iiZ0}D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}, it is known that there exists a minimum integer nn, denoted by Δ(D,k)\Delta(D,k), such that every 22-coloring of {1,n}\{1,\ldots n \} admits a monochromatic DD-diffsequence of length kk. In this work, we prove a new lower bound for Δ(D,k)\Delta(D,k) to Δ(D,k)(8k51212)2(8k533)\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.

Keywords

Cite

@article{arxiv.2508.21280,
  title  = {Improved Bounds on Diffsequences with Gaps in Powers of 2},
  author = {Kanav Talwar and Utkarsh Gupta},
  journal= {arXiv preprint arXiv:2508.21280},
  year   = {2025}
}
R2 v1 2026-07-01T05:11:23.293Z