The 2-color Rado Number of x1+x2+⋯+xm−1=axm,x_1+x_2+\cdots +x_{m-1}=ax_m, II

preprint2014arXivOpen access

Abstract

In the first installment of this series, we proved that, for every integer a≥3a\geq 3 and every m≥2a2−a+2m\geq 2a^2-a+2, the 2-color Rado number of x1+x2+⋯+xm−1=axmx_1 + x_2 + \cdots + x_{m-1} = ax_m is ⌈m−1a⌈m−1a⌉⌉\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil. Here we obtain the best possible improvement of the bound on m.m. We prove that if 3∣a3|a then the 2-color Rado number is ⌈m−1a⌈m−1a⌉⌉\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil when m≥2a+1m\geq 2a+1 but not when m=2a,m=2a, and that if 3∤a3\nmid a then the 2-color Rado number is ⌈m−1a⌈m−1a⌉⌉\lceil\frac{m-1}{a} \lceil\frac{m-1}{a} \rceil\rceil when m≥2a+2m\geq 2a+2 but not when m=2a+1.m=2a+1. We also determine the 2-color Rado number for all a≥3a\geq 3 and m≥a2+1.m\geq \frac{a}{2}+1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.