2000 character limit reached
Two Upper Bounds for both the van der Waerden Numbers $W(r, k + 1)$ and $W(r + 1, k)$, that show the Existence of a Recurrence Relation
Published 6 Mar 2016 in math.NT | (1603.01831v6)
Abstract: Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a recurrence property.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.