MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Mathematics
  • Mathematics - Ph.D. / Sc.D.
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Dept. of Mathematics
  • Mathematics - Ph.D. / Sc.D.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs

Author(s)
Wellens, Jake(Jake Lee)
Thumbnail
Download1191267818-MIT.pdf (900.4Kb)
Other Contributors
Massachusetts Institute of Technology. Department of Mathematics.
Advisor
Henry Cohn.
Terms of use
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
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.
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).
 
Date issued
2020
URI
https://hdl.handle.net/1721.1/126937
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Massachusetts Institute of Technology
Keywords
Mathematics.

Collections
  • Mathematics - Ph.D. / Sc.D.
  • Mathematics - Ph.D. / Sc.D.

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.