Abstract Title

Calculating Siegel Modular Forms

Additional Funding Sources

The project was supported by a University of Idaho Summer Undergraduate Research Fellowship made possible by a 2017-2018 Undergraduate Research Grant from the Higher Education Research Council/Idaho State Board of Education

Abstract

Siegel modular forms are intricate mathematical functions with unique properties. They appear in many places, such as physics, number theory, and geometry. The aim of this project was to create a code base for calculating Siegel modular forms. This process involves theoretically sorting infinite sets of equations into a finite number of smaller sets by identifying common properties. This code will eventually be used to verify examples of important conjectures in number theory.

Comments

W60

This document is currently not available here.

Share

COinS
 

Calculating Siegel Modular Forms

Siegel modular forms are intricate mathematical functions with unique properties. They appear in many places, such as physics, number theory, and geometry. The aim of this project was to create a code base for calculating Siegel modular forms. This process involves theoretically sorting infinite sets of equations into a finite number of smaller sets by identifying common properties. This code will eventually be used to verify examples of important conjectures in number theory.