Improved Bounds on Diffsequences with Gaps in Powers of 2
Abstract
Let D be a set of positive integers. A D-diffsequence of length k is a sequence of positive integers a1 < ·s < ak such that ai+1-ai∈ D for i=1,…,k-1. For D=\2i i∈ Z 0\, it is known that there exists a minimum integer n, denoted by (D,k), such that every 2-coloring of \1,… n \ admits a monochromatic D-diffsequence of length k. In this work, we prove a new lower bound for (D,k) to (D,k) (8k-512-12)2(8k-53-3), asymptotically improving the exponential constant in the bound proved by Clifton.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.