This Is AuburnElectronic Theses and Dissertations

Show simple item record

On the Independence Number of Some Hypergraph


Metadata FieldValueLanguage
dc.contributor.advisorJohnson, Peter
dc.contributor.authorYang, Zechun
dc.date.accessioned2018-07-10T16:14:37Z
dc.date.available2018-07-10T16:14:37Z
dc.date.issued2018-07-10
dc.identifier.urihttp://hdl.handle.net/10415/6270
dc.description.abstractFor 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.rightsEMBARGO_GLOBALen_US
dc.subjectMathematics and Statisticsen_US
dc.titleOn the Independence Number of Some Hypergraphen_US
dc.typeMaster's Thesisen_US
dc.embargo.lengthMONTHS_WITHHELD:12en_US
dc.embargo.statusEMBARGOEDen_US
dc.embargo.enddate2019-07-10en_US
dc.contributor.committeeHoffman, Dean
dc.contributor.committeeMcDonald, Jessica

Files in this item

Show simple item record