{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/126937"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/126937","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs","abstract":"This thesis consists of three disparate parts. In the first, we generalize and extend recent ideas of Chiarelli, Hatami and Saks to obtain new bounds on the number of relevant variables for a boolean function in terms of its degree, its sensitivity, and its certificate and decision tree complexities, and we also sharpen the best-known polynomial relationships between some of these complexity measures by a constant factor. In the second part, we show that the Partial Rejection Sampling method of Guo, Jerrum and Liu can solve a handful of natural sampling problems that fall outside the guarantees of the authors' original analysis. Finally, we revise and make partial progress on a conjecture of De Caen, Erdős, Pullman and Wormald on clique partitions of a graph and its complement, building on ideas of Keevash and Sudakov.","abstract_html":"This thesis consists of three disparate parts. In the first, we generalize and extend recent ideas of Chiarelli, Hatami and Saks to obtain new bounds on the number of relevant variables for a boolean function in terms of its degree, its sensitivity, and its certificate and decision tree complexities, and we also sharpen the best-known polynomial relationships between some of these complexity measures by a constant factor. In the second part, we show that the Partial Rejection Sampling method of Guo, Jerrum and Liu can solve a handful of natural sampling problems that fall outside the guarantees of the authors' original analysis. Finally, we revise and make partial progress on a conjecture of De Caen, Erdős, Pullman and Wormald on clique partitions of a graph and its complement, building on ideas of Keevash and Sudakov.","abstract_has_math":false,"creators":["Wellens, Jake(Jake Lee)"],"institution":"Massachusetts Institute of Technology","degree_name":"Doctoral","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Mathematics","school":null,"contributors":[],"advisors":["Henry Cohn."],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020","date_published":"2020","updated_at":"2026-07-22T22:20:51Z","subjects":["Mathematics."],"languages":["eng"],"rights":["MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/126937","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Henry Cohn."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Mathematics","Math"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Mathematics."]},{"key":"dc:creator","label":"Author","values":["Wellens, Jake(Jake Lee)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-09-03T16:42:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-09-03T16:42:08Z"]},{"key":"dc:date.issued","label":"Date","values":["2020"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctoral"]}]},{"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 may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."]},{"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":["https://hdl.handle.net/1721.1/126937"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020","Cataloged from the official PDF of thesis.","Includes bibliographical references (pages 107-112)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis consists of three disparate parts. In the first, we generalize and extend recent ideas of Chiarelli, Hatami and Saks to obtain new bounds on the number of relevant variables for a boolean function in terms of its degree, its sensitivity, and its certificate and decision tree complexities, and we also sharpen the best-known polynomial relationships between some of these complexity measures by a constant factor. In the second part, we show that the Partial Rejection Sampling method of Guo, Jerrum and Liu can solve a handful of natural sampling problems that fall outside the guarantees of the authors' original analysis. Finally, we revise and make partial progress on a conjecture of De Caen, Erdős, Pullman and Wormald on clique partitions of a graph and its complement, building on ideas of Keevash and Sudakov."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Henry Cohn."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Mathematics","Math"],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Mathematics."],"dc:creator":["Wellens, Jake(Jake Lee)"],"dc:date.accessioned":["2020-09-03T16:42:08Z"],"dc:date.available":["2020-09-03T16:42:08Z"],"dc:date.issued":["2020"],"dc:description":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020","Cataloged from the official PDF of thesis.","Includes bibliographical references (pages 107-112)."],"dc:description.abstract":["This thesis consists of three disparate parts. In the first, we generalize and extend recent ideas of Chiarelli, Hatami and Saks to obtain new bounds on the number of relevant variables for a boolean function in terms of its degree, its sensitivity, and its certificate and decision tree complexities, and we also sharpen the best-known polynomial relationships between some of these complexity measures by a constant factor. In the second part, we show that the Partial Rejection Sampling method of Guo, Jerrum and Liu can solve a handful of natural sampling problems that fall outside the guarantees of the authors' original analysis. Finally, we revise and make partial progress on a conjecture of De Caen, Erdős, Pullman and Wormald on clique partitions of a graph and its complement, building on ideas of Keevash and Sudakov."],"dc:description.degree":["Ph. D."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/126937"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Mathematics."],"dc:title":["Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs"],"dc:type":["Thesis"],"thesis:degree_name":["Doctoral"]},"updated_at":"2026-07-22T22:20:51Z"}