Rainbow numbers of [n][n] for ∑i=1k−1xi=xk\sum_{i=1}^{k-1} x_i = x_k

preprint2020arXivOpen access

Abstract

Consider the set {1,2,…,n}=[n]\{1,2,\dots,n\} = [n] and an equation eqeq. The rainbow number of [n][n] for eqeq, denoted rb⁡([n],eq)\operatorname{rb}([n],eq), is the smallest number of colors such that for every exact rb⁡([n],eq)\operatorname{rb}([n], eq)-coloring of [n][n], there exists a solution to eqeq with every member of the solution set assigned a distinct color. This paper focuses on linear equations and, in particular, establishes the rainbow number for the equations ∑i=1k−1xi=xk\sum_{i=1}^{k-1} x_i = x_k for k=3k=3 and k=4k=4. The paper also establishes a general lower bound for k≥5k \ge 5.

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.