NUMS Student Presentations and Poster Session

Nathan Gibson


Talk Subject: Topology

  • Duot Chol Gak, University of British Columbia
    Mathematics of Topology
    (Not Published)
    preservation of structures under extreme circumstances. e.g Houses in Tsunami, Bumpers of cars,
    Time: Thursday, February 18, 2016 - 14:30
    Comments: is this for real?
  • Allison Stacey*, Oregon State University
    A Basis for the Space if Order 5 Chord Diagrams
    In the study of Vassiliev Knot Invariants, the algebra of chord diagrams plays a key role. A chord diagram of order n is a circle with 2n vertices around it with chords through the circle connecting the vertices pairwise. The algebra of such diagrams is isomorphic to closed Jacobi diagrams which are trivalent graphs with 2n vertices and a circle around the edge but here the vertices are inside the circle. I used the relationship between these two algebras to find a basis for each in order 5. I write up my results as art pieces so this talk will include many pieces of my art.
    Time: Saturday, April 2, 2016 - 13:45
    Room Number: STAG 160
  • Brett Hegge*, Western Oregon University
    From Manipulatives to Theory in Knot Theory
    Knot Theory is the study of simple closed curves in three dimensions. Complicated structures can be analyzed using three basic moves and knots can be shown to be equivalent. We discuss ways of using physical manipulation to get middle school students interested in mathematics. We also, explore the basic mathematical postulates and theoretical foundation of Link/Knot Theory.
    Time: Saturday, April 2, 2016 - 14:05
    Room Number: STAG 160
  • Anthony Dominquez*, Western Oregon University
    Separability and the Cantor Set
    The Cantor Set is a famous set in point-set topology. There are a wide variety of types of Cantor Sets. However, we will only cover the ternary, or standard Cantor Set. In this talk, we will define and discuss what it means for a set to be separable and prove that the Cantor Set satisfies this definition.
    Time: Saturday, April 2, 2016 - 14:25
    Room Number: STAG 160
  • Ryan Lattanzi*, Gonzaga University
    Bryan Strub*, Gonzaga University
    Hayley Olson, Gonzaga University
    Klein links versus torus links, part I
    We will examine the relationship between Klein links and torus links, using both diagrammatic techniques and link invariants. We begin with definitions of these links and some basic results about Klein links.
    Time: Saturday, April 2, 2016 - 14:45
    Room Number: STAG 160
    Comments: Please omit the previous abstract submitted by Ryan Lattanzi. Avoid Kearny morning talk.
  • Hayley Olson*, Gonzaga University
    Bryan Strub*, Gonzaga University
    Ryan Lattanzi, Gonzaga University
    Klein links versus torus links, part II
    We will examine the relationship between Klein links and torus links, using both diagrammatic techniques and link invariants. We determine the types of components in a Klein link, and use this result to look at which Klein links are torus links and which are not.
    Time: Saturday, April 2, 2016 - 15:05
    Room Number: STAG 160
    Comments: This is a continuation of the other talk with the same authors.

Talk Subject: Ordinary Differential Equations and Dynamical Systems

  • Noah Walton*, Portland State University
    Elisa Bellah, University of Oregon
    Erin Tannenbaum, Portland State University
    Derek Garton, Portland State University
    Heuristics for Cycles of Polynomials Over Finite Fields
    (Not Published)
    In 2014, Flynn and Garton bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. In many cases, their lower bound matched Kruskal's asymptotic for random functional graphs. Their upper bound was far less satisfactory, as it was far from Kruskal's bound. In our work, we introduce a heuristic for counting cycles in functional graphs. For any set of points with pairwise distinct abscissae, the heuristic states that two conditions are close to independent (off by an asymptotic term). 1) That the points lie on a polynomial of fixed degree, and 2) that the directed edges of the corresponding functional graph form a cycle. We then prove that this heuristic implies that the average number of graph components of a polynomial of fixed degree over a finite field is close to the same as the average number of components of a random functional graph.
    Time: Tuesday, March 15, 2016 - 17:00
    Comments: Talk Subject: Discrete Dynamical Systems "After looking more at this, I realize I won't be able to go."
  • Svetlana Dyachenko*, Western Oregon University
    Equations for Bacteria Growth
    Bacteria growth is really important in our life. Some bacteria cells help us overcome different diseases, while others bring those diseases to us. We have learned to produce medicine with help of bacteria growth, like insulin, to help those who are ill. Modeling bacteria growth is an important part of understanding it. Consider a situation of bacteria doubling every half an hour starting with one cell, how much time will it take to fill all the oceans on Earth? Questions like this are answered by developing mathematical models of bacteria growth. We examine modeling bacteria growth using differential equations. Our focus is on model construction and building realistic models that match empirical data.
    Time: Saturday, April 2, 2016 - 13:45
    Room Number: STAG 162
    Comments: could also go in math modeling
  • Steven Beres*, Gonzaga University
    Caleb Tjelle*, Gonzaga University
    An Elementary Analysis of Chua's Circuit
    Prior to the invention of Chua's circuit by Leon Chua in 1983, it was generally believed that it was not possible to design an electronic oscillator which exhibited chaos. In this talk, we provide an overview and analysis of Chua’s chaotic circuit. Principally, we will show the nondimensionalization of the model and a bifurcation analysis for the case where all passive circuit elements have positive values. This analytical approach will be further illustrated by numerical solutions to the state equations for selected parameter values. Finally, we will compare our theoretical results with the output of a circuit simulator and also with measured results from a physical implementation of Chua's circuit. Previous experience with circuit analysis is not necessary to understand this talk.
    Time: Saturday, April 2, 2016 - 14:05
    Room Number: STAG 162
  • Aubrey Ibele*, Gonzaga university
    Audrey Gomez*, Gonzaga University
    Dynamic of Love
    Dynamical systems both linear and non-linear have the power to describe intricate behavior and provide analysis. In this paper, linear and non-linear models are employed to replicate the interaction between individuals with varying romantic styles. Using traditional analysis methods the goal was to examine the models laid out in Sprott of the dynamic phenomena of love. The graphical outputs and implications between the simple linear and two-dimensional non-linear models were compared; despite identical initial conditions, results varied. This showcases the impact that a variation of parameters has on the system. The non-linear model had an additional logistic function, which made the system more realistic by adding the possibility for emotional reactions. Predictions suggest that with the addition of more parameters, the dynamical system will diverge to chaos.
    Time: Saturday, April 2, 2016 - 14:25
    Room Number: STAG 162
  • Thomas Burns*, Southern Oregon University
    Jacob Schultz*, Southern Oregon University
    How to Take a Hot Bath, if You Can Spare the CPU Cycles
    We discuss multiple methods for modelling the temperature of a bathtub taking into account conductance, evaporation, and turbulence. One model uses a system of ordinary differential equations to represent the temperature with respect to time of multiple materials in the system, while another discretizes the space into uniform cubes propagating heat at discrete time steps.
    Time: Saturday, April 2, 2016 - 14:45
    Room Number: STAG 162
  • McKenzie Garlock*, Eastern Oregon University
    Jeremy Bard*, Eastern Oregon University
    Zach Nilsson*, Eastern Oregon University
    Mathematical Modeling of Heat Through a Hot Bath
    No one likes a cold bath. When the bath water starts to get cold a person might turn on a constant trickle of water to keep the water tepid. We attempted to model, and optimize, this behavior with differential equations. To do this we simplified the situation and started with a bathtub that had only water in it. We were able to model the heat flow through the bath water using a simple “lumped system” analysis that broke the tub up into 10 equal “plates” of water. The first of these plates was assumed to stay at a constant temperature because of the continual introduction of hot water from the tap. That first plate would then pass some of its heat to the next plate according to thermal conductance and Newton’s Law of Cooling. This model assumed that no heat was lost anywhere in the system except to the next plate of water. To add an element of realism we then added heat loss to the air above each plate. We then attempted to add a person to the tub. We treated the person as if they were a “Heat Sink”. Meaning that they take in heat but their temperature never changes. The rate of heat transfer between the water and the person required different physics from those that we had been using to model the heat flow through the homogeneous tub. We approximated this different rate by using the ratio of the thermal conductance's of water and a person. We also distributed the person’s mass evenly in each plate. This model worked reasonably well. Showing that the water in the tub would all reach the temperature of the incoming water. We then attempted to distribute the person’s mass throughout the tub in a more realistic way, with more mass towards the back of the tub. To do this we introduced a mass ratio term to our equations. This ratio of water mass to person mass did not have the desired results. The water at the back of the tub would continue to decline in temperature, seemingly unaffected by the incoming hot water. This discrepancy is mostly likely caused by the person absorbing more heat than they actually would in reality. The effect of the person’s movements was not included in our models. The shape of the tub was also not explored; our models assume either a perfectly rectangular tub or a perfectly hemispherical tub.
    Time: Saturday, April 2, 2016 - 15:05
    Room Number: STAG 162

Talk Subject: Combinatorics

  • Ian Kit Nicolas*, Pacific University
    Proper Graph Colouring via Combinations
    (Not Published)
    We develop a new type of proper graph colouring that makes use of a number of colours at most the chromatic number. Proper graph colouring refers to the assignment of labels onto vertices of a graph such that adjacent vertices have distinct labels. This new proper graph colouring, called versicolouring, emerges from a natural way to combine colours via combinations, not unlike combining colours of paint. Versicolouring assigns sets of colour combinations to each vertex such that the sets are completely disjoint for adjacent vertices. We also introduce a weaker version of versicolouring, aptly called weak-versicolouring, which relaxes the completely disjoint condition. Similar to the chromatic number, graphs have a versichromatic number (and weak-versichromatic number) which denotes the minimum number of colours needed to versicolour (and weak-versicolour) a graph. We determine the necessary and sufficient conditions under which the versichromatic number and weak-versichromatic number is at most the chromatic number for any (simple) graph. In addition, we enumerate the number of versicolourings and weak-versicolourings on certain families of graphs such as the complete graphs $K_n$. In doing so we also determine the versichromatic number and weak-versichromatic number of these families of graphs. This enumeration is done indirectly through a natural bijection between versicolourings on $K_n$ and non-attacking rook arrangements in multiple dimensions. We also introduce a weaker form called partial non-attacking rook arrangements both in the natural $2$-dimension case and in higher dimensions. There is a natural bijection between partial non-attacking rook arrangements and weak-versicolourings on $K_n$ which is used to enumerate weak-versicolourings on $K_n$.
    Time: Saturday, April 2, 2016 - 09:00
    Comments: Cancelled!
  • Amanda Evola*, Western Oregon University
    Examining Ramsey Numbers
    This paper explores the work of Frank P. Ramsey who founded Ramsey’s Theorem and is centered on the fact that complete disorder is impossible. The goal is to dig into Ramsey’s Theory by examining various Ramsey Numbers and bounds. Through this examination of Ramsey Numbers we will begin to see how we can reach structures arbitrarily large and be able to guarantee substructure through the proof of Ramsey’s Theorem.
    Time: Saturday, April 2, 2016 - 11:15
    Room Number: STAG 261
  • Kyle Oddson*, Portland State University
    Math and Sudoku: Exploring Sudoku boards through graph theory, group theory, and combinatorics
    Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem regarding the associated partial chromatic polynomial; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.
    Time: Saturday, April 2, 2016 - 11:35
    Room Number: STAG 261
    Comments: Talk involves graph theory, combinatorics, and group theory
  • Omid Khormali*, University of Montana
    On the Turan number of forests (Canelled)
    A well-known conjecture of Erd\H os and S\'{o}s states that the Tur\'{a}n number for paths is enough for any tree i.e. a graph $G$ on $n$ vertices and more than $\frac{k-2}{2}n$ edges contains any tree on $k$ vertices. A natural extension of the problem is the determination of the Tur\'{a}n number of forests. Erd\H os and Gallai considered the graph $H$ consisting of $k$ independent edges. Brandt generalized Erd\H os and Gallai's result by proving that the Tur\'{a}n number for $k$ independent edges is enough for any forest on $k$ edges without isolated vertices. Bushaw and Kettle found the Tur\'{a}n number and extremal graph for the forest with components, which are paths, of the same order $l>2$. \\ Recently, Lidick\'{y}, Liu and Palmer generalized these results by finding the Tur\'{a}n number and extremal graph for the forests with components of paths with arbitrary length. Also, they investigated Tur\'{a}n number for a star forest $F=\cup_{i=1}^{k}{S_{i}}$ where $d_{i}$ is the maximum degree of $S_{i}$ and $d_{1}\geq \dots \geq d_{k}$, and the Tur\'{a}n number for forests with all components of order 4.\\ In this paper, we determine the Tur\'{a}n number of the forest $F=a\cdot P_{\ell}\cup b\cdot S_{t}$ i.e. $a$ disjoint copies of path $P_{\ell}$ and $b$ disjoint copies of star $S_{t}$. In addition, we obtain the Tur\'{a}n number for forest with all components of order 5.
    Time: Saturday, April 2, 2016 - 11:55
    Room Number: STAG 261

Talk Subject: Mathematics Applications in the Sciences

  • Kayla Vincent*, Western Oregon University
    The process of representing food webs as interval competition graphs
    A food web is defined as an acyclic graph where vertices represent different species and there is a directed edge from species x to species y if species x preys on species y. Food webs are important in Biology because they model the flow of energy in an ecosystem. A competition graph has the same vertex set as a food web, but now two vertices are adjacent if they prey on a common species in the food web. Most of these competition graphs are interval graphs. Interval graphs are graphs where vertices can be represented as intervals of the real line such that vertices are adjacent if and only if their intervals overlap. In this talk, we will explain these structures and their relationships with real examples from Biology.
    Time: Saturday, April 2, 2016 - 10:15
    Room Number: STAG 162
  • Kaylee Church*, Western Oregon University
    Insects and Spirals
    The logarithmic spiral, also known as the growth spiral, is an interesting form in mathematics that happens to be very applicable to the natural world. We explore the structure of this curve, and how this spiral can be used to model the flight pattern of a moth. Specifically, we investigate assumptions used to construct a model for insect flight. Analysis of these underlying assumptions gives insight into possible improvements to the model and limitations of specific models.
    Time: Saturday, April 2, 2016 - 10:35
    Room Number: STAG 162
  • Nikki Carter*, University of Portland
    Eigensystems of Electrical Networks
    The eigenvectors of an electrical network are voltages that, when placed at the boundary vertices, produce boundary currents that are a scalar multiple of the boundary voltage. The objective of this research is to gain information about a given electrical network using eigensystems. In particular, eigensystems are useful when an edges or multiple edges in a network have zero resistance or infinite resistance. Using the eigensystems of an electrical network which are based on the resistance and connectivity of edges in the network, one can determine the location of a dysfunctional resistor in a network or determine the expected number of dysfunctional resistors.
    Time: Saturday, April 2, 2016 - 10:55
    Room Number: STAG 162
  • TJ Norton, Klamath Community College
    Starved? Let's Solve That Math Hunger!
    We all enjoy that time of day when we get to sit down and enjoy our favorite meal. We typically eat three or more times per day. However, being a hard-working college student and living on a college budget often severely restricts the amount of money we can spend. Essentials like lunch, dinner, and second dinner could be much cheaper than what we currently spend. Everyone knows that coupons save us money on our everyday needs, but how many people know how to use mathematical logic to solve these expensive cravings? It is possible to reduce the size of your food budget by using equations to calculate the savings from coupons. Let's apply math so we can buy more late-night grub and keep up with the massive amounts of math homework!
    Time: Saturday, April 2, 2016 - 11:15
    Room Number: STAG 162
  • Thad Joachim*, Klamath Community College
    Theatrical! Practical! Mathematical!
    My talk will focus on how mathematics can be used in the real world relating to theatre arts, and I will support my discussion by giving real-world examples. Actors and other theatre individuals should be able to take math seriously when the math is involved with a theatrical performance. I will also share some personal stories about theatre regarding how I have found math useful in theatre for budgets, costume designs, ticket sales, and stage design.
    Time: Saturday, April 2, 2016 - 11:35
    Room Number: STAG 162
  • Will Kugler*, Klamath Community College
    Fractals in Geology: Measuring Intricate Forms (Cancelled)
    First I will give an introduction to fractals, a naturally occurring mathematical set that repeats a detailed pattern visible at any scale. Then I will connect fractals to real-world applications in Geology and Earth Science. I will discuss how fractals are used by geologists with the use of mathematical equations to find the dimensions of detailed forms ranging from bigger surfaces such as coastlines and islands to smaller forms such as leaves. Come find out how scientists relate these findings to tectonic plate slipping and the formation of mountain ranges!
    Time: Saturday, April 2, 2016 - 11:55
    Room Number: STAG 162

Talk Subject: Numerical Analysis and Scientific Computing

  • Sally Peck*, Western Oregon University
    Algorithmic Variants of QR
    One of the fundamental computations in numerical linear algebra is the QR factorization. A QR factorization decomposes a matrix into the product of an orthogonal matrix and an upper triangular matrix. The algorithms that compute these decompositions can often be costly, and at times, do not perform well for particular matrices. We investigate different methods of computing a QR factorization on a tall and skinny matrix, that is a matrix with more rows than columns. We discuss algorithmic variants and the move to a new family of algorithms based on tiles.
    Time: Saturday, April 2, 2016 - 10:15
    Room Number: STAG 263
  • Joseph Stauss*, Gonzaga University
    Perturbing Equilibria of the Three-Body Problem
    The Lagrange-Relative Equilibrium and the Figure-8 Equilibrium are the only known periodic solutions of the Three-Body problem in the case of equal masses. These equilibria were analyzed by using a finite-difference method to approximate their perturbation-response for various quantities. The resultant behavior is discussed, explained, and classified.
    Time: Saturday, April 2, 2016 - 10:35
    Room Number: STAG 263
  • Alleta Maier*, Linfield College
    Looking for a (Super)resolution to an Image Processing Problem.
    In recent years sparse coding has been employed to efficiently process images. Since recovering sharp images from images corrupted with noise is a well-known ill-posed problem, small perturbations in the image lead to large deviations in the reconstructed image. We look to combine research in superresolution with that of sparse coding for elucidation.
    Time: Saturday, April 2, 2016 - 10:55
    Room Number: STAG 263
    Comments: Sparse Coding and Superresolution

Talk Subject: Probability and Statistics

  • Travis Lowe*, Eastern Oregon University
    Sydney Nelson*, Eastern Oregon University
    Amy Yielding, Eastern Oregon University
    Applying a Multilinear Regression Model to Predict Air Quality in Burns, Oregon
    The City of Burns, Oregon has a serious air quality issue. The city frequently experiences very high levels of PM2.5. PM2.5 consists of a variety of particulates whose size is less than 2.5 micrometers. Such particulates can be inhaled and generally accumulate in the lungs of humans, displaying a strong positive correlation with the instance of lung cancers. Field burning and wood burning for heat combined with the unique atmospheric conditions in Burns appear to be contributing to these high levels. In this talk we discuss the methods used in establishing a regression model to predict PM2.5 for Burns. In particular, we worked in collaboration with The National Oceanic and Atmospheric Administration (NOAA) as well as The Oregon Department of Environmental Quality (ODEQ), who had established a preliminary regression equation. Improvements we made to this model were adding interaction terms and including data gathered from the previous day. The resulting equation improved the predictions of PM2.5 by a 10% higher R-squared adjusted and displayed a narrower range of errors. Our model is now implemented as part of a pilot air quality alert system for the City of Burns sent out by ODEQ in collaboration with NOAA.
    Time: Saturday, April 2, 2016 - 11:15
    Room Number: STAG 263
  • Bridget Daly*, Pacific University
    Use and Misuse of Regression for Chemical Analysis
    It is standard practice in analytical chemistry to use linear regression, particularly to calibrate analytical instruments. If a regression line were used to estimate the output of the instrument for a known concentration of analyte, all would be well. However, chemists use this line in reverse, estimating the concentration of an unknown analyte from the output of the instrument. In this talk we explore how this misuse of the regression line influences the estimation of concentration.
    Time: Saturday, April 2, 2016 - 11:35
    Room Number: STAG 263
  • Dora Bixby*, Southern Oregon University
    Logging with Markov chains
    Oregon is the U.S.'s top lumber producer and the industry makes up a large portion of the jobs in the Oregon workforce. I will be discussing the use of absorbing Markov chains to model the growth of trees in a stand, then analyzing the model to develop a reliable and steady harvesting schedule.
    Time: Saturday, April 2, 2016 - 11:55
    Room Number: STAG 263

Talk Subject: History of Mathematics

  • Garrison Iams*, Klamath Community College
    The Math Behind The Rubik’s Cube
    Come hear about the intricacies of the Rubik's Cube! I will discuss the history of God's number, which is the least amount of moves it takes to solve a scrambled Rubik’s Cube. There are many techniques to solve a scrambled Rubik's Cube. One solution technique which can be modeled by group theory will also be discussed in a way that is understandable to college students who have not yet taken abstract algebra. As an added bonus, I will demonstrate solving a Rubik’s Cube in 10 seconds!
    Time: Saturday, April 2, 2016 - 11:55
    Room Number: STAG 162
  • Eric Rogers*, Gonzaga University
    Ethan Snyder*, Gonzaga University
    Infinitesimal-Based Calculus
    When Newton and Leibniz first developed calculus, they did so by using infinitesimals (really really small numbers). Infinitesimals were used until calculus was made more rigorous by Weierstass. The calculus that we are taught today is based on Weierstass’s ϵ-δ definition of the limit. However, people have been arguing that we go back to an infinitesimal-based calculus, not only for its historical roots, but because many proofs and concepts seem to be much cleaner when using infinitesimals. Using Keisler’s “Elementary Calculus: An Infinitesimal Approach,” our group set out to relearn calculus using infinitesimals. First we will define the hyperreal number line (an extension of the real line that contains the infinitesimals). Then we will walk through the familiar ideas and concepts of single variable calculus, such as limits, derivatives, and integrals, reformulated in terms of hyperreals.
    Time: Saturday, April 2, 2016 - 13:45
    Room Number: STAG 263
    Comments: The subject of this talk will discuss non-standard calculus by way of using infinitesimals, rather than the standard epsilon delta definition of the limit.
  • Lane Thomason*, Southern Oregon University
    Rearrangement in an Infinite Series
    Typically we are free to use associative and commutative properties without problems with real numbers. However, under certain conditions, these can break in infinite series. This talk will look into what happens when these conditions are met.
    Time: Saturday, April 2, 2016 - 14:25
    Room Number: STAG 263
    Comments: calc

Talk Subject: Geometry

  • Jonathan David Evenboer*, Oregon State University
    Laplacians & Laplace Transforms with Respect to Geometric Analysis of 1-Manifolds of Constant Curvature
    This presentation continues on the course begun in past NUMS presentations. Properties of the Laplacian values of the Circle and Aster, and the Laplacian's role in construction of the heat kernel on both manifolds, are covered. Also covered will be properties of the Laplace Transform values of the circle and the aster. A sheet of fundamental/basic notation and a copy of the paper on which this talk is based are/will be available before March at
    Time: Saturday, April 2, 2016 - 13:45
    Room Number: STAG 261
    Comments: Afternoon
  • Mackenzie Koll*, Western Oregon University
    Regular Stars, Polygons, and Musical Scales
    Edge scales are musical scales constructed from the edges and vertices of a regular polygon. Regular polygons are polygons that have specific structure and they can be constructed from regular stars. We will discuss this structure using elements of rational trigonometry and discuss regular stars of order n. A star of order 6 will be used to construct a regular hexagon and motivate the construction of an edge scale. Similar constructions can be used to make other types of musical scales such as stellation scales.
    Time: Saturday, April 2, 2016 - 14:05
    Room Number: STAG 261

Talk Subject: Algebra

  • Bryce Boyle*, George Fox University
    Matt DeBiaso*, George Fox University
    Analyzing Transition Matrices of Chutes and Ladders Game Variant
    Imagine each directional chute and ladder in the classic board game replaced with bidirectional portals. How does the game change? Expected game play and probabilities of each position are determined by the location and type of eigenvalues. We analyzed the transition matrix and discovered Gershgorin eigenvalue bounds for each board layout were constructed from a limited set of Gershgorin disks. Further, we discovered a minimum bounding region for the eigenvalues, independent of location and number of portals on the board.
    Time: Saturday, April 2, 2016 - 14:25
    Room Number: STAG 261
  • Tyler McAfee*, Western Oregon University
    Commuting Pairs in Finite Nonabelian Groups
    The study of the probability that two group elements commute dates back to 1968 with the work of Paul Erdos and Paul Turan. Since then, much has been deduced about these probabilities, including its bound of $5/8$ for nonabelian groups. During this talk, we will look at the associated probabilities of finite nonabelian groups and how to calculate such probabilities using several methods. Furthermore, reports will be made on known probabilities associated with dihedral groups and how to calculate probabilities with specified denominators as well as specified numerators. Finally, we will wrap up with looking at the group of $GL(2,\mathbb{Z}_p)$ matrices and deducing the probability that two of these matrices commute.
    Time: Saturday, April 2, 2016 - 14:45
    Room Number: STAG 261
  • Nhan Nguyen*, University of Montana
    Kummer subspaces of Central Simple Algebras
    Let $F$ be a field containing a primitive $d^{th}$ root of unity $\rho$ and char$(F)\not|d$. Let $A$ be the tensor product of $n$ cyclic $F$-algebras. An element $v\in A$ is Kummer if $v^{d}\in F$. A subspace of $A$ is Kummer if every element is Kummer. Kummer spaces have been used to bound the symbol length of a central simple algebras. In this talk we will discuss some open problems concerning Kummer subspaces
    Time: Saturday, April 2, 2016 - 15:05
    Room Number: STAG 261

Talk Subject: Mathematics Education

  • Emma Winkel*, Pacific University
    Reading $\pi$: Helping children move from symbol to meaning
    Students currently learn of $\pi$ in a formulaic context; as a value needed for the effective calculation of the circumference or area of a circle. In this talk, we present an activity that uses manipulatives to help middle grade students develop an understanding of the geometrical meaning of $\pi$.
    Time: Saturday, April 2, 2016 - 14:45
    Room Number: STAG 263
  • Tiffany Klink*, Klamath Community College
    Math Anxiety: The Common Plight
    There are multiple causes to Math Anxiety ranging from actual facts to myths about math. Mathematics is a subject that many people struggle with daily. Not just mathematics involved in engineering, but the basic math skills needed for leaving a tip. Some topics discussed will be: how to think about math differently, the fact that there are multiple methods to solve any given math problem, how making mistakes is an important way to learn mathematics, and common causes of Math Anxiety according to research. I will also present several different solutions to help reduce Math Anxiety so that you can help your friends and family today!
    Time: Saturday, April 2, 2016 - 15:05
    Room Number: STAG 263


Poster Subject: Probability and Statistics

  • Kyle Logan*, Governor's School for Science and Technology
    TSER Value Determination of NFL Quarterbacks
    (Not Published)
    In American football, an efficient quarterback is key in scoring and winning a game. This study sought to test whether a higher quarterback TSER value could possibly determine the chance of a possible team winning record during the regular season based on the TSER Scale. This study was conducted based on ten African American Quarterbacks in the NFL based on a touchdown-to-sack efficiency equation. The ten quarterbacks selected for research were from a variety of decades from the late 1970s to the early 2010s and a sixteen game season was used as well. For each player, their efficiency mean values were calculated to determine a final efficiency value for their careers. The TSER equation was used to display the trends in how many total touchdowns were scored by the quarterbacks compared to how many times they were sacked. The higher values based on the data, were approximately around 8 to 16.2, Daunte Culpepper having the highest value. The overall data in this research was varied since the quarterback played for different teams and played with different styles of offense. This study could also be used for future determination in deciding a fixed salary for the players based on performance.
    Comments: Cancel the talk
  • Charles Haneberg*, George Fox University
    Predicting Wins and Losses in Division III Women's Basketball
    A method is presented for predicting future wins and losses in tournament-style games based on previous game outcomes. This method is applied to the recent Division III women's basketball season.
    Comments: This poster summarizes: Knapper, Elizabeth and Hope McIlwain. “Predicting Wins and Losses: A Volleyball Case Study.” From The College Mathematics Journal, Vol. 46, No. 5 (November 2015), pp. 352-358. Mathematical Association of America. And I apply their method to a new situation.

Poster Subject: Other

  • Carter Bedsole*, George Fox University
    Gary Buckley*, George Fox University
    Understanding the Traveler's Dilemma
    In the game theory problem The Traveler's Dilemma, the theoretical and experimental results differ greatly. This discrepancy is explained through evolutionary game theory.
    Comments: Talk Subject: Game Theory
  • Crystal Susbauer*, Pacific University
    Graph Products and Colorings in Relation to the Hedetniemi Conjecture
    There are many types of product operations defined in graph theory. These products use the vertices and edges of two (not necessarily distinct) graphs to create a new graph. We focus on four important types of graph products: the Cartesian product, the direct product, the strong product, and the lexicographic product. Additionally, we explore ways of labeling graphs through graph coloring and list coloring, and investigate the chromatic number of a graph. Finally, we relate both topics to one another by examining the Hedetniemi conjecture and researching what work as been done to try to prove or disprove the conjecture.
    Comments: This is a poster presentation on Graph Theory.
  • Jillian Welk*, George Fox University
    A Mad Math Tea Party
    This poster presentation will focus on the research done in an article on cyclic partitions involving an Alice in Wonderland theme.
    Comments: Cyclic Partitions

Poster Subject: Numerical Analysis and Scientific Computing

  • David Calkins*, George Fox University
    Rat Game Expanded
    Mathematician Aviezri S. Fraenkel wrote a paper on a game called The Rat Game, which involves mathematical moves and strategies. I plan to inform and expand on some of these moves and add to the game.

Poster Subject: Number Theory

  • Tyler Chin*, George Fox University
    Ben Van Vliet*, George Fox University
    Triangular Numbers and Squared Numbers
    Visual demonstrations of the relationships between squared numbers and centered squared numbers.

Poster Subject: Geometry

Poster Subject: Combinatorics

  • Emily Hiscox*, George Fox University
    Ellen Pearson, George Fox University
    Adding Color to Combinatorics
    Taking the conclusions found in Candy Crush Combinatorics by Dana Rowland, and expanding them by one color to see how many possible combinations can be found using two rows of candy's and 3 colors.

Poster Subject: Logic and Foundations

  • Mimi Miller*, George Fox University
    7 Variables
    Proving the number of unique fair games that can be played with seven variables and showing that they are isomorphic.

Poster Subject: Mathematics Applications in the Sciences

  • Luke Campbell*, Central Washington University
    Mathematical Modeling of Competition and Coexistence of Phytoplankton Species
    Microscopic phytoplankton form the basis of the food chain in the earth’s oceans. A system of differential equations relates phytoplankton population and nutrient concentration in an isolated environment. The equations were modeled with MATLAB. I conducted sensitivity analyses to determine the relationships between the system of differential equations, and their respective parameters, on phytoplankton behavior. I explored the dynamics of competition and coexistence between multiple species with multiple nutrients in the system. I was able to predict competitive exclusion, and when multiple species could reach states of coexistence when the equations reach equilibrium.