Open Access. Powered by Scholars. Published by Universities.®

Number Theory Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Number Theory

A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero Jan 2016

A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero

Undergraduate Honors Thesis Collection

This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.


Integer Generalized Splines On The Diamond Graph, Emmet Reza Mahdavi Jan 2016

Integer Generalized Splines On The Diamond Graph, Emmet Reza Mahdavi

Senior Projects Spring 2016

In this project we extend previous research on integer splines on graphs, and we use the methods developed on n-cycles to characterize integer splines on the diamond graph. First, we find an explicit module basis consisting of flow-up classes. Then we develop a determinantal criterion for when a given set of splines forms a basis.


A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot Jan 2016

A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot

Electronic Theses and Dissertations

Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …