Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.