{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_4604"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_4604","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Progress on the 1/3 - 2/3 conjecture","abstract":"Let (P,<) be a finite partially ordered set, also called a poset, and let n denote the cardinality of P. Fix a natural labeling on P so that the elements of P correspond to [n] = {1,2,...,n}. A linear extension is an order-preserving total order x_1 < x_2 < ... < x_n on the elements of P, and more compactly, we can view this as the permutation x_1x_2 ... x_n in one-line notation. For distinct elements x,y in P, we define P(x < y) to be the proportion of linear extensions of P in which x comes before y. For 0 <= alpha <= 1/2, we say (x,y) is an alpha-balanced pair if alpha <= P(x < y) <= 1-alpha. The 1/3-2/3 Conjecture states that every finite partially ordered set that is not a chain has a 1/3-balanced pair. This dissertation focuses on showing the conjecture is true for certain types of partially ordered sets. We begin by discussing a special case, namely when a partial order is 1/2-balanced. For example, this happens when the poset has an automorphism with a cycle of length 2. We spend the remainder of the text proving the conjecture is true for some lattices, including Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2.","abstract_html":"Let (P,&lt;) be a finite partially ordered set, also called a poset, and let n denote the cardinality of P. Fix a natural labeling on P so that the elements of P correspond to [n] = {1,2,...,n}. A linear extension is an order-preserving total order x_1 &lt; x_2 &lt; ... &lt; x_n on the elements of P, and more compactly, we can view this as the permutation x_1x_2 ... x_n in one-line notation. For distinct elements x,y in P, we define P(x &lt; y) to be the proportion of linear extensions of P in which x comes before y. For 0 &lt;= alpha &lt;= 1/2, we say (x,y) is an alpha-balanced pair if alpha &lt;= P(x &lt; y) &lt;= 1-alpha. The 1/3-2/3 Conjecture states that every finite partially ordered set that is not a chain has a 1/3-balanced pair. This dissertation focuses on showing the conjecture is true for certain types of partially ordered sets. We begin by discussing a special case, namely when a partial order is 1/2-balanced. For example, this happens when the poset has an automorphism with a cycle of length 2. We spend the remainder of the text proving the conjecture is true for some lattices, including Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2.","abstract_has_math":false,"creators":["Olson, Emily Jean"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Sagan, Bruce","Bell, Robert","Hall, Jonathan","Magyar, Peter","Shapiro, Michael"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-11-18T18:50:26Z","subjects":["Partially ordered sets","Lattice theory"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:4604","isbn:9781369711790","isbn:1369711794","oclc:1028048610","umi:10271301","local:Olson_grad.msu_0128D_15173"],"render_values":[{"text":"etd:4604","href":null,"code":true},{"text":"isbn:9781369711790","href":null,"code":true},{"text":"isbn:1369711794","href":null,"code":true},{"text":"oclc:1028048610","href":null,"code":true},{"text":"umi:10271301","href":null,"code":true},{"text":"local:Olson_grad.msu_0128D_15173","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/g4a8-fn94","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/g4a8-fn94","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_4604","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Sagan, Bruce","Bell, Robert","Hall, Jonathan","Magyar, Peter","Shapiro, Michael"]},{"key":"dc:creator","label":"Author","values":["Olson, Emily Jean"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Partially ordered sets","Lattice theory"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:4604","isbn:9781369711790","isbn:1369711794","oclc:1028048610","umi:10271301","local:Olson_grad.msu_0128D_15173","https://doi.org/doi:10.25335/g4a8-fn94"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Let (P,<) be a finite partially ordered set, also called a poset, and let n denote the cardinality of P. Fix a natural labeling on P so that the elements of P correspond to [n] = {1,2,...,n}. A linear extension is an order-preserving total order x_1 < x_2 < ... < x_n on the elements of P, and more compactly, we can view this as the permutation x_1x_2 ... x_n in one-line notation. For distinct elements x,y in P, we define P(x < y) to be the proportion of linear extensions of P in which x comes before y. For 0 <= alpha <= 1/2, we say (x,y) is an alpha-balanced pair if alpha <= P(x < y) <= 1-alpha. The 1/3-2/3 Conjecture states that every finite partially ordered set that is not a chain has a 1/3-balanced pair. This dissertation focuses on showing the conjecture is true for certain types of partially ordered sets. We begin by discussing a special case, namely when a partial order is 1/2-balanced. For example, this happens when the poset has an automorphism with a cycle of length 2. We spend the remainder of the text proving the conjecture is true for some lattices, including Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2.","Thesis (Ph. D.)--Michigan State University. Mathematics, 2017","Includes bibliographical references (pages 41-42)"]},{"key":"dc:format","label":"Dc Format","values":["v, 42 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["Progress on the 1/3 - 2/3 conjecture"]}]}],"canonical_facts":{"dc:contributor":["Sagan, Bruce","Bell, Robert","Hall, Jonathan","Magyar, Peter","Shapiro, Michael"],"dc:creator":["Olson, Emily Jean"],"dc:date":["2017"],"dc:description":["Let (P,<) be a finite partially ordered set, also called a poset, and let n denote the cardinality of P. Fix a natural labeling on P so that the elements of P correspond to [n] = {1,2,...,n}. A linear extension is an order-preserving total order x_1 < x_2 < ... < x_n on the elements of P, and more compactly, we can view this as the permutation x_1x_2 ... x_n in one-line notation. For distinct elements x,y in P, we define P(x < y) to be the proportion of linear extensions of P in which x comes before y. For 0 <= alpha <= 1/2, we say (x,y) is an alpha-balanced pair if alpha <= P(x < y) <= 1-alpha. The 1/3-2/3 Conjecture states that every finite partially ordered set that is not a chain has a 1/3-balanced pair. This dissertation focuses on showing the conjecture is true for certain types of partially ordered sets. We begin by discussing a special case, namely when a partial order is 1/2-balanced. For example, this happens when the poset has an automorphism with a cycle of length 2. We spend the remainder of the text proving the conjecture is true for some lattices, including Boolean, set partition, and subspace lattices; partial orders that arise from a Young diagram; and some partial orders of dimension 2.","Thesis (Ph. D.)--Michigan State University. Mathematics, 2017","Includes bibliographical references (pages 41-42)"],"dc:format":["v, 42 pages","application/pdf"],"dc:identifier":["etd:4604","isbn:9781369711790","isbn:1369711794","oclc:1028048610","umi:10271301","local:Olson_grad.msu_0128D_15173","https://doi.org/doi:10.25335/g4a8-fn94"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Partially ordered sets","Lattice theory"],"dc:title":["Progress on the 1/3 - 2/3 conjecture"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T18:50:26Z"}