On the Independence Number of Some Hypergraph
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Johnson, Peter | |
dc.contributor.author | Yang, Zechun | |
dc.date.accessioned | 2018-07-10T16:14:37Z | |
dc.date.available | 2018-07-10T16:14:37Z | |
dc.date.issued | 2018-07-10 | |
dc.identifier.uri | http://hdl.handle.net/10415/6270 | |
dc.description.abstract | For integers 1 =< m < n and a prime p (we require 2 =< m when p = 2), a subset I(p^n; p^m) ={0,...,p^n-1} is described which contains no pm-term cyclic arithmetic progression modulo p^n, and which is maximal among subsets of {0,...,p^n-1} with that property. Furthermore, we investigate the same setting, but for any such group. | en_US |
dc.rights | EMBARGO_GLOBAL | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | On the Independence Number of Some Hypergraph | en_US |
dc.type | Master's Thesis | en_US |
dc.embargo.length | MONTHS_WITHHELD:12 | en_US |
dc.embargo.status | EMBARGOED | en_US |
dc.embargo.enddate | 2019-07-10 | en_US |
dc.contributor.committee | Hoffman, Dean | |
dc.contributor.committee | McDonald, Jessica |