Show simple item record

dc.contributor.advisorLawrence Guth.en_US
dc.contributor.authorYang, Ben, Ph. D. Massachusetts Institute of Technologyen_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Mathematics.en_US
dc.date.accessioned2017-12-20T18:15:52Z
dc.date.available2017-12-20T18:15:52Z
dc.date.copyright2017en_US
dc.date.issued2017en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/112880
dc.descriptionThesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 57-59).en_US
dc.description.abstractIncidence geometry is the study of the intersection patterns of simple geometric objects. One of the breakthroughs in this field is the polynomial partitioning technique introduced by Guth and Katz. In this thesis, I will present two results on incidence problems with high-dimensional objects: an almost tight bound on the number of joints formed by varieties in Rn and a tight bound on the number of flags in Rn. The proofs are based on the polynomial partitioning technique and its variations..en_US
dc.description.statementofresponsibilityby Ben Yang.en_US
dc.format.extent59 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMathematics.en_US
dc.titlePolynomial partitioning and incidence problems in higher dimensionsen_US
dc.typeThesisen_US
dc.description.degreePh. D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc1014342767en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record