Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp012227ms75p
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorDvir, Zeev-
dc.contributor.authorKim, Alexander-
dc.date.accessioned2021-07-27T17:46:50Z-
dc.date.available2021-07-27T17:46:50Z-
dc.date.created2021-04-30-
dc.date.issued2021-07-27-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp012227ms75p-
dc.description.abstractIn the first part of this paper, I adapt a portion of a paper by Davis and Maclagan—which gives a short proof of the maximal cap in F 4 3 being of size 20—into a variable- and matrixbased notation, for ease of understanding. This is the notation that I initially developed for myself, in order to understand the existing literature. Then, in the remainder of the paper, I survey some of the recent breakthroughs that have been made in the cap-set problem, and their applications.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoenen_US
dc.titleA Survey of the Cap Set Problemen_US
dc.typePrinceton University Senior Theses
pu.date.classyear2021en_US
pu.departmentMathematicsen_US
pu.pdf.coverpageSeniorThesisCoverPage
pu.contributor.authorid920139539
pu.mudd.walkinNoen_US
Appears in Collections:Mathematics, 1934-2021

Files in This Item:
File Description SizeFormat 
KIM-ALEXANDER-THESIS.pdf290.58 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.