{"id":{"repo_id":"waikato-masters","oai_identifier":"oai:researchcommons.waikato.ac.nz:10289/10557"},"canonical_url":"https://search.dev.ndltd.org/etd/waikato-masters/oai:researchcommons.waikato.ac.nz:10289/10557","repository":{"repo_id":"waikato-masters","name":"University Waikato","base_url":"https://researchcommons.waikato.ac.nz/server/oai/request"},"display":{"title":"Critical sets of full Latin squares","abstract":"This thesis explores the properties of critical sets of the full n-Latin square and related combinatorial structures including full designs, (m,n,2)-balanced Latin rectangles and n-Latin cubes. In Chapter 3 we study known results on designs and the analogies between critical sets of the full n-Latin square and minimal defining sets of the full designs. Next in Chapter 4 we fully classify the critical sets of the full (m,n,2)-balanced Latin square, by describing the precise structures of these critical sets from the smallest to the largest. Properties of different types of critical sets of the full n-Latin square are investigated in Chapter 5. We fully classify the structure of any saturated critical set of the full n-Latin square. We show in Theorem 5.8 that such a critical set has size exactly equal to n³ - 2n² - n. In Section 5.2 we give a construction which provides an upper bound for the size of the smallest critical set of the full n-Latin square. Similarly in Section 5.4, another construction gives a lower bound for the size of the largest non-saturated critical set. We conjecture that these bounds are best possible. Using the results from Chapter 5, we obtain spectrum results on critical sets of the full n-Latin square in Chapter 6. In particular, we show that a critical set of each size between (n - 1)³ + 1 and n(n - 1)² + n - 2 exists. In Chapter 7, we turn our focus to the completability of partial k-Latin squares. The relationship between partial k-Latin squares and semi-k-Latin squares is used to show that any partial k-Latin square of order n with at most (n - 1) non-empty cells is completable. As Latin cubes generalize Latin squares, we attempt to generalize some of the results we have established on k-Latin squares so that they apply to k-Latin cubes. These results are presented in Chapter 8.","abstract_html":"This thesis explores the properties of critical sets of the full n-Latin square and related combinatorial structures including full designs, (m,n,2)-balanced Latin rectangles and n-Latin cubes. In Chapter 3 we study known results on designs and the analogies between critical sets of the full n-Latin square and minimal defining sets of the full designs. Next in Chapter 4 we fully classify the critical sets of the full (m,n,2)-balanced Latin square, by describing the precise structures of these critical sets from the smallest to the largest. Properties of different types of critical sets of the full n-Latin square are investigated in Chapter 5. We fully classify the structure of any saturated critical set of the full n-Latin square. We show in Theorem 5.8 that such a critical set has size exactly equal to n³ - 2n² - n. In Section 5.2 we give a construction which provides an upper bound for the size of the smallest critical set of the full n-Latin square. Similarly in Section 5.4, another construction gives a lower bound for the size of the largest non-saturated critical set. We conjecture that these bounds are best possible. Using the results from Chapter 5, we obtain spectrum results on critical sets of the full n-Latin square in Chapter 6. In particular, we show that a critical set of each size between (n - 1)³ + 1 and n(n - 1)² + n - 2 exists. In Chapter 7, we turn our focus to the completability of partial k-Latin squares. The relationship between partial k-Latin squares and semi-k-Latin squares is used to show that any partial k-Latin square of order n with at most (n - 1) non-empty cells is completable. As Latin cubes generalize Latin squares, we attempt to generalize some of the results we have established on k-Latin squares so that they apply to k-Latin cubes. These results are presented in Chapter 8.","abstract_has_math":false,"creators":["Raass, Petelo Vaipuna"],"institution":"University of Waikato","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Cavenagh, Nicholas J.","Stokes, Tim E.","Broughan, Kevin A."],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-07-24T05:57:30Z","subjects":[],"languages":[],"rights":["All items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated."],"rights_urls":["https://researchcommons.waikato.ac.nz/bitstreams/674ae035-550d-4edc-9f14-15336182e543/download"],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Cavenagh, Nicholas J.","Stokes, Tim E.","Broughan, Kevin A."]},{"key":"dc:creator","label":"Author","values":["Raass, Petelo Vaipuna"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2016"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Waikato"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://hdl.handle.net/10289/10557"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["https://researchcommons.waikato.ac.nz/bitstreams/674ae035-550d-4edc-9f14-15336182e543/download","All items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://researchcommons.waikato.ac.nz/bitstreams/e890fb1a-6932-4cb6-928c-67921272a538/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis explores the properties of critical sets of the full n-Latin square and related combinatorial structures including full designs, (m,n,2)-balanced Latin rectangles and n-Latin cubes. In Chapter 3 we study known results on designs and the analogies between critical sets of the full n-Latin square and minimal defining sets of the full designs. Next in Chapter 4 we fully classify the critical sets of the full (m,n,2)-balanced Latin square, by describing the precise structures of these critical sets from the smallest to the largest. Properties of different types of critical sets of the full n-Latin square are investigated in Chapter 5. We fully classify the structure of any saturated critical set of the full n-Latin square. We show in Theorem 5.8 that such a critical set has size exactly equal to n³ - 2n² - n. In Section 5.2 we give a construction which provides an upper bound for the size of the smallest critical set of the full n-Latin square. Similarly in Section 5.4, another construction gives a lower bound for the size of the largest non-saturated critical set. We conjecture that these bounds are best possible. Using the results from Chapter 5, we obtain spectrum results on critical sets of the full n-Latin square in Chapter 6. In particular, we show that a critical set of each size between (n - 1)³ + 1 and n(n - 1)² + n - 2 exists. In Chapter 7, we turn our focus to the completability of partial k-Latin squares. The relationship between partial k-Latin squares and semi-k-Latin squares is used to show that any partial k-Latin square of order n with at most (n - 1) non-empty cells is completable. As Latin cubes generalize Latin squares, we attempt to generalize some of the results we have established on k-Latin squares so that they apply to k-Latin cubes. These results are presented in Chapter 8."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["7fe5ce3e51196167c330e4593cb5d0a3","54ddfaae9e939fb9fe062bd0161afbd5","c1f6fda032a8b63f86b94d3425b1f514"]},{"key":"dc:title","label":"Title","values":["Critical sets of full Latin squares"]}]}],"canonical_facts":{"dc:contributor.advisor":["Cavenagh, Nicholas J.","Stokes, Tim E.","Broughan, Kevin A."],"dc:creator":["Raass, Petelo Vaipuna"],"dc:date.issued":["2016"],"dc:description.abstract":["This thesis explores the properties of critical sets of the full n-Latin square and related combinatorial structures including full designs, (m,n,2)-balanced Latin rectangles and n-Latin cubes. In Chapter 3 we study known results on designs and the analogies between critical sets of the full n-Latin square and minimal defining sets of the full designs. Next in Chapter 4 we fully classify the critical sets of the full (m,n,2)-balanced Latin square, by describing the precise structures of these critical sets from the smallest to the largest. Properties of different types of critical sets of the full n-Latin square are investigated in Chapter 5. We fully classify the structure of any saturated critical set of the full n-Latin square. We show in Theorem 5.8 that such a critical set has size exactly equal to n³ - 2n² - n. In Section 5.2 we give a construction which provides an upper bound for the size of the smallest critical set of the full n-Latin square. Similarly in Section 5.4, another construction gives a lower bound for the size of the largest non-saturated critical set. We conjecture that these bounds are best possible. Using the results from Chapter 5, we obtain spectrum results on critical sets of the full n-Latin square in Chapter 6. In particular, we show that a critical set of each size between (n - 1)³ + 1 and n(n - 1)² + n - 2 exists. In Chapter 7, we turn our focus to the completability of partial k-Latin squares. The relationship between partial k-Latin squares and semi-k-Latin squares is used to show that any partial k-Latin square of order n with at most (n - 1) non-empty cells is completable. As Latin cubes generalize Latin squares, we attempt to generalize some of the results we have established on k-Latin squares so that they apply to k-Latin cubes. These results are presented in Chapter 8."],"dc:format.checksum.md5":["7fe5ce3e51196167c330e4593cb5d0a3","54ddfaae9e939fb9fe062bd0161afbd5","c1f6fda032a8b63f86b94d3425b1f514"],"dc:identifier.uri":["https://researchcommons.waikato.ac.nz/bitstreams/e890fb1a-6932-4cb6-928c-67921272a538/download"],"dc:publisher.institution":["University of Waikato"],"dc:relation.isreferencedby":["https://hdl.handle.net/10289/10557"],"dc:rights":["https://researchcommons.waikato.ac.nz/bitstreams/674ae035-550d-4edc-9f14-15336182e543/download","All items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated."],"dc:title":["Critical sets of full Latin squares"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T05:57:30Z"}