加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本