Back to search

Clemson University

A Collection of Problems in Combinatorics

Abstract

dc:description.abstract

We present several problems in combinatorics including the partition function, Graph Nim, and the evolution of strings. Let p(n) be the number of partitions of n. We say a sequence an is log-concave if for every n, an2 &ge an+1 an-1. We will show that p(n) is log-concave for n &ge 26. We will also show that for n<26, p(n) alternatively satisfies and does not satisfy the log-concave property. We include results for the Sperner property of the partition function. The second problem we present is the game of Graph Nim. We use the Sprague-Grundy theorem to analyze modified versions of Nim played on various graphs. We include progress made towards proving that all G-paths are periodic. The third topic we present is on the evolution of strings. Consider a string of length l over an alphabet of size k. At each stage of the evolution, with a probability of q, we randomly select a new letter to replace a correct letter. Using the transition matrix we will study the absorption rate to the correct string.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Janoski, Janine
Contributors dc:contributor
  • Calkin, Neil
  • Gallagher , Colin
  • James , Kevin
  • Matthews , Gretchen

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_dissertations/892

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Janoski, Janine. A Collection of Problems in Combinatorics. Dissertation thesis, https://open.clemson.edu/all_dissertations/892