# News

## Student Receives $5000 Actuarial Scholarship

Congratulations to Maleesha Ebanks!

She received Milliman Actuarial scholarship $5000, which is targeted toward minority students that are underrepresented in the actuarial and professional services fields. She passed the first actuarial exam in July 2016 after taking Math 363 and attending the additional weekly practice session hosted by Actuarial Student Club. She said this scholarship has given her more motivation for passing next actuarial exam in December 2017. She is currently taking Math 364, which prepares her to take the second actuarial exam FM.

## Thomas Adams Masters Project

Algorithms for Computing the Inverse of a Curl

Abstract: In order to transform data from a numerical simulation of binary black holes in which only the magnetic field B is computed, to another simulation in which only the vector potential A is computed, ∇ × A = B must be solved to generate a vector potential from the known magnetic field vector. We implement multiple methods for solving this equation based on finite difference numerical representations of the equation. One method of solving this equation directly is to solve the problem sequentially point-by-point, using the solution at previous points as constraints.

Two other methods of solving this problem focus on taking the curl of both sides of the equation and solve the resulting Poisson's equation. The first of these methods is to set up a large but very sparse matrix and solve globally using Gaussian Elimination. The second of these methods is perform a multigrid solve by setting up the problem on grids of multiple resolutions and solving on each level using an iterative technique.

Of the two Poisson's equation methods the multigrid solver is determined through testing to have superior computational scaling for very large magnetic fields to the global solver. It also holds the advantage over the direct point-by-point method of being able to easily incorporate adaptive mesh refinement which is needed for solving the problem on the incredibly large magnetic fields used by the simulations. This leads to the conclusion that the multigrid method should be the primary focus for testing and implementation.

Date: 7/12/2017

Time: 3:30PM-4:30PM

Place: 415 Hodges

All are welcome.

## Jian Cheng Defense

Integer Flows and Circuit Covers of Signed Graphs

Abstract: View

Date: 7/7/2017

Time: 10:00AM-12:00PM

Place: 207 Armstrong Hall

All are welcome.

## Shadisadat Ghaderi Defense

On the Matroid Intersection Conjecture

Abstract: In this dissertation, we investigate the Matroid Intersection Conjecture for pairs of matroids on the same ground set, proposed by Nash-Williams in 1990. Originally, the conjecture was stated for finitary matroids only, but we consider it for general matroids and introduce new approaches to attack the conjecture.

The first approach is to consider the situation when it is possible to make a finite modification to the matroids after which the pair satisfies the conjecture. In such a situation we say that the pair has the “Almost Intersection Property”. We prove that any pair of matroids with the Almost Intersection Property must satisfy the Matroid Intersection Conjecture. Using this result we prove that the Matroid Intersection Conjecture is true in the case when one of the matroids has finite rank and also in the case when one of the matroids is a patchwork matroid.

Our second new approach is inspired by the proof of the general version of König’s Theorem for bipartite graphs. That result implies that the Matroid Intersection Conjecture is true for pairs of partition matroids. We develop some new techniques that generalize the "critical set" approach used in the proof of the countable version of König’s Theorem. Our results enable us to prove that the Matroid Intersection Conjecture is true for a pair of singular matroids on a set that is infinitely countable. A matroid is singular when it is a direct sum of matroids such that each term of the sum is a uniform matroid either of rank one or of co-rank one.

Date: 6/26/2017

Time: 2:00PM-4:00PM

Place: 207 Armstrong Hall

All are welcome.

## Jaxon Lee Capstone

Analytic Approaches to Common Means and their Inequalities

Abstract: Means are measurements of centrality, commonly used in science, engineering, statistics, and mathematics. There is a plethora of means and they measure centrality differently as to obtain the most pertinent information to the question at hand. We will discuss a specific subclass of means called Pythagorean means, which include the arithmetic, geometric, and harmonic means. We will also discuss the root mean squared, as these four means are the most common means to run into in science, engineering, and statistics applications. Lastly, we will show how the value of each of the means is related to one another through the inequality relationship between them.

Date: 6/21/2017

Time: 4:00PM-5:00PM

Place: 123 Armstrong Hall

All are welcome.

## NSO, June 2017

At New Student Orientation (NSO), we’ll help you prepare for your first semester. You’ll learn about campus, explore your academic program and work with an academic adviser to create your class schedule.

## Ariel Sitler Masters Project

Abstract: Unmanned Aerial Vehicles (UAVs) are a valuable tool for image acquisition in the field of 3D mapping. UAVs are a low-cost alternative to manned aerial vehicles, and can be affixed with digital cameras capable of collecting high quality images of structures and terrain for the creation of 3D models. This research is an extension of previous work which used a genetic algorithm and space partitioning to optimize UAV flight paths over areas with structures. Here, the focus is on optimizing the structure mapping portion of the flight plan by imposing the grid technology used for the area portion in the previous work to a building face, then using the grid size, camera specifications, and desired resolution to determine the optimal offset distance from the building.

Date: 5/3/2017

Time: 1:00PM-2:00PM

Place: 313 Armstrong Hall

All are welcome.

## Math Undergraduate Receives NSF Research Fellowship

Math undergraduate Tony Allen awarded NSF Summer Fellowship. Please congratulate him. Great work Tony!

## Fatma Mohamed Defense

On Some Parabolic Type Problems from Thin Film Theory and Chemical Reaction-Diffusion Networks

Abstract: In the first part of this dissertation we study the evolution of a thin film of fluid modeled by the lubrication approximation for thin viscous films. We prove existence of (dissipative) strong solutions for the Cauchy problem when the sub-diffusive exponent ranges between 3/8 and 2; then we show that these solutions tend to zero at rates matching the decay of the source-type self-similar solutions with zero contact angle. We introduce the weaker concept of dissipative mild solutions and we show that in this case the surface-tension energy dissipation is the mechanism responsible for the $H^1$--norm decay to zero of the thickness of the film at an explicit rate. Relaxed problems, with second-order nonlinear terms of porous media type are also successfully treated by the same means.

In the second part we are concerned with the convergence of a certain space-discretization scheme (the so-called method of lines) for mass-action reaction-diffusion systems. First, we start with a toy model, namely AB and prove convergence of the method of lines for this linear case (weak convergence in L^2 is enough in this case). Then we show that solutions of the chemical reaction-diffusion system associated to A+BC in one spatial dimension can be approximated in L^2 on any finite time interval by solutions of a space discretized ODE system which models the corresponding chemical reaction system replicated in the discretization subdomains where the concentrations are assumed spatially constant. Same-species reactions through the virtual boundaries of adjacent subdomains lead to diffusion in the vanishing limit. We show convergence of our numerical scheme by way of a consistency estimate, with features generalizable to reaction networks other than the one considered here, and to multiple space dimensions.

Date: 4/20/2017

Time: 12:30PM-2:30PM

Place: 315 Armstrong Hall

All are welcome.

## Mushtaq Abd Al-Rahem Defense

A Multidimensional Technique for Measuring Consensus Within Groups via Conditional Probability

Abstract: A recent increase in the use of the term “consensus” in various fields has led researchers to develop various ways to measure the consensus within and across groups depending on the areas. Numerous studies use the mean or the variance alone as a measure of consensus, or lack of consensus. Most of the time, high variance is viewed as more disagreement in a group. Using the variance as a measure of disagreement is meaningful in an exact comparison cases (same group, same mean). However, it could be meaningless when it is used to compare groups that have different sizes, or if the mean is different. In this thesis, we establish the fact that the range of the variance is a function of the mean, we present a new index of disagreement and measure of consensus that depend on both, the mean and the variance, by utilizing the conditional distribution of the variance for a given mean. Initially, this new index is developed for comparison of data collected using a Likert scale of size five. This new measure is compared with the results of two other known measures, to show that in some cases they agree, but in other cases the new measure provides additional information. Next, to facilitate generalization, a new algorithmic method to determine the index using a geometric approach is presented. The geometric approach makes it easier to compute the measure of consensus and provides the foundational ideas for generalizing the measure to Likert scales for any n. Finally, a multidimensional computational technique was developed to provided the final step of generalization to Likert scales of any n.

Date: 4/10/2017

Time: 3:00PM-5:00PM

Place: 313 Armstrong Hall

All are welcome.

## Pages