## Student Research

**Daniel Byrnes '15**

*Extreme Value Theory and Backtest Overfitting in Finance*

Advisor: Thomas Pietraho

Using tools from extreme value theory, Daniel proposed a new statistic, the minimum back test length at level p, to determine whether a multi-parameter investment strategy has the potential to be overfit and its future returns may be poorly predicted by its performance on historical market backtest data.

**Maxwell Wolf '15**

*(Independent Summer Study): Exploring Chaos Theory Through Art*

Advisor: Michael King

Max studied Chaos Theory, with the goal to tie together both his major in mathematics and his minor in visual arts. Chaos modeling describes non-linear dynamic systems like weather systems and turbulence in liquids and gasses, and creates incredibly intricate images of fractals. Max's studies culminated in a campus-wide exhibit at the Main Gallery in the Edwards Center for Art and Dance where he demonstrated the beauty of chaos while simultaneously defining, explaining, and attempting to teach the mathematical complexity of the theory to the gallery viewers. Max says this project allowed him to explore and appreciate how math and art intersect and illuminate each other.

**Sharif Younes '13**

*(NSF-funded Research student): Finite state machines and Thompson’s group F*

Advisor: Jennifer Taback

Finite state machines such as finite state automata and pushdown automata are used in computer science to model simple “languages.” In group theory, one often hopes to show that the elements of a group can be described by one of these machines and that such a machine can recognize group multiplication; if so, many computational questions are easily solvable in the group. Such groups are called “automatic” or “context-free” depending on the type of machine used. Sharif is investigating whether Thompson’s group F is “Cayley graph context-free” by constructing pushdown automata recognizing group elements and multiplication. This project lies at the intersection of mathematics and theoretical computer science.

**Emma Chiappetta '11
**

*Cayley-Klein Geometries.*

Advisor: William Barker

Emma studied the Cayley-Klein geometries from several different viewpoints, most notably those of Jürgen Richter-Gebert and I. M. Yaglom. She read in detail original papers by Klein, Beltrami, and Sommerville, and proved several of her own conjectures about these geometries. She concentrated on the classification of the planar Cayley-Klein geometries as nine subgeometries of the projective plane—subgeometries that include Euclidean hyperbolic, elliptic, Minkowskian, and Galilean. This supports Cayley's famous quote that "Projective geometry is all geometry."

**Elizabeth Wong '11**

Advisor: Mary Lou Zeeman

Elizabeth modeled networks of cells in the pituitary. Recent experiments in rodents show that each cell type in the pituitary forms a 3-d network of chains, connected by cell clusters. As the animal grows, the cluster-to-chain ratio in the cell network changes. This change in network architecture correlates with a more synchronized release of hormone from the cells. Elizabeth used computational models to investigate whether the change in network architecture can explain the increased synchrony in hormone output.

**Emma Cutler '13**, Clare Boothe Luce Fellow.

**Amanda Gartside '12**, NSF Math Climate Research Network grant

**Carolyn Mayer '13**, NSF Math Climate Research Network grant

Advisor: Mary Lou Zeeman

This team works with the Mathematics and Climate Research Network (MCRN) to study dynamical models of paleoclimate. The research goal is to use tools of differential equations and dynamical systems to investigate the feedback effects of different climate processes on each other and on global climate. We are focusing on the interaction between carbon, earth orbitals and ice-albedo feedback in the earth’s glaciation cycles.

**Felicity Hills '13
**

**Jane Carpenter '13**

**Elena Crosley '13**

*Computational Sustainability NSF grant.*

This team works on the fishery models. The goal is to develop a model that can include the ecological interactions of some key species. This requires adding some age structure to the classic models.

**Sharon Ulery '11
** (Independent Study): Properties of sets of elements in Thompson’s group F

Advisor: Jennifer Taback

This project involved learning about Thompson’s group F, an example of an infinite, finitely generated group. Sharon used the techniques developed by Susanna Kimport as part of her honors project to select large sets of elements of this group, and statistically analyze certain properties of these elements. These sets were not taken randomly, and were used to verify that Kimport’s algorithms ran equally quickly on a variety of types of elements.

**
**Brian Wu '11

*(Honors Thesis), Algebraic Geometry*

Advised by Thomas Pietraho

**Christina Argueta '11**

*(Honors Project): Constructing minimal length representatives for elements of Thompson’s group F*

Advisor: Jennifer Taback

When studying a finitely generated infinite group described using generators and relations, a natural question is to ask for the minimal number of generators necessary to represent a given group element. Christina studied this problem for Thompson’s group F, building on work of Professor Taback and Micah Miller ’04. Christina was able to give combinatorial conditions governing the creation of these ``minimal length representatives” for many elements of this group. Her results were based on a combination of group theory and insight into the particular group studied, and illustrated the interaction between the varied techniques used to study this group.

**Harrison Chapman '11**

*(Honors Thesis), Nilpotent Orbits of Lie Groups*

Advised by Thomas Pietraho

**Will Richard '11**

*(Independent Study): Folner sets and amenability in Thompson’s group F*

Advisor: Jennifer Taback

This project involved studying one of the most famous open questions related to Thompson’s group F, and investigating whether one could produce sets of elements with certain graph-theoretic properties within the Cayley graph of this group. This first involved an understanding of what a Cayley graph of a group is, and how one associates a geometric picture with a particular group. To complete this project, Will studied a variety of techniques developed by research mathematicians to understand the elements of this group and multiplication within the group. These techniques included algebraic, geometric and combinatorial aspects. Some of Will’s numerical estimates relied on counting formulae from combinatorics related to counting binary trees with particular properties. Will also used simulations constructed with the computer program Mathematica as part of his project.

**Kim Ayers '10 **

*Stochastic Perturbations of the Fitzhigh-Nagumo Equations*

Advisors: Adam Levy and Mary Lou Zeeman

Kim used stochastic perturbation techniques she learned in a summer research project at Iowa State U. to model the effect of neural noise in the context of the classical Fitzhugh-Nagumo equations for the nerve impulse. The classical equations can capture action potentials and tonic firing of a neuron, but not the more complex patterns of bursting (periods of firing interleaved with periods of quiescence). Kim incorporated stochastic noise into the Fitzhugh-Nagumo equations, representing stochastic opening and closing of ion channels, for example, and showed that the stochastic model was able to exhibit a range of bursting behaviors observed in neurons.

**Mark McGranaghan '09**

*(Independent Study): Random selection of elements in Thompson’s group F*

Advisor: Jennifer Taback

This project involved formalizing the notion of selecting an element of a group at random. The group used was Thompson’s group F, and a technique to select elements uniformly published in a paper by Elder, Fusy and Reichnitzer was implemented. Mark then used his program to select large sets of random elements and gather statistical data about their “geometric” properties. Every element of Thompson’s group can be represented by a pair of finite rooted binary trees, and some unexpected conclusions were found in statistics about the shape of these trees.

**Susanna Kimport '09**

*(Honors Project): An algorithm for computing word length in Thompson’s group F*

Advisor: Jennifer Taback

This project investigated the feasibility of implementing a computational technique developed by Matt Horak, Melanie Stein and Jennifer Taback for computing word length of elements in Thompson’s group F. After showing that implementing the simplest case of the technique is an NP-complete problem, Kimport developed a practical “smart brute-force” algorithm which computed the correct values very quickly. This project involved a mix of techniques from advanced mathematics, theoretical computer science, and computer

**Will Richard '11**

*(Independent Study): Folner sets and amenability in Thompson’s group F*

Advisor: Jennifer Taback

This project involved studying one of the most famous open questions related to Thompson’s group F, and investigating whether one could produce sets of elements with certain graph-theoretic properties within the Cayley graph of this group. This first involved an understanding of what a Cayley graph of a group is, and how one associates a geometric picture with a particular group. To complete this project, Will studied a variety of techniques developed by research mathematicians to understand the elements of this group and multiplication within the group. These techniques included algebraic, geometric and combinatorial aspects. Some of Will’s numerical estimates relied on counting formulae from combinatorics related to counting binary trees with particular properties. Will also used simulations constructed with the computer program Mathematica as part of his project.

**Anh Tran '10**

*Neural Nets and Finance*

Advised by Thomas Pietraho

**Erin Taylor '09**

*Feedback in Lobster Cardiac Oscillations*

Advisors: Patsy Dickinson, Adam Levy and Mary Lou Zeeman

**Liz Chertavian '09**

*Inversion of a Firn Air Diffusion Model to Determine Atmospheric Gas Concentration Histories*

Advisors: Mark Battle, Adam Levy and Mary Lou Zeeman

As snow falls onto a glacier, it compacts the snow below it slowly until it becomes ice. This glacial snow on top of the ice is called firn. While ice has bubbles of air surrounded entirely by ice, the firn has channels of open air space, called the firn air, that run from the surface of the snow down to the close off region where the snow becomes denser ice. The goal of Liz’s thesis was to improve the mathematical method for determining the atmospheric history of concentrations of greenhouse gases from their current concentrations in the firn air channels. This firn air contains the history for the last 100 years (then the ice cores take over).

Ben Johnson, Network Similarity and Shape Recognition, Fall, 2011.

Advised by Thomas Pietraho

Octavian Neamtu, Generalization of the Landmark Method in Shape Recognition, Fall, 2011.

Advised by Thomas Pietraho

Arsenyi Sheydvasser (Honors Thesis), Advanced Functional Analysis, Fall, 2011.

Advised by Thomas Pietraho

Jonathan Ackerman, Generating Functions and Phylogenetic Trees, Spring, 2011.

Advised by Thomas Pietraho

Sean Wilner (Honors Thesis), Algebraic Geometry, 2010–2011.

Advised by Thomas Pietraho

Leah Wolberg (joint with N. Kieserman), Orbifolds, Spring, 2010.

Advised by Thomas Pietraho

Sean Wilner (joint with N. Kieserman), Orbifolds, Spring, 2010.

Advised by Thomas Pietraho

Mark McGranaghan, Neural Nets and Pattern Recognition, Fall, 2009.

Advised by Thomas Pietraho

Michael Krohn, Financial Mathematics, Spring, 2009.

Advised by Thomas Pietraho

Sarah Landrum, Financial Mathematics, Spring, 2009.

Advised by Thomas Pietraho