{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/112880"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/112880","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Polynomial partitioning and incidence problems in higher dimensions","abstract":"Incidence 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..","abstract_html":"Incidence 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..","abstract_has_math":false,"creators":["Yang, Ben, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Mathematics.","school":null,"contributors":[],"advisors":["Lawrence Guth."],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-22T22:20:58Z","subjects":["Mathematics."],"languages":["eng"],"rights":["MIT 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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/112880","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lawrence Guth."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Mathematics."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Mathematics."]},{"key":"dc:creator","label":"Author","values":["Yang, Ben, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-12-20T18:15:52Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-12-20T18:15:52Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT 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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/112880"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-59)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Incidence 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.."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Polynomial partitioning and incidence problems in higher dimensions"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lawrence Guth."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Mathematics."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Mathematics."],"dc:creator":["Yang, Ben, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2017-12-20T18:15:52Z"],"dc:date.available":["2017-12-20T18:15:52Z"],"dc:date.issued":["2017"],"dc:description":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2017.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 57-59)."],"dc:description.abstract":["Incidence 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.."],"dc:description.degree":["Ph. D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/112880"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT 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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mathematics."],"dc:title":["Polynomial partitioning and incidence problems in higher dimensions"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:58Z"}