In this paper, we study the classification of sequences containing arbitrarily long arithmetic progressions. First, we deal with the question how the polynomial map [Formula: see text] can be extended so that it contains arbitrarily long arithmetic progressions. Under some growth conditions, we construct sequences which contain arbitrarily long arithmetic progressions. Also, we give a uniform and explicit arithmetic progression rank bound for a large class of sequences. Consequently, a dichotomy result is deduced on the finiteness of the arithmetic progression rank of certain sequences. Therefore, in this paper, we see a way to determine the finiteness of the arithmetic progression rank of various sequences satisfying some growth conditions.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.