A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such that each symbol appears precisely once in each row and column. A transversal of a latin square is a subset of cells that meets each row, column, and symbol precisely once.
There are many open and difficult questions about the existence and prevalence of transversals. We undertake a systematic study of collections of cells that exhibit regularity properties similar to those of transversals and prove numerous theorems about their existence and structure. We hope that our results and methods will suggest new strategies for the study of transversals.
The main topics we investigate are partial and weak transversals, weak orthogonal mates, integral weight functions on the cells of a latin square, applications of Alon's Combinatorial Nullstellensatz to latin squares, and complete mappings of finite loops.
","abstract_html":"<p>A latin square of order <em>n</em> is an <em>n</em> by <em>n</em> array whose entries are drawn from an <em>n</em>-set of symbols such that each symbol appears precisely once in each row and column. A transversal of a latin square is a subset of cells that meets each row, column, and symbol precisely once.</p> <p>There are many open and difficult questions about the existence and prevalence of transversals. We undertake a systematic study of collections of cells that exhibit regularity properties similar to those of transversals and prove numerous theorems about their existence and structure. We hope that our results and methods will suggest new strategies for the study of transversals.</p> <p>The main topics we investigate are partial and weak transversals, weak orthogonal mates, integral weight functions on the cells of a latin square, applications of Alon's Combinatorial Nullstellensatz to latin squares, and complete mappings of finite loops.</p>","abstract_has_math":false,"creators":["Pula, Jon Kyle"],"institution":null,"degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Petr Vojtechovsky, Ph.D.","Michael Kinyon","Rick Ball","Scott Leutenegger"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-01-01T08:00:00Z","date_published":"2011-01-01T08:00:00Z","updated_at":"2026-07-24T02:02:03Z","subjects":["Latin square","Orthogonal mate","Transversal","Mathematics"],"languages":["en"],"rights":["Copyright is held by the author. User is responsible for all copyright compliance.
"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.du.edu/etd/904","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Petr Vojtechovsky, Ph.D.","Michael Kinyon","Rick Ball","Scott Leutenegger"]},{"key":"dc:creator","label":"Author","values":["Pula, Jon Kyle"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2001-01-01T08:00:00Z"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Latin square","Orthogonal mate","Transversal","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright is held by the author. User is responsible for all copyright compliance.
"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.du.edu/etd/904"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such that each symbol appears precisely once in each row and column. A transversal of a latin square is a subset of cells that meets each row, column, and symbol precisely once.
There are many open and difficult questions about the existence and prevalence of transversals. We undertake a systematic study of collections of cells that exhibit regularity properties similar to those of transversals and prove numerous theorems about their existence and structure. We hope that our results and methods will suggest new strategies for the study of transversals.
The main topics we investigate are partial and weak transversals, weak orthogonal mates, integral weight functions on the cells of a latin square, applications of Alon's Combinatorial Nullstellensatz to latin squares, and complete mappings of finite loops.
"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Approximate Transversals of Latin Squares"]}]}],"canonical_facts":{"dc:contributor":["Petr Vojtechovsky, Ph.D.","Michael Kinyon","Rick Ball","Scott Leutenegger"],"dc:creator":["Pula, Jon Kyle"],"dc:date.available":["2001-01-01T08:00:00Z"],"dc:description.abstract":["A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such that each symbol appears precisely once in each row and column. A transversal of a latin square is a subset of cells that meets each row, column, and symbol precisely once.
There are many open and difficult questions about the existence and prevalence of transversals. We undertake a systematic study of collections of cells that exhibit regularity properties similar to those of transversals and prove numerous theorems about their existence and structure. We hope that our results and methods will suggest new strategies for the study of transversals.
The main topics we investigate are partial and weak transversals, weak orthogonal mates, integral weight functions on the cells of a latin square, applications of Alon's Combinatorial Nullstellensatz to latin squares, and complete mappings of finite loops.
"],"dc:format":["application/pdf"],"dc:identifier":["https://digitalcommons.du.edu/etd/904"],"dc:language":["en"],"dc:rights":["Copyright is held by the author. User is responsible for all copyright compliance.
"],"dc:subject":["Latin square","Orthogonal mate","Transversal","Mathematics"],"dc:title":["Approximate Transversals of Latin Squares"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."]},"updated_at":"2026-07-24T02:02:03Z"}