{"id":{"repo_id":"marshall","oai_identifier":"oai:mds.marshall.edu:etd-2239"},"canonical_url":"https://search.ndltd.org/etd/marshall/oai:mds.marshall.edu:etd-2239","repository":{"repo_id":"marshall","name":"Marshall University","base_url":"https://mds.marshall.edu/do/oai/"},"display":{"title":"On monochromatic sets with nondecreasing diameter","abstract":"Our problem comes from the field of combinatorics known as Ramsey theory. Ramsey theory, in a general sense, is about identifying the threshold for which a family of objects, associated with a particular parameter, goes from never or sometimes satisfying a certain property to always satisfying that property. Research in Ramsey theory has applications in design theory and coding theory. For integers m, r, and t, we say that a set of n integers colored with r colors is (m, r, t)-permissible if there exist t monochromatic subsets B1, B2, . . . , Bt such that (a) |B1| = |B2| = · · · = |Bt | = m, (b) the largest element in Bi is less than the smallest element in Bi+1 for 1 ≤ i ≤ t − 1, and (c) the diameters of the subsets are nondecreasing. We define f(m, r, t) to be the smallest integer n such that every string of length n is (m, r, t)-permissible. In this thesis, we first look at some preliminary results for values of f(m, r, t), specifically when each individual parameter is 1 as the others vary. We then show that f(m, r, t) exists for all possible positive parameters. We proceed by determining f(2, 2, t) for all positive integers t. We conclude by considering colorings with more than two colors and monochromatic sets that have more than 2 elements, as well as investigating an enumeration of the number of ways a string could be realized as (m, r, t)-permissible.","abstract_html":"Our problem comes from the field of combinatorics known as Ramsey theory. Ramsey theory, in a general sense, is about identifying the threshold for which a family of objects, associated with a particular parameter, goes from never or sometimes satisfying a certain property to always satisfying that property. Research in Ramsey theory has applications in design theory and coding theory. For integers m, r, and t, we say that a set of n integers colored with r colors is (m, r, t)-permissible if there exist t monochromatic subsets B1, B2, . . . , Bt such that (a) |B1| = |B2| = · · · = |Bt | = m, (b) the largest element in Bi is less than the smallest element in Bi+1 for 1 ≤ i ≤ t − 1, and (c) the diameters of the subsets are nondecreasing. We define f(m, r, t) to be the smallest integer n such that every string of length n is (m, r, t)-permissible. In this thesis, we first look at some preliminary results for values of f(m, r, t), specifically when each individual parameter is 1 as the others vary. We then show that f(m, r, t) exists for all possible positive parameters. We proceed by determining f(2, 2, t) for all positive integers t. We conclude by considering colorings with more than two colors and monochromatic sets that have more than 2 elements, as well as investigating an enumeration of the number of ways a string could be realized as (m, r, t)-permissible.","abstract_has_math":false,"creators":["O’Neal, Adam"],"institution":null,"degree_name":"Mathematics","degree_level":"Thesis","degree_discipline":"College of Science","degree_department":null,"school":null,"contributors":["Dr. Michael Schroeder, Committee Chairperson","Dr. JiYoon Jung","Dr. Carl Mummert"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T19:57:11Z","subjects":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","diameter","monochromatic","nondecreasing","permissibility","Ramsey"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://mds.marshall.edu/etd/1238","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://mds.marshall.edu/etd/1238","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://mds.marshall.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Amds.marshall.edu%3Aetd-2239","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Michael Schroeder, Committee Chairperson","Dr. JiYoon Jung","Dr. Carl Mummert"]},{"key":"dc:creator","label":"Author","values":["O’Neal, Adam"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-28T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2019-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["College of Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","diameter","monochromatic","nondecreasing","permissibility","Ramsey"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://mds.marshall.edu/etd/1238"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Our problem comes from the field of combinatorics known as Ramsey theory. Ramsey theory, in a general sense, is about identifying the threshold for which a family of objects, associated with a particular parameter, goes from never or sometimes satisfying a certain property to always satisfying that property. Research in Ramsey theory has applications in design theory and coding theory. For integers m, r, and t, we say that a set of n integers colored with r colors is (m, r, t)-permissible if there exist t monochromatic subsets B1, B2, . . . , Bt such that (a) |B1| = |B2| = · · · = |Bt | = m, (b) the largest element in Bi is less than the smallest element in Bi+1 for 1 ≤ i ≤ t − 1, and (c) the diameters of the subsets are nondecreasing. We define f(m, r, t) to be the smallest integer n such that every string of length n is (m, r, t)-permissible. In this thesis, we first look at some preliminary results for values of f(m, r, t), specifically when each individual parameter is 1 as the others vary. We then show that f(m, r, t) exists for all possible positive parameters. We proceed by determining f(2, 2, t) for all positive integers t. We conclude by considering colorings with more than two colors and monochromatic sets that have more than 2 elements, as well as investigating an enumeration of the number of ways a string could be realized as (m, r, t)-permissible."]},{"key":"dc:title","label":"Title","values":["On monochromatic sets with nondecreasing diameter"]}]}],"canonical_facts":{"dc:contributor":["Dr. Michael Schroeder, Committee Chairperson","Dr. JiYoon Jung","Dr. Carl Mummert"],"dc:creator":["O’Neal, Adam"],"dc:date.available":["2019-10-28T07:00:00Z"],"dc:date.created":["2019-01-01T08:00:00Z"],"dc:description.abstract":["Our problem comes from the field of combinatorics known as Ramsey theory. Ramsey theory, in a general sense, is about identifying the threshold for which a family of objects, associated with a particular parameter, goes from never or sometimes satisfying a certain property to always satisfying that property. Research in Ramsey theory has applications in design theory and coding theory. For integers m, r, and t, we say that a set of n integers colored with r colors is (m, r, t)-permissible if there exist t monochromatic subsets B1, B2, . . . , Bt such that (a) |B1| = |B2| = · · · = |Bt | = m, (b) the largest element in Bi is less than the smallest element in Bi+1 for 1 ≤ i ≤ t − 1, and (c) the diameters of the subsets are nondecreasing. We define f(m, r, t) to be the smallest integer n such that every string of length n is (m, r, t)-permissible. In this thesis, we first look at some preliminary results for values of f(m, r, t), specifically when each individual parameter is 1 as the others vary. We then show that f(m, r, t) exists for all possible positive parameters. We proceed by determining f(2, 2, t) for all positive integers t. We conclude by considering colorings with more than two colors and monochromatic sets that have more than 2 elements, as well as investigating an enumeration of the number of ways a string could be realized as (m, r, t)-permissible."],"dc:identifier":["https://mds.marshall.edu/etd/1238"],"dc:subject":["Discrete Mathematics and Combinatorics","Mathematics","Physical Sciences and Mathematics","diameter","monochromatic","nondecreasing","permissibility","Ramsey"],"dc:title":["On monochromatic sets with nondecreasing diameter"],"thesis:degree_discipline":["College of Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-11-21T19:57:11Z"}