{"id":{"repo_id":"arizona-thes","oai_identifier":"oai:repository.arizona.edu:10150/664987"},"canonical_url":"https://search.dev.ndltd.org/etd/arizona-thes/oai:repository.arizona.edu:10150/664987","repository":{"repo_id":"arizona-thes","name":"University of Arizona","base_url":"https://repository.arizona.edu/oai/request"},"display":{"title":"Algorithms for Finite Dimensional Algebras Over Finite Fields Using Basic Algebras","abstract":"This dissertation describes algorithms for computing information about finite dimensional associative algebra over a finite field. In particular, we provide algorithms for computing a basis, the lattice of two-sided ideals, the center, and the unit group for a finite dimensional associative algebra over a finite field.The primary strategy employed is to first compute the basic algebra using the techniques described by J. Carlson and G. Matthews in [CM06], then perform computations in the basic algebra where possible. The algorithms described in the dissertation have been implemented in GAP as a package called Basic Algebras from Matrix generators by the author. Timings for this implementation are provided.","abstract_html":"This dissertation describes algorithms for computing information about finite dimensional associative algebra over a finite field. In particular, we provide algorithms for computing a basis, the lattice of two-sided ideals, the center, and the unit group for a finite dimensional associative algebra over a finite field.The primary strategy employed is to first compute the basic algebra using the techniques described by J. Carlson and G. Matthews in [CM06], then perform computations in the basic algebra where possible. The algorithms described in the dissertation have been implemented in GAP as a package called Basic Algebras from Matrix generators by the author. Timings for this implementation are provided.","abstract_has_math":false,"creators":["Elert, Eric Alan"],"institution":"The University of Arizona.","degree_name":"Ph.D.","degree_level":"doctoral","degree_discipline":"Graduate College","degree_department":null,"school":null,"contributors":[],"advisors":["Lux, Klaus"],"committee_chairs":[],"committee_members":["Pickrell, Douglas","Xue, Hang","Kececioglu, John"],"year":2022,"date_issued":"2022","date_published":"2022","updated_at":"2026-07-24T00:57:45Z","subjects":[],"languages":["en"],"rights":["Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction, presentation (such as public display or performance) of protected items is prohibited except with permission of the author."],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10150/664987","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lux, Klaus"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Pickrell, Douglas","Xue, Hang","Kececioglu, John"]},{"key":"dc:creator","label":"Author","values":["Elert, Eric Alan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-06-09T02:35:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-06-09T02:35:21Z"]},{"key":"dc:date.issued","label":"Date","values":["2022"]},{"key":"dc:publisher","label":"Institution","values":["The University of Arizona."]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Graduate College","Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Arizona"]}]},{"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 © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction, presentation (such as public display or performance) of protected items is prohibited except with permission of the author."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10150/664987"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation describes algorithms for computing information about finite dimensional associative algebra over a finite field. In particular, we provide algorithms for computing a basis, the lattice of two-sided ideals, the center, and the unit group for a finite dimensional associative algebra over a finite field.The primary strategy employed is to first compute the basic algebra using the techniques described by J. Carlson and G. Matthews in [CM06], then perform computations in the basic algebra where possible. The algorithms described in the dissertation have been implemented in GAP as a package called Basic Algebras from Matrix generators by the author. Timings for this implementation are provided."]},{"key":"dc:title","label":"Title","values":["Algorithms for Finite Dimensional Algebras Over Finite Fields Using Basic Algebras"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lux, Klaus"],"dc:contributor.committeemember":["Pickrell, Douglas","Xue, Hang","Kececioglu, John"],"dc:creator":["Elert, Eric Alan"],"dc:date.accessioned":["2022-06-09T02:35:21Z"],"dc:date.available":["2022-06-09T02:35:21Z"],"dc:date.issued":["2022"],"dc:description.abstract":["This dissertation describes algorithms for computing information about finite dimensional associative algebra over a finite field. In particular, we provide algorithms for computing a basis, the lattice of two-sided ideals, the center, and the unit group for a finite dimensional associative algebra over a finite field.The primary strategy employed is to first compute the basic algebra using the techniques described by J. Carlson and G. Matthews in [CM06], then perform computations in the basic algebra where possible. The algorithms described in the dissertation have been implemented in GAP as a package called Basic Algebras from Matrix generators by the author. Timings for this implementation are provided."],"dc:identifier.uri":["http://hdl.handle.net/10150/664987"],"dc:language.iso":["en"],"dc:publisher":["The University of Arizona."],"dc:rights":["Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction, presentation (such as public display or performance) of protected items is prohibited except with permission of the author."],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Algorithms for Finite Dimensional Algebras Over Finite Fields Using Basic Algebras"],"dc:type":["text","Electronic Dissertation"],"thesis:degree_discipline":["Graduate College","Mathematics"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Arizona"]},"updated_at":"2026-07-24T00:57:45Z"}