Date of Award

11-2024

Degree Type

Thesis

Degree Name

Master of Science

Department

Math and Computer Science

Program

Mathematics (MS)

First Advisor/Chairperson

Daniel Rowe

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.

Access Type

Open Access

Download

Included in

Algebra Commons

Share

COinS