South Dakota State University
Some 2-Color Rado Numbers For A Linear Equation With A Negative Constant
Abstract
dc:description.abstractAn r-coloring is a function Δ that assigns a color to each natural number from 1 to some number n using colors 0, 1, . . . , r − 1. A monochromatic solution (in Δ) to an equation L with m variables is an ordered m-tuple (x1, x2, . . . , xm) where Δ(x1) = Δ(x2) = · · · = Δ(xm) and (x1, x2, . . . , xm−1, xm) solves L. Given a linear equation L and t ∈ N, the t-color Rado number for L is the least integer n (if it exists) such that every Δ : [1, n] → [0, t − 1] admits a monochromatic solution to L. If no such integer exists, the t-color Rado number for L is infinite. We prove the following two theorems.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis - Open Access
- Discipline thesis:degree_discipline
- Mathematics and Statistics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Bergjord, Rachel
- Contributors dc:contributor
-
- Daniel Schaal
Subjects
dc:subject × 1Rights
dc:rightsIdentifiers
dc:identifier.*- Repository record dc:identifier
- https://openprairie.sdstate.edu/etd2/603