{"id":{"repo_id":"carleton","oai_identifier":"oai:carleton.scholaris.ca:20.500.14718/43599"},"canonical_url":"https://search.dev.ndltd.org/etd/carleton/oai:carleton.scholaris.ca:20.500.14718/43599","repository":{"repo_id":"carleton","name":"Carleton University","base_url":"https://carleton.scholaris.ca/server/oai/request"},"display":{"title":"Topics in the Generation of Ideals of Posets","abstract":"We study the generation of the fixed ideals of finite partial orders with particular attention in finding Gray codes for their generation. Pruesse and Ruskey conjecture that the graph J(P,k), which contains as vertices the k-ideals of the poset P, with an edge between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide an infinite family of posets for which the conjecture does not hold. We study the Whitney numbers of fence posets to show a different but related conjecture of Pruesse and Ruskey also holds for fences and crowns with a small number of exceptions. We study Hamiltonian cycles in the Johnson graph (n,k) with certain properties about adjacent elements which we name t-full Hamiltonian cycles. We show their connection to the recently proved Middle Levels Theorem and how to construct them. We use t-full Hamiltonian cycles to show that, for k <= n-2 the graph J(Cr(2n), k) has a Hamiltonian cycle. We also apply 2-full Hamiltonian cycles to show that (P,3) has a Hamiltonian path for any height two poset P. Further, we introduce t-full Hamiltonian connected paths, and show that 1-full Hamiltonian connected paths exist in J(n,k). We introduce a weaker version of t-full Hamiltonian paths called pair-adjacent paths, and give algorithms for their construction. We show how these algorithms can generate the 3-ideals for crown posets with more than 6 elements. Finally, we study two applications of the generation of fixed-sized ideals. We formulate the information set decoding method in terms of error-correcting codes with a poset metric, and show how the probability of success in the guessing phase of such algorithms is minimized for anti-chain posets. We generalize ordered covering arrays (OCA) for general posets, and give elementary constructions of OCAs for level-regular rooted tree posets.","abstract_html":"We study the generation of the fixed ideals of finite partial orders with particular attention in finding Gray codes for their generation. Pruesse and Ruskey conjecture that the graph J(P,k), which contains as vertices the k-ideals of the poset P, with an edge between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide an infinite family of posets for which the conjecture does not hold. We study the Whitney numbers of fence posets to show a different but related conjecture of Pruesse and Ruskey also holds for fences and crowns with a small number of exceptions. We study Hamiltonian cycles in the Johnson graph (n,k) with certain properties about adjacent elements which we name t-full Hamiltonian cycles. We show their connection to the recently proved Middle Levels Theorem and how to construct them. We use t-full Hamiltonian cycles to show that, for k <= n-2 the graph J(Cr(2n), k) has a Hamiltonian cycle. We also apply 2-full Hamiltonian cycles to show that (P,3) has a Hamiltonian path for any height two poset P. Further, we introduce t-full Hamiltonian connected paths, and show that 1-full Hamiltonian connected paths exist in J(n,k). We introduce a weaker version of t-full Hamiltonian paths called pair-adjacent paths, and give algorithms for their construction. We show how these algorithms can generate the 3-ideals for crown posets with more than 6 elements. Finally, we study two applications of the generation of fixed-sized ideals. We formulate the information set decoding method in terms of error-correcting codes with a poset metric, and show how the probability of success in the guessing phase of such algorithms is minimized for anti-chain posets. We generalize ordered covering arrays (OCA) for general posets, and give elementary constructions of OCAs for level-regular rooted tree posets.","abstract_has_math":false,"creators":["Powers, Mackenzie William"],"institution":"Carleton University","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Doctoral","degree_discipline":"Applied Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-07-24T01:34:43Z","subjects":[],"languages":["en"],"rights":["Copyright © 2025 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.22215/etd/2025-16456"],"render_values":[{"text":"10.22215/etd/2025-16456","href":"https://doi.org/10.22215/etd/2025-16456","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14718/43599","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Powers, Mackenzie William"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-05-23T20:04:56Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-05-23T20:04:56Z"]},{"key":"dc:date.issued","label":"Date","values":["2025"]},{"key":"dc:publisher","label":"Institution","values":["Carleton University"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Applied Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright © 2025 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.22215/etd/2025-16456"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14718/43599"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We study the generation of the fixed ideals of finite partial orders with particular attention in finding Gray codes for their generation. Pruesse and Ruskey conjecture that the graph J(P,k), which contains as vertices the k-ideals of the poset P, with an edge between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide an infinite family of posets for which the conjecture does not hold. We study the Whitney numbers of fence posets to show a different but related conjecture of Pruesse and Ruskey also holds for fences and crowns with a small number of exceptions. We study Hamiltonian cycles in the Johnson graph (n,k) with certain properties about adjacent elements which we name t-full Hamiltonian cycles. We show their connection to the recently proved Middle Levels Theorem and how to construct them. We use t-full Hamiltonian cycles to show that, for k <= n-2 the graph J(Cr(2n), k) has a Hamiltonian cycle. We also apply 2-full Hamiltonian cycles to show that (P,3) has a Hamiltonian path for any height two poset P. Further, we introduce t-full Hamiltonian connected paths, and show that 1-full Hamiltonian connected paths exist in J(n,k). We introduce a weaker version of t-full Hamiltonian paths called pair-adjacent paths, and give algorithms for their construction. We show how these algorithms can generate the 3-ideals for crown posets with more than 6 elements. Finally, we study two applications of the generation of fixed-sized ideals. We formulate the information set decoding method in terms of error-correcting codes with a poset metric, and show how the probability of success in the guessing phase of such algorithms is minimized for anti-chain posets. We generalize ordered covering arrays (OCA) for general posets, and give elementary constructions of OCAs for level-regular rooted tree posets."]},{"key":"dc:title","label":"Title","values":["Topics in the Generation of Ideals of Posets"]}]}],"canonical_facts":{"dc:creator":["Powers, Mackenzie William"],"dc:date.accessioned":["2025-05-23T20:04:56Z"],"dc:date.available":["2025-05-23T20:04:56Z"],"dc:date.issued":["2025"],"dc:description.abstract":["We study the generation of the fixed ideals of finite partial orders with particular attention in finding Gray codes for their generation. Pruesse and Ruskey conjecture that the graph J(P,k), which contains as vertices the k-ideals of the poset P, with an edge between vertices that differ by a swap, has a Hamiltonian path. The conjecture is true for series-parallel posets and interval orders. We prove the conjecture also holds for the fence posets, but that the conjecture is false for the 3-ideals of the crown poset with six elements. We also provide an infinite family of posets for which the conjecture does not hold. We study the Whitney numbers of fence posets to show a different but related conjecture of Pruesse and Ruskey also holds for fences and crowns with a small number of exceptions. We study Hamiltonian cycles in the Johnson graph (n,k) with certain properties about adjacent elements which we name t-full Hamiltonian cycles. We show their connection to the recently proved Middle Levels Theorem and how to construct them. We use t-full Hamiltonian cycles to show that, for k <= n-2 the graph J(Cr(2n), k) has a Hamiltonian cycle. We also apply 2-full Hamiltonian cycles to show that (P,3) has a Hamiltonian path for any height two poset P. Further, we introduce t-full Hamiltonian connected paths, and show that 1-full Hamiltonian connected paths exist in J(n,k). We introduce a weaker version of t-full Hamiltonian paths called pair-adjacent paths, and give algorithms for their construction. We show how these algorithms can generate the 3-ideals for crown posets with more than 6 elements. Finally, we study two applications of the generation of fixed-sized ideals. We formulate the information set decoding method in terms of error-correcting codes with a poset metric, and show how the probability of success in the guessing phase of such algorithms is minimized for anti-chain posets. We generalize ordered covering arrays (OCA) for general posets, and give elementary constructions of OCAs for level-regular rooted tree posets."],"dc:identifier.doi":["10.22215/etd/2025-16456"],"dc:identifier.uri":["https://hdl.handle.net/20.500.14718/43599"],"dc:language.iso":["en"],"dc:publisher":["Carleton University"],"dc:rights":["Copyright © 2025 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."],"dc:title":["Topics in the Generation of Ideals of Posets"],"dc:type":["thesis"],"thesis:degree_discipline":["Applied Mathematics"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"]},"updated_at":"2026-07-24T01:34:43Z"}