Improved Bounds on Diffsequences with Gaps in Powers of 2
Combinatorics
2025-09-01 v1
Abstract
Let be a set of positive integers. A -diffsequence of length is a sequence of positive integers such that for . For , it is known that there exists a minimum integer , denoted by , such that every -coloring of admits a monochromatic -diffsequence of length . In this work, we prove a new lower bound for to , asymptotically improving the exponential constant in the bound proved by Clifton.
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}
}