Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"graph nim"”.

  1. A Collection of Problems in Combinatorics

    … 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) …

    clemson Repository record for A Collection of Problems in Combinatorics (opens in a new tab)