Off-campus UMass Amherst users: To download campus access dissertations, please use the following link to log into our proxy server with your UMass Amherst user name and password.

Non-UMass Amherst users: Please talk to your librarian about requesting this dissertation through interlibrary loan.

Dissertations that have an embargo placed on them will not be available to anyone until the embargo expires.

Author ORCID Identifier

https://orcid.org/0000-0001-9694-0248

AccessType

Open Access Dissertation

Document Type

dissertation

Degree Name

Doctor of Philosophy (PhD)

Degree Program

Mathematics

Year Degree Awarded

2023

Month Degree Awarded

September

First Advisor

Annie Raymond

Subject Categories

Discrete Mathematics and Combinatorics

Abstract

In the haze of the 1970s, a conjecture was born to unknown parentage...the union-closed sets conjecture. Given a family of sets $\FF$, we say that $\FF$ is union-closed if for every two sets $S, T \in \FF$, we have $S \cup T \in \FF$. The union-closed sets conjecture states that there is an element in at least half of the sets of any (non-empty) union-closed family. In 2016, Pulaj, Raymond, and Theis reinterpreted the conjecture as an optimization problem that could be formulated as an integer program. This thesis is concerned with the study of the polytope formed by taking the convex hull of the integer points satisfying the integer program. We find several facets and describe some small cases of this complicated polytope in full.

DOI

https://doi.org/10.7275/35968701

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS