There exist a multitude of computational tools available to mathematicians, such as interactive and automated theorem provers, finite counter-example generators, and computer algebra systems, most of which have a complicated installation process, unintuitive syntax, a lack of comprehensiveness for mathematical structures, or some combination of these. Computer algebra systems are indispensable tools due to their capacity for creating mathematical objects and performing computations on them. However, there is a lack of computational resources that focus on dealing with explicit examples, and extracting the properties thereof, especially for the most basic algebraic structures. Here, we will dive into several prominent computer algebra systems and their capabilities, and isolate some of the unfortunate mechanics or other assets of these systems. Afterwards, we will traverse a novel computer algebra system with a primary focus on manipulation and property extraction of the most basic algebraic structures. This system aims to serve mathematicians with little programming experience by keeping the syntax simple and intuitive, extensible, and easy to learn.
","abstract_html":"<p>There exist a multitude of computational tools available to mathematicians, such as interactive and automated theorem provers, finite counter-example generators, and computer algebra systems, most of which have a complicated installation process, unintuitive syntax, a lack of comprehensiveness for mathematical structures, or some combination of these. Computer algebra systems are indispensable tools due to their capacity for creating mathematical objects and performing computations on them. However, there is a lack of computational resources that focus on dealing with explicit examples, and extracting the properties thereof, especially for the most basic algebraic structures. Here, we will dive into several prominent computer algebra systems and their capabilities, and isolate some of the unfortunate mechanics or other assets of these systems. Afterwards, we will traverse a novel computer algebra system with a primary focus on manipulation and property extraction of the most basic algebraic structures. This system aims to serve mathematicians with little programming experience by keeping the syntax simple and intuitive, extensible, and easy to learn.</p>","abstract_has_math":false,"creators":["Korf, Skylar"],"institution":null,"degree_name":"Master of Science","degree_level":"Thesis","degree_discipline":"Math and Computer Science","degree_department":null,"school":null,"contributors":["Daniel Rowe"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-11-01T07:00:00Z","date_published":"2024-11-01T07:00:00Z","updated_at":"2026-07-24T03:24:36Z","subjects":["magma","semigroup","monoid","quasigroup","loop","group","python","computer algebra system","Algebra"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://commons.nmu.edu/theses/864","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daniel Rowe"]},{"key":"dc:creator","label":"Author","values":["Korf, Skylar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2024-11-15T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Math and Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["magma","semigroup","monoid","quasigroup","loop","group","python","computer algebra system","Algebra"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://commons.nmu.edu/theses/864"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["There exist a multitude of computational tools available to mathematicians, such as interactive and automated theorem provers, finite counter-example generators, and computer algebra systems, most of which have a complicated installation process, unintuitive syntax, a lack of comprehensiveness for mathematical structures, or some combination of these. Computer algebra systems are indispensable tools due to their capacity for creating mathematical objects and performing computations on them. However, there is a lack of computational resources that focus on dealing with explicit examples, and extracting the properties thereof, especially for the most basic algebraic structures. Here, we will dive into several prominent computer algebra systems and their capabilities, and isolate some of the unfortunate mechanics or other assets of these systems. Afterwards, we will traverse a novel computer algebra system with a primary focus on manipulation and property extraction of the most basic algebraic structures. This system aims to serve mathematicians with little programming experience by keeping the syntax simple and intuitive, extensible, and easy to learn.
"]},{"key":"dc:title","label":"Title","values":["Magpy: A Python Package for Magmas"]}]}],"canonical_facts":{"dc:contributor":["Daniel Rowe"],"dc:creator":["Korf, Skylar"],"dc:date.available":["2024-11-15T08:00:00Z"],"dc:description.abstract":["There exist a multitude of computational tools available to mathematicians, such as interactive and automated theorem provers, finite counter-example generators, and computer algebra systems, most of which have a complicated installation process, unintuitive syntax, a lack of comprehensiveness for mathematical structures, or some combination of these. Computer algebra systems are indispensable tools due to their capacity for creating mathematical objects and performing computations on them. However, there is a lack of computational resources that focus on dealing with explicit examples, and extracting the properties thereof, especially for the most basic algebraic structures. Here, we will dive into several prominent computer algebra systems and their capabilities, and isolate some of the unfortunate mechanics or other assets of these systems. Afterwards, we will traverse a novel computer algebra system with a primary focus on manipulation and property extraction of the most basic algebraic structures. This system aims to serve mathematicians with little programming experience by keeping the syntax simple and intuitive, extensible, and easy to learn.
"],"dc:identifier":["https://commons.nmu.edu/theses/864"],"dc:subject":["magma","semigroup","monoid","quasigroup","loop","group","python","computer algebra system","Algebra"],"dc:title":["Magpy: A Python Package for Magmas"],"thesis:degree_discipline":["Math and Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T03:24:36Z"}