Back to search

South Dakota State University

T-color Selectivity Rado numbers

Abstract

dc:description.abstract

For any t ∈ [special characters omitted], let n = Rs( t) be the least integer n, such that for every t-coloring of the set [1, n], one of the following two cases will occur: (a) There exists a solution (x 1, x2, x3) to the Schur Equation x1 + x 2 = x3, such that Δ(x 1) = Δ(x2) = Δ(x 3). (This is known as a monochromatic solution.) (b) There exists a solution (x1, x2, x3) to the Schur Equation such that Δ(x i) ≠ Δ(xj) for every i, j where 1 ≤ i < j ≤ 3. (This is known as a totally multicolored solution.) The number n = Rs( t) is known as the t-color selectivity Rado Number. The main results section will show that for every t ∈ [special characters omitted], [special characters omitted]Furthermore, if t is even, there exists a unique coloring of maximal length. If t is odd, there exist [special characters omitted] different colorings of maximal length.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis - University Access Only
Discipline thesis:degree_discipline
Mathematics and Statistics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Bergwell, Mike

Identifiers

dc:identifier.*
Repository record dc:identifier
https://openprairie.sdstate.edu/etd2/1561

Chain of custody

source
Harvested from
South Dakota State University
Base URL
openprairie.sdstate.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Bergwell, Mike. T-color Selectivity Rado numbers. Thesis - University Access Only thesis, https://openprairie.sdstate.edu/etd2/1561