Center for Nonlinear Analysis
CNA Home
People
Seminars
Publications
Workshops and Conferences
CNA Working Groups
CNA Comments Form
Summer Schools
Summer Undergraduate Institute
PIRE
Cooperation
Graduate Topics Courses
SIAM Chapter Seminar
Positions
Contact 
2015 Summer Undergraduate Applied Mathematics Institute
May 26  July 21, 2015
► Students
► Faculty
Projects:
 Giuga Ideals, Duncan Gichimu, Kerrek Stinson (download paper)
Advisor: Greggo Johnson
Abstract: In 1950, Giussipe Giuga conjectured that an integer $n$ satisfies $\sum\limits_{k=1}^{n1} k^{n1} \equiv 1 \pmod{n}$ if and only if $n$ is prime. Sixtyfive years later and this problem is yet to be solved. The complexity of working in the integers has indeed proven challenging. To explore this problem further, we consider the Generalized Giuga Conjecture for ideals in number rings. We introduce the idea of correspondence between weak Giuga numbers and weak Giuga ideals. These concepts are further developed in the quadratic extensions.

Ant Colony Optimization Applied to the Bike Sharing Problem, Cashous Bortner, Can Gürkan (download paper)
Advisor: Brian Kell
Abstract: In this study, we analyze a single vehicle capacitated pickup and deliv ery problem, namely the bike sharing problem as seen in bike sharing systems around the world. We investigate previous works and formulate our own, novel algorithm for solving the bike sharing problem which is based on an ant colony optimization heuristic. Our algorithm takes into account the total distance traveled, and the distribution of the bikes within the system. We then test our algorithm on random data samples as well as real world data in order to compare our algorithm to other formulations.
 Subrings of $\mathbb{C}$ Generated by Angles, Jackson Bahr, Arielle Roth (download paper)
Advisor: Greggo Johnson
Abstract: In [1], Buhler et al. considered the following scenario. Given a collection $U$ of unit magnitude complex numbers and a set $S$ of constructed points initially containing just $0$ and $1$, through each constructed point draw lines whose angles with the real axis are in $U$. The intersections of such lines are also constructed points. Upon taking the closure we form a set $R(U)$. They investigated which $U$ result in $R(U)$ being a ring.
Our main result holds for when $1 \in U$ and $\vert{U}\vert \ge 4$. We classify $R(U)$ as the set of linear combinations of elementary monomials which are the points constructed in the first step. The coefficients are taken from $Z[P] = R(U) \cap R$ which is easily calculated. We also show that when $\vert{U}\vert \ge 4$, $R(U)$ is dense in the complex plane. Furthermore, we classify $R(U)$ completely for when $1 \in U$ and $\vert{U}\vert \ge 3$, showing that $R(U)$ is a ring whenever one of the points constructed in the first step is a quadratic integer.
 Rainbow Numbers with Respect to $2$Matchings and $3$Matchings, Kate Borst, Jüergen Kritschgau (download paper)
Advisor: Michael Young
Abstract: Our results focus on the rainbow numbers of the various graphs with respect to $M_2$ and $M_3$. We find the rainbow numbers for all graphs with respect to $M_2$. From then on out, the number of troublesome cases increases for rainbow numbers with respect to $M_3$. We prove that the rainbow numbers of trees with a diameter of 6 or greater have $rb(T,M_3)=\Delta +2$. We extend this result to all graphs with diameter 6 or greater. Our results suggest that $rb(G, M_3)= \Delta +2$ for unconnected graphs $G$; this is an area for further study.

Exploring the use of hyperheuristics to solve a dynamic bikesharing problem, Emily Myers, Ghofran Shaker ( download paper)
Advisor: Brian Kell
Abstract: In a selfservice bikeshare system we have a finite number of stations with limited capacity. In any realworld situation, some stations will have more demand than others and will accumulate or lose bikes. The system operator must use vehicles to pick up the bikes from full stations and redistribute them in empty ones. We define the problem and explore a hyperheuristic approach previously used successfully to solve the Vehicle Routing Problem.
