{"id":{"repo_id":"sdstate","oai_identifier":"oai:openprairie.sdstate.edu:etd2-1215"},"canonical_url":"https://search.ndltd.org/etd/sdstate/oai:openprairie.sdstate.edu:etd2-1215","repository":{"repo_id":"sdstate","name":"South Dakota State University","base_url":"https://openprairie.sdstate.edu/do/oai/"},"display":{"title":"Detailing the Connection Between a Family of Polar Graphs and Tremain Equiangular Tight Frames","abstract":"The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of equiangular tight frames using the geometry of a quadratic space over the field of four elements. We observe that these frames give rise to a strongly regular graph on a subset of points of a quadratic space over the field with 4 elements. We then demonstrate an isomorphism between this graph and a classical construction of polar graphs. While this family of graphs is known to exist, their construction using a Tremain ETF is much simpler, requiring the existence of Steiner triple systems and Hadamard matrices of the appropriate size, whereas the original constructions require computing intersections of hyperplanes.","abstract_html":"The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of equiangular tight frames using the geometry of a quadratic space over the field of four elements. We observe that these frames give rise to a strongly regular graph on a subset of points of a quadratic space over the field with 4 elements. We then demonstrate an isomorphism between this graph and a classical construction of polar graphs. While this family of graphs is known to exist, their construction using a Tremain ETF is much simpler, requiring the existence of Steiner triple systems and Hadamard matrices of the appropriate size, whereas the original constructions require computing intersections of hyperplanes.","abstract_has_math":false,"creators":["Brown, Nicholas"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation - Open Access","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["John Jasper"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T09:03:24Z","subjects":["Finite Fields","Frame Theory","Graph Theory","Mathematics"],"languages":[],"rights":[],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://openprairie.sdstate.edu/etd2/211","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://openprairie.sdstate.edu/etd2/211","record_label":"Repository record","record_kind":"record","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://openprairie.sdstate.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopenprairie.sdstate.edu%3Aetd2-1215","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["John Jasper"]},{"key":"dc:creator","label":"Author","values":["Brown, Nicholas"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2021-12-09T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2021-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation - Open Access"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Finite Fields","Frame Theory","Graph Theory","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openprairie.sdstate.edu/etd2/211"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of equiangular tight frames using the geometry of a quadratic space over the field of four elements. We observe that these frames give rise to a strongly regular graph on a subset of points of a quadratic space over the field with 4 elements. We then demonstrate an isomorphism between this graph and a classical construction of polar graphs. While this family of graphs is known to exist, their construction using a Tremain ETF is much simpler, requiring the existence of Steiner triple systems and Hadamard matrices of the appropriate size, whereas the original constructions require computing intersections of hyperplanes."]},{"key":"dc:title","label":"Title","values":["Detailing the Connection Between a Family of Polar Graphs and Tremain Equiangular Tight Frames"]}]}],"canonical_facts":{"dc:contributor":["John Jasper"],"dc:creator":["Brown, Nicholas"],"dc:date.available":["2021-12-09T08:00:00Z"],"dc:date.created":["2021-01-01T08:00:00Z"],"dc:description.abstract":["The relationship between strongly regular graphs and equiangular tight frames has been known for several years, and this relationship has been used to construct many of the most recent examples of new strongly regular graphs. In this paper, we present an explicit construction of a family of equiangular tight frames using the geometry of a quadratic space over the field of four elements. We observe that these frames give rise to a strongly regular graph on a subset of points of a quadratic space over the field with 4 elements. We then demonstrate an isomorphism between this graph and a classical construction of polar graphs. While this family of graphs is known to exist, their construction using a Tremain ETF is much simpler, requiring the existence of Steiner triple systems and Hadamard matrices of the appropriate size, whereas the original constructions require computing intersections of hyperplanes."],"dc:identifier":["https://openprairie.sdstate.edu/etd2/211"],"dc:rights":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["Finite Fields","Frame Theory","Graph Theory","Mathematics"],"dc:title":["Detailing the Connection Between a Family of Polar Graphs and Tremain Equiangular Tight Frames"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation - Open Access"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T09:03:24Z"}