The Department of Mathematics and Statistics offers a weekly colloquium series on Thursdays. Most colloquia begin between 3:00 and 3:30. Seminars alternate between those aimed at Undergraduate (type U) and Graduate (type G) audiences.
Type 
Date 
Title 
Speaker 
G 
10/15/15  Nathan Pollesch Department of Mathematics, University of Tennessee, Knoxville, TN Center for BioEnergy Sustainability, Oak Ridge National Laboratory 

U 
10/15/15  William Krossner,Ph.D. Statistical Consultant, President, PsyMinn Corporation  
U 
10/8/15  Jonathan Kane Honorary Fellow, UWMadison UMD math graduate 

G 
10/8/15  Marshall Hampton Associate Professor, Department of Mathematics & Statistics, UMD 

U 
10/1/15  Bethany Kubik Associate Professor, Department of Mathematics & Statistics, UMD 

U 
9/17/15  Marshall Hampton Associate Professor, Department of Mathematics & Statistics, UMD 

G 
8/7/15  Soleh Dib UMD M.S. Candidate 

G 
8/6/15  Erik Peterson UMD M.S. Candidte 

G 
7/28/15  JinYi Cai Department of Computer Science and Steenbock Professor of Mathematical Sciences University of Wisconsin  Madison 

G 
6/30/15  Michael Ross UMD M.S. Candidate 

G 
6/29/15  Christopher BoamahMensah UMD M.S. Candidate 

G 
6/2/15  Yi Xiao UMD M.S. Candidate 

G 
5/29/15  Ying Liu UMD M.S. Candidate 

G 
5/26/15  John Fahnenstiel UMD M.S. Candidate 

G 
5/19/15  Walton Yin UMD M.S. Candidate 

G 
5/14/15  Evan Oman UMD M.S. Candidate 

G 
5/13/15  Andrew Schneider UMD M.S. Candidate 

G 
5/12/15  Levi Pederson UMD M.S. Candidate 

G 
5/11/15  Ian McGahan UMD M.S. Candidate 

U 
5/7/15  Miranda Steinmetz, Haitao Shang & Joe Toninato UMD Mathematics & Statistics, Undergraduate Students 

G 
5/7/15  Aaron Shepanik, UMD M.S. Candidate 

U 
5/5/15  Tracy Bibelnieks, Instructor UMD Matthew Beaulieu, Laura Crites, Cassidy Hallaway, Dani Huse, Richard Ragan, Dylan Smith, Bjorn Stolhammer & Marcus Walker; Sarah Anderson  undergraduate students  
G 
4/30/15  Petr Kovar Visiting Assistant Professor, VSB  Technical University of Ostrava & UMD 

U 
4/28/15  Cassidy Hallaway, Xinsheng Zhang and O'Neill Kingston UMD Mathematics & Statistics Undergraduate Students 

G 
4/24/15  Fabrizio Zanello Michigan Technical University


U 
4/23/15  Alex Lawrence, Isaac Wass and Zirui Zhao UMD Mathematics & Statistics Undergraduate Students 

G 
4/20/15  Inne Singgih UMD M.S. Candidate 

G 
4/16/15  Ron Moen Associate Professor, Biology, UMD


G 
4/13/15  Danielle Stewart UMD M.S. Candidate 

U 
4/9/15  Tereza Kovarova and Petr Kovar Visiting Assistant Professors VSB  Technical University Ostrava & UMD 

G 
4/2/15  Aparna Katre Director and Assistant Professor of Cultural Entrepreneurship, UMD 

U 
3/31/15  Matthew Arthur and Mary Nelson UMD Mathematics & Statistics Undergraduate Students 

U 
3/26/15  Penghuan Ni, Jesse Schmieg & Joseph Toninato UMD Mathematics & Statistics Undergraduate Students 

G 
3/12/15  Thomas Cameron Washington State University Pullman 

U 
3/5/15  Sara Fett, Clinical Statistics LeighGomezDahl Cancer Center Statistics, Mayo Clinic Department of Health Sciences Research 

U 
3/3/15  Petr Kovar VSB  Technical University of Ostrava and UMD 

G 
2/26/15  Marcin Krzywkowski University of Johannesburg, South Africa, Gdansk University of Technology, Poland, and Polish Academy of Sciences 

U 
2/17/15  Kristine Snyder University of Michigan 

U 
2/12/15  Isabelle KemajouBrown University of Minnesota  Twin Cities 

U 
2/9/15  Bernard Chan San Diego State University 

U 
2/5/15  Xue Gong Ohio University 

U 
2/3/15  Sylwia CichaczPrzenioslo Mathematics & Statistics, UMD 

U 
1/30/15  Bethany Kubik United States Military Academy 

U 
1/26/15  Karl Wimmer Duquesne University 

U 
1/23/15  Sarah Anderson Clemson University 

G 
1/16/15  Katie Borchert UMD M.S. Candidate 

G 
12/18/14  Brittany Fanning UMD M.S. Candidate 

G 
12/11/14  John Greene, Mathematics & Statistics, UMD  
U 
12/4/14  William Krossner, Ph.D  
G 
11/20/14  Dalibor Froncek, Department of Mathematics & Statistics, UMD  
U 
10/02/14  Tracy A. Bibelnieks, Ph.D  
U 
9/25/14  Zhuangyi Liu, Department Head, Mathematics & Statistics, UMD  
U
 9/19/14  Greg Ostergren 

G 
8/18/14  Xuran Yan UMD M.S. Candidate 

G 
7/25/14  Shinjini Kar UMD M.S. Candidate 

G 
7/18/14  Xiaowen Fang UMD M.S. Candidate 

G 
7/8/14  Ondrej Zjevik UMD M.S. Candidate 

G 
6/16/14  Michal Hrabia UMD M.S. Candidate 

G 
6/12/14  Xiao Li UMD M.S. Candidate 

G 
6/9/14  Long Chen UMD M.S. Candidate 

G 
5/21/14  Wenchuan Guo UMD M.S. Candidate 

G 
5/20/14  Michael Lillegard UMD M.S. Candidate 

G 
5/19/14  Zhaobin Kuang UMD M.S. Candidate 

G 
5/14/14  Zhengfei Rui UMD M.S. Candidate 

U 
5/8/14  Jasmine Helgeson, Chenxiao Hu and Jing Lv, UMD Mathematics & Statistics Undergraduate Students  
G 
5/1/14  Greg Bard, University of Wisconsin  Stout  
U 
4/24/14  Philip Bauer, Jordan Maiers and Adam Swinney, UMD Mathematics & Statistics Undergraduate Students  
G 
4/17/14  Qingzhao Wang, Ph.D. Canidate in Mechanical Engineering, Virginia Polytechnic Institute  
U 
4/10/14  Jasmine Helgeson, Penghuan Ni, Tim Schoenheider, Philip Bauer, Jesse Schmieg and Joe Tonianato, UMD Mathematics & Statistics Undergraduate Students  
G 
4/3/14  William Keith, Assistant Professor, Mathematical Sciences, Michigan Tech University  
U 
3/27/14  Ross Garberich, Minneapolis Heart Institute Foundation, UMD Alumni  
G 
3/13/14  Thomas Cameron, UMD Alumni, Math Graduate Student  
U 
3/6/14  Karl Wimmer, Assistant Professor, Department of Mathematics, Duquesne University (UMD Graduate)  
U 
2/20/14  Xuan Li, Assistant Professor, Statistics, UMD  
U 
2/6/14 
Uwe Leck, Associate Professor, Department of Mathematics, UWS  
G 
1/30/14 *rescheduled to 2/13/14 
Steven Chiou, Assistant Professor, Statistics, UMD  
U 
12/12/13  Kyle Krueger and Brett Bozyk, UMD Graduates  
U 
11/21/13  Lucas Gloege, Inne Singgih and Ondrej Zjevik, Graduate Students, UMD  
U 
11/15/13  Ken Stanley, Director, Dubois Project of Oberlin College  
G 
11/14/13  Steve Butler, Department of Mathematics, Iowa State University  
U 
11/7/13  Richard Green, Department of Mathematics, UMD  
G 
10/31/13  Brian Hinderliter, Department of Mechanical and Industrial Engineering, UMD  
U 
10/24/13  Ron Regal, Department of Mathematics, UMD; William Salmon, Department of Linguistics, UMD 

G 
10/17/13  David Clark, Department of Mathematics, UMTC  
U 
10/10/13  Math Majors and Information Security in a Digital Age: Any Connection? 
Dr. William Krossner 
G 
10/3/13  Families of Infinite Series With Interesting Limiting Structure 
John Greene, Department of Mathematics, UMD 
U 
9/20/13  Joseph Gallian, Department of Mathematics, UMD  
G 
9/19/13  Michael Dorff, Department of Mathematics, Brigham Young University  
U 
9/19/13  Michael Dorff, Department of Mathematics, Brigham Young University 
 Archived 201213 Colloquia
 Archived 201112 Colloquia
 Archived 201011 Colloquia
 Archived 200910 Colloquia
 Archived 20089 Colloquia
 Archived 20078 Colloquia
 Archived 20067 Colloquia
 Archived 20056 Colloquia
Archives
Connectivity in fractal models of porous media: A Markov chain approach
by
Nathan Pollesch
Department of Mathematics, University of Tennessee, Knoxville, TN Center for BioEnergy Sustainability, Oak Ridge National Laboratory, Oak Ridge, TN
Given the complexity and variety of porous media structures, researchers have used fractal models to efficiently generate structures with random alignments of voids and varied aggregate clusters at multiple scales. For example, hydrogeologists and soil scientists research properties of porous media to understand groundwater flow patterns and environmental engineers study flow in porous media to further understand mechanisms of contaminant transport. This work investigates connectivity through the use of Markov chains to model simple random walks on the fractal void space of random Menger sponges. This method is a novel approach and results produced verify previous findings using alternate methodologies, such as grouprenormalization, to calculate probability of connectivity as a function of porosity.
Time: Thursday, October `15, 2015; 2:003:00PM
Location: SCC130
A Mathematical Technique for Making the Best Choice Useful for Medical Trials, Stock Selection, Dating and Gardening
by
William Krossner, Ph.D. Statistical Consultant, President, PsyMinn Corporation
UWMadison
Often we must make an eventual selection among competing alternatives when it is not known in advance which is better or the best. In a medical trial to compare two treatments for a disease, each is tested on a group of patients, and via statistical methodology, a choice is made. From ethical considerations, of course we wish to identify the better treatment as quickly as possible, so that lives are saved or suffering is minimized. A simple and understandable mathematical model emerged in the 1960s to perform this task. The model and subsequent developments will be presented, and the effectiveness of the technique tested with a few realworld stockselection examples for the binomial case (that is, picking between two stocks to invest in, so that one made the most money).
Time: Thursday, October 15, 2015; 3:004:00PM
Location: ENG 290
by
Jonathan Kane
UWMadison
Even the simplest geometric entities such as triangles and tetrahedral can possess surprising properties. We will begin with some simple formulas for a triangle – the law of cosines and Heron’s formula for the area, and see how they generalize to higher dimensions. Already for tetrahedral there are some mysteries, which no one has yet investigated for more general polyhedral.
Time: Thursday, October 8, 2015; 3:004:00PM
Location: ENG 290
Angles, bases, Cayley, and determinants: a new look at classic geometry
by
Marshall Hampton
Department of Mathematics & Statistics, UMD
Even the simplest geometric entities such as triangles and tetrahedral can possess surprising properties. We will begin with some simple formulas for a triangle – the law of cosines and Heron’s formula for the area, and see how they generalize to higher dimensions. Already for tetrahedral there are some mysteries, which no one has yet investigated for more general polyhedral.
Time: Thursday, October 8, 2015; 2:003:00PM
Location: SCC 130
by
Bethany Kubik
Department of Mathematics & Statistics, UMD
Abstract:
We explore classical cryptology from the caveman up until just before World War II. The cipher methods discussed include the Skytale cipher, Caesar cipher, Vigenere cipher, transposition ciphers and more. A few of the books, messages by serial killers, photographs, and drawings that contain ciphers are examined.
Time: Thursday, October 1, 2015; 3:004:00PM
Location: ENGR 290
Tales of transforms, tails of transcripts: some mathematical tidbits from bioinformatics
by
Marshall Hampton
Department of Mathematics & Statistics, UMD
Abstract:
After giving some historical data and scientific background, this talk will survey some of the more mathematical aspects of the rapidly developing field of bioformatics. The emphasis will be on primary sequence (DNA or protein) analysis (sequences of letters from an alphabet, for example ACGT for DNA).
Time: Thursday, September 17, 2015; 3:004:00PM
Location: ENGR 290
Generalized Chimera States in Two Interacting Populations of Kuramoto Oscillators
by
Soleh Dib
UMD M.S. Candidate
Abstract:
An important class of problems in the field of dynamical systems considers networks of oscillators, each of which effects the others  commonly in considering such systems the concern is whether or not these oscillators will evolve into a state of synchrony. The Kuramoto model consists of "limitcycle" oscillators (meaning that each is described only in terms of its angle of revolution on a circle), all coupled to each other through a common, time independent function of the phase variables.
In 2002 it was discovered that systems of coupled identical oscillators can in fact exhibit states in which a subpopulation of oscillators fully synchronizes while the remainder do not. Shortly thereafter, Abrams, Strogatz, Mirollo and Wiley proposed a simple, solvable variation on the Kuramoto model which contains such "Chimera" states.
For our research we generalize the concept of a chimera state to the case that the traditionally fully synchronized state is allowed to be in a constant state of partial synchrony. We characterize the conditions under which a generalized chimera exists as a persistent state for this same variant on the Kuramoto model, finding that it is a rare phenomenon, requiring much stricter conditions than for the traditional chimera.
Time: Friday, August 7, 2015; 10:0010:50AM
Location: SCC 130
An Application of Fractal Analysis and Wearable Tech to the Health of the Heart
by
Erik Peterson
UMD M.S. Candidate
Abstract:
Wearable Tech is a new arrival to the marketplace, primarily in the form of smart watches and fitness trackers. But imagine if our clothes themselves were wearable computers with greater capability than current smart phones, and both felt and fit no different than ordinary clothing. Smart Fabrics are being developed by a number of different companies and labs right now, and a type that can monitor vitals is already available in some markets. With a form of fractal analysis called detrended fluctuation analysis, they could be programmed to take the heartbeat data they're gathering and use it to detect whether or not there could be a problem well before it becomes a crisis, and do so in a way that's clear to the consumer whether or not they need to see their doctor. The result is a single number, where 1 means they're healthy, and anything else means they definitely need a checkup. In this talk, we will learn how fractals and smart fabrics combine to make a detrended fluctuation analysis possible, and how this critical number is calculated.
Time: Thursday, August 6, 2015; 2:002:50PM
Location: SCC 130
A Holant Dichotomy: Is the FKT Algorithm Universal?
by
JinYi Cai
Department of Computer Science and Steenbock Professor of Mathematical Sciences
University of Wisconsin  Madison
Abstract:
Computational Complexity Theory aims to classify computational problems according to the P and NP framework, and complexity dichotomy theorems are classification theorems.
The FisherKasteleynTemperley (FKT) algorithm can count the number of perfect matchings over planar graphs in polynomial time. For four decades this stood as *the* important counting problem that has a Ptime algorithm over planar graphs while the same problem over general graphs is intractable. In 2001, Les Valiant introduced matchgates. And subsequently he introduced holographic algorithms based on matchgates. They solve a number of counting problems over planar graphs, which are #Phard over general graphs.
Over the past decade, a substantial theory has been developed, which aims to classify a broad class of counting problems by the local constraint functions that define them. Out of this work, a strong theme has emerged, which supports the following sweeping statement: All such locally defined counting problems can be classified into *exactly* three categories: (1) those that are Ptime solvable over general graphs; (2) those that are Ptime solvable over planar graphs but #Phard over general graphs; and (3) those that remain #Phard over planar graphs. Moreover, category (2) consists *precisely* of those problems that can be captured by Valiant's holographic reduction to the FKT. In other words, Valiant's holographic reduction followed by the FKT appears to be a *universal* method. This sweeping statement is supported by a number of complexity dichotomy theorems of ever broader scope.
So the question is: Is Valiant + FKT universal? In this talk, I will answer this question
Time: Tuesday, July 28, 2015; 10:0011:00AM
Location: Chem 155
2Swappability and Edge Reconstruction Number of Regular Graphs
by
Michael Ross
UMD M.S. Candidate
Abstract:
The edgereconstruction number of graph G, denoted ern(G), is the size of the smallest multiset of edgedeleted, unlabeled subgraphs of G, from which the structure of G can be uniquely determined. That there was some connection between the areas of edge reconstruction and swappability has been known since the swapping number of a graph was first introduced by Froncek, Rosenberg, and Hlavacek in 2014. This paper illustrates the depth of that connection by proving several bridging results between those areas; in particular, when the graphs in question are both regular and 2swappable. Formerly, it had been conjectured that for r ≥ 3 regular graphs, ern(G) ≤ 2. However, results of this paper led to the discovery of four infinite families of r ≥ 3 regular graphs with ern(G) ≥ 3, while giving some promising leads for further discoveries in edge reconstruction.
Time: Tuesday, June 30, 2015; 2:003:00PM
Location: SCC 130
Eigenvalue approximations of the wave equation with local KelvinVoigt damping
by
Christopher BoamahMensah
UMD M.S. Candidate
Abstract:
Eigenvalue approximations of the wave equation with local KelvinVoigt damping are presented using the well known ChebyshevTau spectral method. The problem is formulated in two ways: the first is on one spatial domain while the second is on two spatial domains. Several eigenvalue problems for each method were solved and compared. In general, low frequency eigenvalues were the same for both methods. A brief discussion of inaccurate eigenvalue approximations is also given.
Time: Monday, June 29, 2015; 10:0011:00AM
Location: SCC 130
A Likelihood Ration Test for Sphericity of the Highdimensional Normal Distributions
by
Yi Xiao
UMD M.S. Candidate
Abstract:
The Likelihood Ratio Test (LRT) is a powerful approach to conduct hypothesis testing. Under the circumstance that the dimension p is considered as a fixed number as the sample size n approaches infinity, the classic LRT statistic asymptotically follows the chisquared distribution. Nevertheless, when the dimension p is not fixed as a function of the sample size n, this is not the case anymore. Specifically, the classic LRT statistic converges to the normal distribution in the highdimensional case that p and n both go to infinity. In this paper, we are interested in the spherical test for highdimensional multivariate normal distributions and we propose an adjusted LRT statistic for the spherical test with the asymptotic chisquared distribution for the entire range of the dimension p. Simulated histograms and sizes are provided to compare the fit of the classic chisquare approximation, the normal approximation and the adjusted chisquare approximation for the LRT statistic.
Time: Tuesday, June 2, 2015; 2:003:00PM
Location: SCC 130
Large Covariance Matrix Estimation based on POET with Application to Risk Estimation in Finance
by
Ying Liu
UMD M.S. Candidate
Abstract:
This project discusses statistical methods for estimating complex correlation structures of highdimensional datasets in financial research. We study the principal orthogonal component thresholding (POET) method, and using Monte Carlo simulation, we compare the performance of POET estimator with the usual sample covariance matrix. The POET estimator performs better when the dimension of the data is large relative to the sample size. This method is applied to Shanghai and Shenzhen Stock Exchange market
Time: Friday, May 29, 2015; 2:003:00PM
Location: SCC 130
Isomorphic Decompositions of Complete Graphs into Unicyclic Graphs
by
John Fahnenstiel
UMD M.S. Candidate
Abstract:
If G is a graph with n vertices, we say that the complete graph Kn has a Gdecomposition if there are subgraphs G1,G2,...Gs of Kn, all isomorphic to G, such that each edge of Kn belongs to exactly one Gi. In 1967 Rosa proved that if a graph G admits certain types of labelings then it forms a Gdecomposition of Kn. In this project we used alphalabelings and near alpha labelings to prove the existence of Gdecompositions for unicyclic bipartite graphs of eight vertices.
Time: Tuesday, May 26, 2015; 2:003:00PM
Location: SCC 130
Weighted KaplanMeier Estimator For Different Sampling Methods
by
Walton Yin
UMD M.S. Candidate
Abstract:
KaplanMeier(KM) estimator is one of the most effective estimation for the survival functions. However, bias is affecting the accuracy of estimating survival curve. This article proposed different weighted KM estimators for different sampling methods. They are stratified sampling and casecohort sampling. In order to evaluate the effectiveness of these weighted KM estimators, bootstrapping method is used to analyze the variance of the survival functions. Simulation is conducted in R using randomly generated data.
Time: Tuesday, May 19, 2015; 2:003:00PM
Location: SCC 130
Infinite Levels of Complexity in a Family of OneDimensional Singular Dynamical Systems
by
Evan Oman
UMD M.S. Candidate
Abstract:
A broad spectrum of Discrete Dynamical Systems research has been dedicated to understanding rational maps of the plane given by . One such map, defined in complex coordinates, is the quadratic map defined as follows:
where . This map has been been studied extensively in both the one and two dimensional settings. My project explores a singular perturbation of this well known family by adding an inverse square conjugate term with perturbation parameter β giving the system:
The goal of this study is to compare the well known dynamics of the standard quadratic system with the dynamics of the perturbed system in order to illuminate how the two maps differ. My main results pertain to the onedimensional setting, showing that the singularity introduces an infinity of significant parameter intervals, some corresponding to superattracting periodic orbits and others to parameter values for which the critical orbit escapes. Finally we briefly discuss how the onedimensional results relate to the behavior of the larger two dimensional system.
Time: Monday, May 14, 2015; 3:004:00PM
Location: SCC 130
Investigating Traces of Matrix Products
by
Andrew Schneider
UMD M.S. Candidate
Abstract:
The trace of a square matrix is the sum of the diagonal entries in , and is denoted It is well known that if and are square matrices of the same size then . However, in general. Is one usually larger than the other? In this talk we investigate this question for products of matrices and of various sizes. We also consider how the relative size of a trace compares to another. With products containing two and four there are three possible traces to consider, and The size of these traces compare in ways, and it turns out the ordering never occurs. We explain why this can never occur, and discuss other forbidden orders for products containing a larger number of .
Time: Wednesday, May 13, 2015;1:003:00PM
Location: SCC 130
Mixed model analysis for repeated measures of lettuce growth
by
Levi Pederson
UMD M.S. Candidate
Abstract:
We conducted an experiment to compare the growth of lettuce using three different treatments. Each treatment had different spacing between each lettuce plant. Mixed model analysis was used to analyze the growth of the lettuce over time. SAS was used for fitting an appropriate covariance structure to the data in order to represent the correlation between time points using PROC MIXED. We also tested higher order polynomial terms in the model and used ESTIMATE statements to compare the treatments at each day along with comparing weights between days within treatments.
Time: Tuesday, May 12, 2015; 2:004:00PM
Location: SCC 130
Covering cover pebbling number of products of paths
by
Ian McGahan
UMD M.S. Candidate
Abstract:
There are a variety of pebbling numbers, such as classical pebbling number, cover pebbling number, and covering cover pebbling number. In this paper we determine the covering cover pebbling number for Cartesian products of paths. The covering cover pebbling number of a graph, G, is the smallest number of pebbles, n, required such that any distribution of n pebbles onto the vertices of G can be, through a sequence of pebbling moves, redistributed so that C, a vertex cover of G, is pebbled. Traditionally, a pebbling move is defined as the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. In this paper we provide an alternative proof for the covering cover pebbling number of cycles and prove the covering cover pebbling number for a Cartesian product of paths.
Time: Monday, May 11, 2015; 2:004:00PM
Location: SCC 130
Three Undergraduate Research Projects
Turbidity in Lake Superior
Miranda Steinmetz
The goal of this project was to identify seasonal and temporal changes of water quality, and their effects on turbidity in Lake Superior. Multiple linear regression models were used to see which variables had a significant effect on turbidity. Future directions will also be discussed.
Dynamics of a Quadratic Family under Nonholomorphic Singular Perturbation
Haitao Shang
In this talk, we will show the simplest dynamics (along the real line) of quadratic family under nonholomorphic singular perturbation with the form of , where both z and c are complex numbers, and is the conjugate of z. Based on the “orbit diagram” of this family in real case, we will interpret its dynamics both analytically and graphically. Besides, several elegant “escape pictures” of the parameter planes and dynamical planes of this family under more complicated complex case will also be shown.
Searching for a Viable Betting Strategy
Joseph Toninato
The project involves using expected value functions as well as computer simulations to test different strategies that people use for betting, especially Roulette.
Time: Thursday, May 7, 2015; 3:004:00PM
Location: Chem 150
Graph Labelings and Tournament Schedulings
by
Aaron Shepanik
UMD M.S. Candidate
Abstract:
During my research, I studied and became familiar with distance magic and distance antimagic labelings and their relation to tournament scheduling. Roughly speaking, the relation is as follows. Let the vertices on the graph represent teams in a tournament, and let an edge between two vertices a and b represent that team a will play team b. Further, suppose that we can rank the teams based on previous games, say, the preceding season. These integer rankings can be used as labels for the vertices. Of particular interest were handicap tournaments, that is, tournaments designed to give each team an equal chance of winning. This talk will be full of information, results, and some cool looking graphs!
Time: Thursday, May 7, 2015; 2:004:00PM
Location: SCC 130
Two Undergraduate Research Projects
Tracy Bibelbieks (Faculty), Matthew Beaulieu, Laura Crites, Cassidy Hallaway, Dani Huse, Ricahrd Ragan, Dylan Smith, Bjorn Stolhammer and Marcus Walker; Sarah Anderson
Design of a Discrete Event Simulation for High Priority 911 Service Calls
Tracy Bibelnieks (Faculty), Matthew Beaulieu, Laura Crites, Cassidy Hallaway, Dani Huse, Richard Ragan, Dylan Smith, Bjorn Stolhammer and Marcus Walker (students)
Police departments across the United States are working with data scientists to develop models that allow more efficient response to high priority crime events without increasing police budgets or work force. Simulations to achieve efficiency rely heavily on an underlying assumption of approximate probability distributions for response time to events, time between crime events, and proportions of events by priority and geographic location. This research analyzed historical data for an urban area in the United States to approximate probability distributions for these factors. The distributions were then used to develop a queuing model that simulate daily 911 calls that can then be used to test a variety of scenarios to optimize police force response in relation to specific goals.
Obesity and Injuries in the Emergency Room: Is There a “Cushion Effect?”
Sarah Anderson
Emergency room doctors have a hypothesis called “the cushion effect,” which is that overweight and obese patients have less severe injuries because of the extra body fat cushioning. We will reveal whether that is true of patients at Saint Luke’s Hospital, discuss the importance of asking the right questions about the data, and consider what we would expect to happen statistically if I doubled my body weight.
Time: Tuesday, May 5, 2015; 3:004:00PM
Location: Chem 150
Decomposing complete graphs, from theory to applications
by
Petr Kovar
Abstract:
The decomposition of complete graphs is a wellstudied topic in graph theory. In this talk we focus on edgedecompositions of a complete graphs on n vertices into n copies of subgraphs such that the maximum number of vertices of the subgraphs is as small as possible. There is a nice application arising from numerical mathematics for which such decompositions allow a scalable distribution of large BEM block matrices to parallel machines with respect to both time complexity and memory limits.
Time: Thursday, April 30, 2015; 3:004:00PM
Location: SCC 130
Three Undergraduate Research Projects
by
Cassidy Hallaway, Xinsheng Zhang and O'Neill Kingston
UMD Mathematics & Statistics Undergraduate Students
Abstract:
Mathematical Modeling of the Ebola Virus by Cassidy Hallaway
This presentation on the Ebola virus will start with a brief background of what the
Ebola virus is, and how the corpses of dead Ebola victims contribute to the spread of the epidemic. I will then discuss what an SIER model is and how it is used to model the spread of an epidemic, and further discuss the final system of differential equations to represent the spread of Ebola, and how infected corpses affect the epidemic.
Analysis of Ebola Disease Model with Hospitalization by Xinsheng Zhang
Ebola is a highly lethal virus, which has caused 10702 total deaths in Africa since the 2013. Using data from the epidemics, I built a differential equations model for the spread of Ebola. New in this study is the manipulation of the number of hospital beds. For epidemic profiles
identified in Liberia, increasing number of the beds increases the hospitalization rate, and reduces the number of individuals infected, as well as delaying the epidemic. In particular, it was found that increasing the number of the hospital beds in the range of 4220043000
leads to a mushrooming rise in survival.
Decomposing Complete Graphs by O'Neill Kingston
In this talk we show how a graph obtained by starting with 16 points and drawing an edge from each point to each of the other 15 points can be partitioned into subgraphs consisting of 8 edges each that contain a single cycle of length 5 and no other cycles.
Time: Tuesday, April 28, 2015; 3:004:00PM
Location: Chem 150
Some interactions between comninatorics and algebra: pure 0sequences, pure fvectors, and level Hilbert functions
by
Fabrizio Zanello
Michigan Technical University
Abstract:
Gorenstein and level Hilbert functions, and their monomial and squarefreemonomial counterparts, play an important role in combinatorics and in combinatorial algebra, thanks also to their intriguing connections with a number of other mathematics areas.
We review some of the old and new developments that have been shaping this field during the past 40 years: from R. Stanley’s seminal contributions in the seventies, to the algebraic progress of the nineties, to the come back center stage of the combinatorial side of the story during the last few years. In particular, we will discuss some recent progress on pure Osequences and on fvectors of pure simplicial complexes (i.e., the square free pure Osequences), as well as some of their fascinating interactions with other fields, such as design theory, finite geometries, and matroid theory.
The talk will be aimed at a general mathematical audience, and include a selection of conjectures and open problems accessible to young researchers interested in combinatorics or in algebra.
Time: Friday, April 24, 2015; 4:005:00PM
Location: SCC 130
Three Undergraduate Research Projects
by
Alex Lawrence, Isaac Wass and Zirui Zhao
UMD Mathematics & Statistics Undergraduate Students
Abstract:
A Risk Analysis of Climate Change by Alex Lawrence
Climate change is correlated with increased temperatures, increased risk of damaging floods and an increase in the amount of damage done by natural disasters. We will discuss these changes and how they affect the cost incurred by insurance companies.
The Sum of Largest Values Problem by Isaac Wass
We provide a brief introduction to discrete order statistics generated by m unbiased nsided dice. We consider the sum of the k largest values on these dice, analyzing special cases and give a formula for the probability that the k largest values on m nsided dice has sum s.
Numerical Approximation of the Energy Decay Rate for a Vibrating String with Local KV Damping by Zirui Zhao
We consider a partial differential equation that models the motion of a vibrating string with local KelvinVogit damping to estimate the energy decay rate using finite dimensional approximating schemes. The location of the eigenvalues of these schemes is a good indicator to the energy decay rate.
Time: Friday, April 23, 2015; 3:004:00PM
Location: Chem 150
New Methods for Magic Total Labelings of Graphs
by
Inne Singgih
UMD M.S. Candidate
Abstract:
A vertex magic total (VMT) labeling of a graph is a bijection from the set of vertices and edges to the set of numbers defined by so that for every , , for some integer . An edge magic total (EMT) labeling is a bijection from the set of vertices and edges to the set of numbers defined by so that for every , , for some integer . Numerous results on labelings of many families of graphs have been published. In this thesis, we include methods that expand known VMT/EMT labelings into VMT/EMT labelings of some new families of graphs, such as unions of cycles, unions of paths, cycles with chords, tadpole graphs, braid graphs, triangular belts, wheels, fans, friendships, and more.
Time: Monday, April 20, 2015; 12:001:00PM
Location: SCC 130
Mathematical and Statistical Applications in Mammal Research Projects in MN
by
Ron Moen
Associate Professor, Biology, UMD
Abstract:
My research is primarily on movements and habitat use of mammals in Minnesota. We have active research projects on several species, including moose, deer, wolves, marten, and bats. This summer we will start projects on skunks, raccoons, and turtles. These projects all have mathematical and statistical applications.
Some examples of what I will talk about include:
1. The bat, turtle, and carnivore projects all will be using occupancy modelling to estimate distribution of different species in Minnesota.
2. I am working with Dr. Li on a statistical project involving LiDAR analysis of habitats moose use for resting and foraging.
3. With collaborators in the Twin Cities we are using CMIP5 GCM output for National Parks in the upper Midwest, Red Lake Reservation, and Quetico Provincial Park to evaluate plant, mammal, and bird species responses to climate change.
4. An undergraduate has worked with survival data for Canada lynx.
5. Historical work I did analyzing accuracy of GPS locations
6. Graduate students who are using R to calculate home ranges and classify activity levels of freeranging moose and deer.
I will cover biological basis for these projects, data handling, mathematics, and current problems we are addressing on some of these projects. Statisticians and Mathematicians may find that there are interesting data sets here. With current data collection methods, biologists can create tremendously large data sets. For example, we are currently working with over 2 million GPS locations and many more millions of activity records for moose.
Dr. Moen received a Ph.D. in Wildlife Conservation from the University of Minnesota in 1995. Since then he has been at the Natural Resources Research Institute where he is now a Senior Research Associate, and in Fall 2014 became a member of the Dept. of Biology (UMD) as an Associate Professor.
Time: Thursday, April 16, 2015; 3:004:00PM
Location: SCC 130
Even Harmonious Labelings of Disconnected Graphs
by
Danielle Stewart
UMD M.S. Candidate
Abstract:
A graph with q edges is said to be even harmonious if the vertices can be labeled with distinct integers from 0 to 2q such that when each edge xy is assigned the sum of the vertex labels of x and y mod 2q the resulting edge labels are distinct.
This talk focuses on finding even harmonious labelings for disjoint graphs. Among the families we investigate are: the disjoint union of cycles and stars, unions of caterpillars, and unions of squares of paths.
Time: Monday, April 13, 2015; 2:003:00PM
Location: SCC 130
Shooting Game and a Card Trick
by
Tereza Kovarova and Petr Kovar
Visiting Assistant Professors, VSB  Technical University of Ostrava & UMD
Abstract:
Tereza Kovarova
Methods of discrete mathematics in scheduling in a shooting tournament
During a shooting competition each two players meet at one of a small number of different shooting tracks. Each shooting track consists of one line for each player.
To assemble a schedule of the fair tournament one needs to consider certain constrains. For instance:
 the number of players and the time available for the tournament
 regular swapping of sides for each player at the shooting tracks
 regular switching of shooting tracks for each player
 equal lengths of pauses between the matches for each player.
We discuss how discrete math can be used to obtain a fair schedule.
Petr Kovar
The Card Trick
The magician (or rather a mathematician) with his assistant perform the following trick with a deck of 124 cards:
 the assistant lets any volunteer from the audience to choose five cards
 the assistant then takes the five cards, chooses one to give back to the volunteer
 then the assistant rearranges the four remaining cards (face up) in a neat pile or row
 the magician observes the four remaining cards and names the one card in the volunteers hand
We show this is not a trick based on secret communication, but relies on math only. In a short talk we explain how.
Time: Thursday, April 9, 2015; 3:004:00PM
Location: Chem 150
Applications of Structural Equation Modeling in Entrepreneurship Research
by
Aparna Katre
Director and Assistant Professor of Cultural Entrepreneurship
Abstract:
My research pertains to understanding the phenomenon of starting social ventures. In particular, I am interested in knowing those startup behaviors of social entrepreneurs which can predict early stage success. Social ventures have a double bottom line of doing good while doing well and face added challenges in comparison with regular entrepreneurial ventures. Social entrepreneurs’ startup behaviors are guided by their social mission and also by their intention to be financially viable.
In this colloquium I will briefly introduce my research and focus on a study which uses structural equation modeling (SEM) to test a conceptual model regarding entrepreneurial behaviors and early stage success. I will discuss the process used to develop the conceptual model, steps involved in preparation for running the SEM, testing the conceptual model and finally how I interpreted the results to arrive at conclusions. I will also discuss typical challenges faced while using SEM and how I have approached these challenges.
I have a Ph.D. in Management (Designing Sustainable Systems) from Case Western Reserve University and a Master of Statistics from Indian Statistical Institute, Kolkatta, India. Prior to UMD I have worked extensively with Global Information Technology consulting firms, provided leadership in the areas of strategy, organizational change management, business process improvement, and program management. I am currently associated with various academic and practitioner groups such as the Academy of Management, Association for Nonprofit and Voluntary Associations, Social Enterprise Alliance, Minnesota Social Impact Center, and Social Venture Network.
Time: Thursday, April 2, 2015; 3:004:00PM
Location: SCC 130
Two Undergraduate Research Projects
by
Matthew Arthur and Mary Nelson
UMD Mathematics & Statistics Undergraduate Students
Abstract:
This colloquium features two presentations in which undergraduate students explain their UROP research.
Project 1. Matthew Arthur
Understanding Dynamical Systems in the 2D Plane
This talk provides an overview of discretetime dynamical systems  also called iteration formulas or difference equations. We focus on a particular family of complexvalued maps whose dynamics are not fully understood. We will explore some of the various methods used to better understand these systems. The presentation will touch on a few been wellstudied cases and the “frontier” of what is currently known.
Project 2. Mary Nelson
Analyzing Google Flu Trends
The goal of this project was to develop a model for predicting flu outbreaks using Google Flu Trends. Simple regression and time series models were developed to predict outbreaks.
Limitations of the models and potential project extensions will be discussed.
Time: Tuesday, March 31, 2015; 3:004:00PM
Location: Chem 150
Three Undergraduate Research Projects
by
Penghuan Ni, Jesse Schmieg & Joseph Toninato
UMD Mathematics & Statistics Undergraduate Students
Abstract:
This colloquium features three presentations in which undergraduate students explain their research.
Project 1. Searching for a lost plane.
Each February, a nationwide international Mathematical Contest in Modeling (MCM) is held in which threeperson teams have 96 hours to select from one of two problems and submit a solution. This year a UMD team consisting of Penghuan Ni, Jesse Schmieg, and Joseph Toninato created a model for locating a lost airplane in the open ocean area. Their model involves Bayesian analysis, cluster computing, and a Traveling Salesman Problem algorithm.
Project 2. Penghuan Ni, A Suggestion for NSIC Football Schedule
This talk focuses on sport tournament problems and a mathematical method to solve them. The problem involves the Northern Sun Intercollegiate Conference (NSIC) football schedule.
Tournament concepts and graph theory terminology will be introduced by way of an example and a method for solving the problem will be given.
Project 3. Jesse Schmieg, Patterns of NonSimple Continued Fractions
In this talk we illustrate how to write a number as continued fraction. We then generalize this by allowing positive rational numbers as the “numerator” and show that a number of properties and relations that hold in the simple case carry over elegantly with minor alterations. Despite this, examining generalized continued fractions suggests that there are distinct differences between the forms. Some patterns of these continued fractions strongly appear to be true, but remain only as speculation.
Time: Thursday, March 26, 2015; 3:004:00PM
Location: Chem 150
How do we really find eigenvalues?
by
Thomas Cameron
Washington State University Pullman
Abstract:
In this talk we will discuss the equivalence of the problems for finding the eigenvalues of a matrix and the roots of a polynomial. We will see that there are some serious drawbacks to approaching the eigenvalue problem as a root finding problem. Moreover, we can approach the eigenvalue problem as an invariant subspace problem. In doing so, we will explain the main driving force behind some of the most successful algorithms for finding eigenvalues, such as the QR algorithm and Francis’s algorithm. Lastly, we will come across some natural extensions of the eigenvalue problem to other areas of mathematics, such as orthogonal polynomials and numerical integration.
Time: Thursday, March 12, 2015; 3:004:00PM
Location: SCC 130
Statistics in Medical Research
by
Sara Fett, Clinical Statistics
LeighGomezDahl Cancer Center Statistics
Mayo Clinic
Department of Health Sciences Research
Abstract:
We will share an overview of Mayo Clinic and Department of Health Sciences Research (HSR). Our department’s vision is to enhance the understanding of health and human disease through collaborative research teams. To help articulate what this looks like we will provide an overview of the divisions within HSR and the variety of projects we work on along with the differing positions (or job titles) we use to support these projects. We both manage analytical jobs within the Division of Biomedical Statistics and Informatics and as such we will delve more deeply into the roles and responsibilities held by our PhD, MS and BS level statistical and programming support. We will share more about our recruitment efforts and what skills work best for our teambased approach to medical research.
Time: Thursday, March 5, 2015; 3:004:00PM
Location: Chem 150
The Mathematics of the games Dobble and Sprouts
by
Petr Kovar
VSB  Technical University of Ostrava and UMD
Abstract:
In this talk we use mathematics to examine the games of Dobble and Sprouts. We identify some mistakes in the instruction manual for Dobble. We also describe how to create a game similar to Dobble. Using graph theory we determine lower and upper bounds on the number of moves in the game Sprouts. Moreover, we show that a modified version of Sprouts, which appears to be a fair game, is not. Some open problems related to both games will be mentioned.
Time: Tuesday, March 3, 2015; 3:004:00PM
Location: Chem 150
by
Marcin Krzywkowoski
University of Johannesburg, South Africa
Gdansk University of Technology, Poland, and Polish Academy of Sciences
Abstract:
The topic is the hat problem in which each of “n” players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player can see everybody excluding himself. We consider such a problem on a graph, where vertices correspond to players, and a player can see each player to whom he is connected by an edge. First we prove some general theorems about the hat problem on a graph. Next we solve the problem for trees and cycles. Then we consider the hat problem on graphs such that the only know information are the degrees of vertices. Next we give an upper bound on the maximum chance of success for graphs with a neighborhooddominated vertex. Then we consider the problem on disconnected graphs and on graphs with a universal vertex.
Time: Thursday, February 26, 2015; 3:004:00PM
Location: SCC 130
Exploring Brain and Body Dynamics in Human Locomotion
by
Kristine Snyder
University of Michigan
Abstract:
While walking and running are everyday activities for most of us, researchers still have a rather limited understanding of how the brain and body interact to produce human locomotion. In this talk, I will offer some examples of how mathematics can be used to help explain the neural processes involved in walking and running. These include identifying the processes involved in minimizing energy expenditure, analyzing the effect of mechanical artifact on mathematical analyses of electroencephalography during walking, and using mathematical modeling to examine dynamic causality between neural sources. I will then discuss how mathematical models, experimental analysis, and the development of appropriate mathematical measures can interact to help us answer some remaining fundamental questions about neural activity during gait.
Time: Tuesday, February 17, 2015; 2:003:00PM
Location: MWAH 191
Fibonacci Sequence, Golden Ratio and Nature
by
Isabelle KemajouBrown
University of Minnesota  Twin Cities
Abstract:
In 1202, the Italian Mathematician Leonardo Bonacci known as Fibonacci, investigated how fast rabbits could breed in ideal circumstances. We shall use this example to introduce the Fibonacci sequence, describe more examples in real life where Fibonacci numbers and Golden ration occur naturally. We shall further show how to use simple mathematical tools to derive an explicit expression for Fibonacci numbers.
Time: Thursday, February 12, 2015; 4:005:00PM
Location: MonH 70
Analysis and Dynamics of Networked Systems
by
Bernard Chan
San Diego State University
Abstract:
Systems in various areas of science and engineering often have internal structures connecting numerous interacting components. Interactions between the subsystems may produce dynamics that are not predicted based on analyses of the individual parts. In application, such unexpected dynamics may produce undesired behavior. Therefore, it is important to understand the possible behavior by analyzing the system as a whole.
In this presentation, we will discuss various mathematical techniques that are used to analyze network models. Instead of statistical examinations of such systems, we will focus on the possible dynamics. Modeling, representation, bifurcation, synchrony patterns and other issues in coupled networks are discussed. We will also use an example from engineering to show that these techniques can be used to improve the performance of a system.
Time: Monday, February 9, 2015; 3:004:00PM
Location: MonH 80
Circular statistical methods in dispersion in of clusters in a cellcycle coupling model
by
Xue Gong
Ohio University
Abstract:
In this talk, the speaker will give an introduction on basic circular statistical methods to deal with angular data. Angular data are used in biology, meteorology, geography, and in many other areas; for examples, ocean current directions, orientation of fracture planes, and departure directions of animals. Because angular data have no true zero value, and the designation of high and low values is arbitrary, this type of data cannot be analyzed with commonly used statistical techniques. The speaker will use circular statistical methods to study the effects of random perturbations on collective dynamics of a large ensemble of interacting yeast cells. Two biologically motivated mechanisms of dispersion will be considered and compared with additive Gaussian white noise perturbations. The results can be used to predict the strength of coupling among the cells from experimental data.
Time: Thursday, February 5, 2015; 3:004:00PM
Location: BohH 90
by
Sylwia CichaczPrzenioslo
UMD
Abstract:
Martin Gardner described the {map coloring game} in Scientific American, which was first posed by Steven Brams in 1980 and independently by Hans Bodlaender in 1991. The map coloring game is a twoperson game played by Alice and Bob, who alternate moves. Alice begins by coloring a region of a map and then Bob colors a different region. They alternate coloring regions that have not been previously colored until all regions are colored. Alice tries to minimize the number of colors that need to be used, and Bob wants to maximize this number, such that no adjacent regions have the same color and no new color can be introduced unless it is forced because of adjacency.
We present some results on this topic.
Time: Tuesday, February 3, 2015; 3:004:00PM
Location: MWAH 195
by
Bethany Kubik
United States Military Academy
Abstract:
We study two different coloring problems through origami. First, we produce a flat foldable crane and explore coloring of the crease pattern, that is, the pattern made by the creases on the paper. Next, we explore colorability through threedimensional objects created with multiple sheets of folded paper.
*Please bring a writing utensil. Origami folding paper will be provided!
Time: Friday, January 30, 2015; 3:004:00PM
Location: SCC 120
How hard are old school Nintendo games?
by
Karl Wimmer
Duquesne University
Abstract:
In this talk, we will discuss the mathematics behind what it means for a problem to be "computationally hard." We relate this notion to the P=NP problem, which is one of the most important open questions in mathematics and computer science. We illustrate these ideas by showing that largescale versions of several games from Nintendo's largest franchises (Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon) are computationally hard.
Time: Monday, January 26, 2015; 3:004:00PM
Location: ABAH 225
by
Sarah Anderson
Clemson University
Abstract:
How do QR codes such as the one shown below store information while incorporating logos or other cool designs? What makes them scan properly even if they are smudged or torn or the material on which they are written is damaged? This is just one example of error correction at work. Error control is essential in all digital storage and communications and is realized via encoding schemes from error correcting codes. ReedSolomon codes are algebraic geometry codes, a large family of error correcting codes used in a variety of applications and a topic of current research. In this talk, we explore the mathematics behind codes used for error correction.
Time: Friday, January 23, 2015; 3:004:00PM
Location: SCC 120
A Study of Longitudinal Analysis With Application
by
Katie Borchert
UMD M.S. Candidate
Abstract:
A longitudinal study is a study in which the researcher makes observations of the same variable on the same individual. This creates a problem of independence since the observations of one variable on one individual clearly are not independent. Therefore, we must adjust the statistical model in order to correct for this. The correction uses multivariate statistical techniques to create a variation of multiple linear regression. To demonstrate how this correction works we will provide an example using data on children’s development. The goal of the analysis is to determine which of a few factors, if any, have an effect on a child’s academic performance. We predicted that poverty level would have the greatest negative effect and breastfeeding would have the greatest positive effect. After conducting our analysis we found that over time poverty affects a child’s ability to do well in math by a coefficient of 8.54 (p = 0.0000). Breastfeeding increases their ability over time by 4.11 (p = 0.0409). Also, Reading ability turned out to have an effect over time as well at a rate of 0.3308 (p = 0.0000). Time spent with family and sleeping did not appear to have any effect.
Time: Friday, January 16, 2015; 2:004:00PM
Location: SCC 130
Periodic Behavior in a Class of Second Order Recurrence Relations Over the Integers
by
Brittany Fanning
UMD M.S. Candidate
Abstract:
Suppose we start a sequence with and , and define the rest of the sequence using the relation
The resulting sequence is 4, 13, 50, 22, 4, 140, 4, 13, … When a sequence repeats after terms, we call the solution periodic with period . Thus the sequence above is periodic with period six.
In general, given the system
where is a rational number, and are integers, we are interested in finding when periodic solutions occur. In other words, we want values and initial conditions for specific values of and which lead to a periodic solution. Using a common linear algebra method for solving recurrence relations, we developed a search method. The method and results will be outlined in this talk.
Time: Thursday, December 18, 2014, 2:003:00PM
Location: SCC 130
by
John Greene, Mathematics & Statistics, UMD
Abstract:
Time: Thursday, December 11, 2014, 3:004:00PM
Location: SCC 130
Results of an Experiment in Teaching Mathematics Comprehension to Young Students
by
William Krossner, Ph.D.
Abstract:
Could many (some?) (any?) 6^{th} grade U.S. students be taught to use, and even better, learn to be able to prove, one or two theorems in number theory hitherto presented, if at all, to upperlevel college mathematics majors? Come to this colloquium and find out. And, if the answer to any part of the first sentence is “Yes,” who cares, and what difference does it make?
Equivalently, are there any implications for the nature of the current math curriculum in the lower grades, or how U.S. mathematicians of the future might be discovered and nurtured? Would U.S. citizens in general reduce their high levels of “innumeracy” and “math phobia” if some modest number of activities such as the above can be inserted into their school experience? If so, might more people enter STEM vocations?
The point is not the theorems, but in developing the understanding by earlygrade students of the true nature of mathematics, as compared with the drill, drill, drill, calculate, calculate, calculate, learn next technique, learn next technique, learn next technique that constitutes the bulk of math education from kindergarten to middle school to high school to college majors such as engineering, you name it.
Relevant fact to consider: a 2014 recipient of the Fields Medal (for mathematicians, the equivalent of the Nobel Prize) was a 1995 member of UMD Professor Joseph Gallian’s annual summer math experience held at UMD. Could this relatively short exposure to advanced mathematics have helped to influence his decision as to a career choice?
Time: Thursday, December 4, 2014, 3:004:00PM
Location: Chem 150
From Soccer Tournament to Graph Theory and Back
by
Dalibor Froncek
Department of Mathematics & Statistics, UMD
Abstract:
In 2002, I was asked to schedule a rather unusual soccer tournament with 7 teams. After doing that, I started to wonder (as every mathematician would do) about a general solution for the existence of such tournaments. In 2004, along with my thenstudents Petr Kovar and Tereza Kovarova I wrote my first article about this topic. Since then, about 40 articles were published in this area.
Ten years and ten articles later, I am still interested in this exciting topic. Jerimi Walker wrote her Master's Project in this area and published her results in a journal. Michael Lillegard wrote his Master's Thesis on a related topic, and Aaron Shepanik has made a good progress in his Master's Thesis already. Sylwia CichaczPrzenioslo became interested in it when she was visiting our department in 2007 as Fulbright Junior Research Fellow, and by now is the leading author in this area with about 12 papers.
I will show how sports tournaments are related to distance magic graph labelings and present some techniques for constructing such tournaments, including those most recently obtained by Aaron. I will also mention some open problems that may be good topics for further student research.
Time: Thursday, November 20, 2014, 3:004:00PM
Location: SCC 130
Where’s the Math? BIG Mathematical Research Problems
By
Tracy A. Bibelnieks, Ph.D.
Abstract:
Amazing research opportunities for mathematicians can be found in every sector of business, industry and government (BIG). This colloquium will present a selection of current BIG mathematical research problems across a variety of topic areas within mathematics. The presentation and introduction to the mathematical techniques used in researching solution strategies for the problems will be accessible to all undergraduates at some point in their major or minor! Students will be invited to engage in the session at various points to brainstorm, innovate and unleash their mathematical creativity. As a further note, this colloquium is also intended to interest and invite students to consider diving deeper into BIG research during spring semester in MATH 4095.
On the wave equation with local KelvinVoigt dampin
By
Zhuangyi Liu
Abstract:
In this talk, we will investigate the properties of the solution to the wave equation with local KelvinVoigt damping. The properties of its solution turned out to be surprisingly different from the wave equation with viscous damping. The wellknown Geometric Optics condition does not apply in this case. We will show that the properties rely on the smoothness and the growth rate of the damping coefficient function at the interface.
Gaining Success Early in Your Career  Opportunities for Math/Stat Majors
by
Greg Ostergren
UMD Mathematics Graduate 1977
Abstract:
Greg Ostergren, Chairman, President and CEO of several insurance companies with over a billion dollars in annual revenue, will share why he believes that the opportunities for math/stat majors have never been brighter. These opportunities are expanding exponentially and globally, crossing into every industry and field of study. Reflecting upon both his personal experiences throughout his career and his leadership responsibilities as CEO and as a Board member of numerous organizations, Mr. Ostergren will provide his insight into how math/stat majors should position themselves for a highly successful and lucrative career. He will also discuss principles and ideas for career advancement, especially in the early stages of your career.
Multivariate Bayesian Logistic Regression
by
Xuran Yan
UMD M.S. Candidate
Abstract:
When the outcome of a study only has two values, people usually apply logistic regression model to analyze the data. The estimation of the parameters in logistic model involves NewtonRaphson Method, which also generates the variance of the parameters at the same time. However, sometimes there are additional prior information we want to take into consideration, then the Bayesian approach is to be employed. To get the posterior distribution of the parameters in Bayesian approach, Gibbs Sampling, a special case of MCMC algorithm is needed in the calculation. Applications to the drug safety assessing data of both approaches will be given.
Time: Monday, August 18, 2014, 1:003:00PM
Location: SCC 130
Probability Based Premium Calculation for LTCI
by
Shinjini Kar
UMD M.S. Candidate
Abstract:
Long Term Care (LTC) Insurance is a recent field of study. In this project we discuss the probabilistic model depicting rates of disability in the elderly population and how to use that model and the corresponding probability observations to calculate insurance premiums for covers that assure LTC coverage in the event of disability. The two key aspects of this study come from an Italian paper (Levantesi et al.) which discusses the mathematical model and gives us a set of data with which to work, and a German paper (Helms et al.) which provides us with a method of premium calculation. Some trends and reasonable values are observed from our calculations.
Time: Tuesday, July 25, 2014, 3:005:00PM
Location: SCC 130
A Study of Recommender Systems With Applications
by
Xiaowen Fang
UMD M.S. Candidate
Abstract:
In this project, we studied KNearest Neighbor (KNN), asymmetric Singular Value Decomposition (SVD) and Restricted Boltzmann Machine (RBM) methods in recommender systems. We applied these methods to three datasets: movielens100k, AmazonMeta and R3.Yahoo!Music. By comparing their results, we found that the recommender methods are very much data oriented. Since AmazonMeta was collected based on friend recommendation settings, we obtained the lowest root mean square error (RMSE) among the three datasets by using the KNN algorithm. The users in the AmazonMeta dataset are correlated, RBM has large RMSE compared to the KNN and asymmetric SVD methods. For R3.Yahoo!Music all three methods give moderate RMSE, but none of the methods give RMSE less than 1. For the movieLens100k data, asymmetric SVD shows the best prediction among the three methods.
Time: Friday, July 18, 2014, 2:004:00PM
Location: SCC 130
Symmetric Chain Decompositions of Partially Ordered Sets
by
Ondrej Zjevik
UMD M.S. Candidate
Abstract:
A partially ordered set, or poset, is a set of elements and a binary relation which determines an order within elements. Various combinatorial properties of finite and ordered posets have been extensively studied during the last 4 decades. The Sperner property states that the size of the largest subset of pairwise incomparable elements does not exceed the size of the largest level set in an ordered poset. Since a symmetric chain decomposition is a sufficient condition for the Sperner property, we may prove the Sperner property by finding a symmetric chain decomposition for a poset.
In this paper we focus on three types of posets: the Boolean algebra, Inversion poset and the Young’s lattice. An explicit construction for a symmetric chain decomposition is known only for Boolean algebras. No explicit construction has been found for Inversion posets and Young’s lattices, a symmetric chain decomposition was found only for a small subset of these posets. Using a maximal flow, we introduce an algorithm for finding this decomposition. We present our results and discuss two implementations of this algorithm.
Time: Tuesday, July 8, 2014, 3:005:00PM
Location: SCC 130
Estimation of Large Covariance Matrices using the POET Estimator
by
Michal Hrabia
UMD M.S. Candidate
Abstract:
Covariance matrix estimation is a standard problem of multivariate statistics. Nevertheless, in highdimensional case, the classical sample covariance estimator S is not consistent anymore, since its maximum eigenvalue is different from the maximum eigenvalue of the population covariance matrix. Usually, to deal with this issue, we assume sparsity of the covariance matrix. There are cases, however, when the sparsity assumption is inappropriate due to strong relationship between the covariates and when some other estimation methods need to be used.
In this project, we present an estimator that can be used in the case when covariance matrix is not sparse, the Principal Orthogonal Component Thresholding (POET) estimator, introduced by Fan, Liao and Mincheva in 2013. To form this estimator, we use the spectral decomposition of the sample covariance matrix. We keep the part of S formed by the first K principal components and perform thresholding on the remaining part. The final estimator is the sum of these two parts. We derive the POET estimator using two different approaches and present the theorem about the convergence of POET, by Fan, Liao and Mincheva. Finally, we show how using POET can improve stock portfolio allocation.
Time: Monday, June 16, 2014, 3:005:00PM
Location: SCC 130
S&P Effect and Investment Classification
by
Xiao Li
UMD M.S. Candidate
Abstract:
S&P effect refers to the turbulence of price movement exhibited by the stocks that have been newly added to S&P 500 index. In previous paper, positive intermediateperiod return is documented, while few touch the price reversal in the sixday period following the effective day.
In this paper, we first demonstrate the price reversal being significant which sheds light on lucrative short selling profit. Second, based on empirical evidence, we propose 8 explaining features and later we knock down to two best ones. In the end, we utilise SVM (support vector machine) to nonparametrically construct classification region.
Time: Thursday, June 12, 2014, 2:004:00PM
Location: SCC 130
by
Long Chen
UMD M.S. Candidate
Abstract:
Extreme value theory can be used to predict the occurrence of rare events, such as extreme food, large insurance losses, stock market crash, or human life expectancy.
In this project, we apply the extreme value theory to the athletic events.
For athletic events, we mainly focus on the estimation of best athletic performance in near future using extreme value theory. Two types of estimation methods will be used, namely, moment method and maximum likelihood method (MLE). We will give estimation of future athletic record using both methods and compare the results.
Time: Monday, June 9, 2014, 3:005:00PM
Location: SCC 130
Central Limit Theorem for Testing the Equality of Covariance Matrices
by
Wenchuan Guo
UMD M.S. Candidate
Abstract:
In this project, we are interested in testing for the equality of k covariance matrices of p dimensional multivariate normal distributions where the likelihood ratio test is used. The asymptotic distribution of the test statistics under different conditions is needed. In traditional multivariate analysis, the dimension p is considered to be a fixed constant that is unchanged as n approaches infinity. However, in practice, the dimension may be proportional to sample size n. In this project, we treat the dimension p as a function of sample size n and studied the hypothesis test under the general conditions that min ni/p ≥ c > 1. We also assume the number of populations k to be a variable that changes with sample size ni under the condition k/ni → ∞. The limit distribution of the test statistics when sample size n goes to infinity is a chisquare distribution which is invalid when dimension p and number of populations k are large. We derive the central limit theorem when p, k are variables. Numerical simulations for the two different approximations including histograms of simulated values and estimation of power and size are presented at the end of this project.
Time: Wednesday, May 21, 2014, 3:005:00PM
Location: SCC 130
Magic Boxes and Related Topics
by
Michael Lillegard
UMD M.S. Candidate
Abstract:
Magic boxes are a 3dimensional generalization of magic rectangles, which in turn are a classical generalization of the magic square. In this talk, two new generalizations of the magic box are introduced: the magic box set and the magic hollow box. Several necessary and sufficient conditions for the existence of these structures are examined, as well as conditions which preclude the existence of these structures.
Time: Tuesday, May 20, 2014, 3:005:00PM
Location: SCC 130
The Asymptotic Expansion of Eigenvalues for an Abstract System of Coupled Evolution Equations
by
Zhaobin Kuang
UMD M.S. Candidate
Abstract:
This project develops the methods and techniques to estimate and compute the asymptotic expansion of the roots of the following quartic equation about :
where, as , and the parameters are , , and . This quartic equation is the characteristic equation of the following abstract system of coupled evolution equations:
where is a selfadjoint, positive definite operator on a complex Hilbert space .
We will show that our work is an essential step towards a complete stability and regularity analysis of the abstract system. For root estimation, we first solve different quartic equations in the parameter space numerically. A piecewise linear regression algorithm is then employed to determine the pattern of the leading term of the roots in different regions of the parameter space as . An algorithm based on modified Taylor expansion is proposed to asymptotically expand the roots of the quartic equation. We also provide a simple proof for determining the leading term of the roots. Based on the leading terms of these eigenvalues sequences, we will provide reasonable conjectures on the stability and regularity of the solution to the abstract system. Order of polynomial stability as well as order of Gevrey class will also be conjectured. We will also prove the optimality of the order given that the conjectures proposed are true.
Time: Monday, May 19, 2014, 2:004:00PM
Location: SCC 130
Use of Chebyshev Polynomials to Construct and Hilbert Space Inner Product to Solve Eigenvalue Problems With High Accuracy
by
Zhengfei Rui
UMD M.S. Candidate
Abstract:
Based on Chebyshev polynomials, and Hilbert Space Inner Product functions, which satisfy the given boundary conditions, can be constructed to solve a eigenvalue problem. With such two basis functions, it is easy to discretize the given eigenvalue functions and solve the corresponding eigenvalues by exploiting the properties of Chebyshev polynomials. Moreover these two techniques lead to higher accuracy results than the Tau method.
Time: Thursday, May 14, 2014, 1:003:00PM
Location: Chem 153
Three Undergraduate Research Projects
by
Jasmine Helgeson, Chenxiao Hu and Jing Lv
Abstract:
In this colloquium three UMD undergraduate students will describe their research projects.
Jasmine Helgeson examined the extent to which policies have created differences in the amount of electrical power generated from wind turbines across the US.
Chenxiao Hu used the community college GPA of transfer students enrolled in UMD General Biology to create a model for predicting class grades. She will explain particularly interesting effects of SCSE major and gender.
Jing Lv studied how volume and the price/earnings ratio affects stock price based on company size.
Time: Thursday, May 8, 2014, 3:004:00PM
Location: MoH 203
Breaking Codes by Solving Polynomials: Algebraic Cryptoanalysis
by
Gregory Bard
University of Wisconsin  Stout
Abstract:
Algebraic cryptanalysis is the process of turning a cipher into a system of polynomial equations, and then solving the equations to obtain the secret key of the cipher. First, it is interesting to see how alldigital circuits, but especially hardware ciphers, can be encoded as polynomial systems of equations mod 2. Second, it also exciting to see a specific example, and so I will discuss my dissertation work on breaking the cipher Keeloq, which is used in nearly all automobiles with remote keyless entry. I will briefly touch on work done upon some other ciphers, and other noncryptographic applications.
Time: Thursday, May 1, 2014, 3:00PM
Location: SCC 130
OutofClass Mathematics Experiences
by
Philip Bauer, Jordan Maiers and Adam Swinney
Abstract:
In this colloquium two UMD students will describe their honors projects and a third will discuss his internship. Philip Bauer explored some properties of continued fractions; Jordan Maiers investigated the behavior of the Mandelbrot set; and Adam Swinney was a Travelers Insurance, oil and gas actuarial summer student.
Time: Thursday, April 24, 2014, 3:004:00PM
Location: MoH 203
Computational Investigations of Boundary Effects on CFD Simulations of Thermoacoustic Instabilities
by
Qingzhao Wang
Abstract:
The increasing awareness of environmental issues has been challenging gas turbine designers since early 90s. Lean premixed combustion is one of the strategies to achieve low NOx emission, and has been widely applied in gas turbines. However, near the leancombustion limit, the gas turbines are more susceptible to thermoacoustic instabilities, which may cause loud noise, violent vibration, structural destruction, and time and economic cost. Thus, it is desirable and essential to predict and control the occurrence of thermoacoustic instabilities. Many studies have been focusing on the Computational Fluid Dynamics (CFD) simulations to explore this phenomenon, but they either made simplifications and ignore some complex but important mechanisms, or required impractically long time for computations. In this talk, I will first present the key issues in simulating the coupling process of heat release rate and pressure fluctuations involved in thermoacoustic instability phenomenon. Then I will talk about the potential sensitivity analysis approaches that are applicable to investigations of boundary condition effects on thermoacoustic instabilities. The focus is on the formulation of Continuous Sensitivity Equation (CSE) method applied to the Direct Numerical Simulation (DNS) of thermoacoustic instability problems. This proposed sensitivity analysis approach only requires a single run of the CFD simulation. Moreover, the sensitivities of field variables, pressure, velocity and temperature to boundarycondition parameters are directly obtained from the solution to sensitivity equations. Thermoacoustic instability is predicted by the Rayleigh criterion and indicated by Rayleigh index. The sensitivity of Rayleigh index is computed utilizing the sensitivities of field variables. This approach is validated through the 1D thermally induced acoustics problem.
Time: Thursday, April 17, 2014, 3:00PM
Location: SCC 130
Mathematical Contest in Modeling 2014
by
Jasmine Helgeson, Penghuan Ni, Tim Schoenheider, Philip Bauer, Jesse Schmieg and Joe Toninato
UMD Mathematics & Statistics Undergraduate Students
Abstract:
Each February, a nationwide international Mathematical Contest in Modeling (MCM) is held. Contestants have 96 hours to select from one of two problems and submit a solution. This year, two teams represented UMD. One team selected PROBLEM A: The KeepRightExceptToPass Rule, to develop a model to determine whether this is an effective rule in promoting better traffic flow, or whether some other rule might be better. The other team selected PROBLEM B: College Coaching Legends, to build a mathematical model to choose the best college coach or coaches from among either male or female coaches in such sports as college hockey, field hockey, football, baseball, basketball, or soccer.
The teams will discuss the contest problems, their proposed solutions, and their overall experience with the competition.
Time: Thursday, April 10,2014, 3:004:00PM
Location: MoH 203
mregular partitions and etafunction symmetries
by
William Keith
Abstract:
A famous result in partition theory is Ramanujan's congruences, that the number of partitions of 5n+4 is divisible by 5, those of 7n+5 divisible by 7, and those of 11n+6 divisible by 11. These are now understood as members of an infinite family of such congruences, unified by the symmetries of modular forms. More recent work has been devoted to finding congruences for the mregular partitions, those in which parts may not be divisible by m. These are now numerous, but we do not yet have a similar unifying structure. This talk will outline each of these ideas, demonstrate that it is now fairly easy to prove many conjectured congruences with current techniques, and lay out a few ideas, tentative as yet, for constructing such general theorems.
Time: Thursday, April 3,2014, 3:00PM
Location: SCC 130
The Role of Statisticians in Medical Reserach
by
Ross Garberich
Abstract:
Statisticians play a critical role in medical research. They help design studies, validate and analyze data and write abstracts, manuscripts and reports for publication. Additionally, as hospitals and healthcare systems face continued pressure to reduce costs and improve patient outcomes, the roles statisticians’ play continues to expand, Aided by the implementation of electronic health records, statisticians are beginning to play key roles in reporting realtime analytics and predictive modeling for patients who are still admitted to the hospital.
The presentation gives a brief overview of the varying roles that statisticians play in the field of medicine, the different types of business that hire statisticians, and some examples of different projects on which I have worked.
Time: Thursday, March 27 ,2014, 3:004:00PM
Location: MoH 203
NonLinear Eigenvalue Problems
by
Thomas Cameron
Abstract:
The standard linear eigenvalue problem Av = λ v and the generalized linear eigenvalue problem Av = λBv are introduced in the latter part of undergraduate school and become well known in graduate school.
Moreover, we have successful numerical algorithms for finding both the eigenvalue λ and the eigenvector v, specifically the QR, QZ, and Francis algorithm to name only a few.
However, when it comes to nonlinear eigenvalue problems, for example
(Aλ^{2} + Bλ + C)v = 0
it is rare for a student to come across this problem in their course studies, even at the graduate level. Truthfully, the best numerical algorithms of the day, perhaps in defeat, simply linearize the problem and refer to our old friends, QR, QZ, and Francis.
We will take a look at some general properties of nonlinear eigenvalue problems, a brief history of the numerical methods for solving the linear eigenvalue problem, some nonlinear methods, and a Gersgorin like theorem for the bounds of the eigenvalues with some practical results.
Time: Thursday, March 13 ,2014, 3:004:00PM
Location: SCC 130
What is Theoretical Computer Science
by
Karl Wimmer
Abstract:
In this talk, we will give a survey of various areas of theoretical computer science and the role that mathematics plays in these areas. We will discuss some applications such as machine learning and voting theory, as well as some theoretical topics. We will also discuss some realworld problems (that we would really like to be able to solve), which appear to be computationally hard not only to solve exactly, but also to solve approximately.
The material presented in the talk will be heavily influenced by the problems studied during the ``Real Analysis in Computer Science'' program (which the speaker attended as a Research Fellow) held during Fall 2013 at the Simons Institute for the Theory of Computing at the University of CaliforniaBerkeley.
Time: Thursday, March 6,2014, 3:004:00PM
Location: MoH 203
Xuan Li
Abstract:
Regression is a statistical approach to investigating the relationship between variables. Regression techniques have been widely used in almost every field.
This talk will be given by STAT 5511 Regression Analysis students (2013 Fall semester) based on their class projects:
 Estimation of Risk Rates using Arbitrage Pricing Theory (Michal Hrabia)
 Lake Superior  clear and cold, almost good enough to drink (Tim Cyr, Yvette Ibrahim, Dave Ongaro, Kelly Peterson, Andrea Samuelson, Miranda Steinmetz)
 Effects of Minimum Wage on Inflation (Katherine Borchert, Shinjini Kar, Cole Mathson)
 Cases of Infectious Diseases: Determinants of the Number of Deaths due to Tuberculosis across Nations (Matthew Arthur, Jasmine Helgeson, Xiao Li, Penghuan Ni, Kyle Vezina, Zichao Wang)
Time: Thursday, February 20,2014, 3:004:00PM
Location: MoH 203
Combinatorial Problems Motivated by Databases
by
Uwe Leck
Abstract:
Some combinatorial problems and results will be discussed that arise in the context of restoration of lost information in distributed databases. Consider a set T of lattice points in a k x k grid and call it a configuration. You can think of the points in T as faulty nodes that need to be repaired or decoded. Performing a step of decoding means transforming T into a new configuration T’ by removing all points belonging to some horizontal or vertical line L, under the constraint that only t points of T are on L (where t is some given number). T is decodable if it can be transformed into the empty set by an appropriate sequence of decoding steps. Examples of interesting questions in this context are: What is the largest size of a decodable configuration? Among all decodable configurations with the same given number of points, which are the hardest to decode (i.e., which require the most decoding steps)? What are the smallest decodable configurations that require some given number of decoding steps? How does all this generalize to higher dimensional grids?
Time: Thursday, February 6,2014, 3:004:00PM
Location: MoH 203
Recent Advances in Rankbased Inference for Accelerated Failure Time
by
Steven Chiou
Abstract:
Semiparametric accelerated failure time (AFT) models have not been used as frequently as Cox relative risk models in such settings due to lack of efficient and reliable computing routines for inferences. The challenge roots in the nonsmoothness of the rankbased estimating functions. The recently proposed induced smoothing approach, which provides fast and accurate rankbased inferences for AFT models. The induced smoothing approach is generalized to incorporate weights to accommodate different rank weights and additional weights from missing data and various sampling schemes. The variances are estimated with an efficient resampling approach that avoids solving estimating equations repeatedly. I will demonstrate the methods in a numerical study. As expected, the proposed estimators were obtained much faster without loosing accuracy in comparison to those from nonsmooth estimating equations, and the variance estimators provided good approximation of the variation in estimation.
Time: Thursday, January, 30 2014, 3:004:00PM
Location: 130 SCC
Kyle Krueger and Brett Bozyk
Abstract:
The world of retail is evolving quickly. Amazon.com has forced the brickandmortar chains to evolve rapidly, and the guiding hand that steers that evolution is analytics. A retail analyst can use massive data sets within tools like SAS and Excel to answer questions about what should go on the shelves, where it should go, how much space should be allocated, and more. Metrics like exclusivity, penetration, and lift can better inform decisions made by the business on a daily basis, and ensure that a company stays relevant to its consumer base.
Time: Thursday, December 12, 2013, 3:004:00PM
Location: 150 Chemistry
Mathematics courses in various parts of the world and study abroad recommendations for UMD mathematics and statistics students
by
Lucas Gloege, Inne Singgih and Ondrej Zjevik
Abstract:
Spending a term abroad can be very expensive and it can delay a student’s progress toward graduation. However, for many students these costs are more than balanced by eyeopening and life changing experiences they have while studying in a foreign country. Planning ahead is important for reducing the negatives and increasing the positives of a semester spent abroad. This includes, in part, determining what courses to take at UMD and what courses to take abroad. Since university mathematics and statistics education is not uniform across the world, foreign course syllabi and even UMD course equivalences provide only partial information.
In this colloquium three UMD graduate students, each of whom majored in mathematics as an undergraduate, will talk about their educational experiences in three different parts of the world. Inne Singgih will talk about her bachelor’s degree program at the University of Indonesia in West Java Province and her work as a mathematics educator in Indonesia. Ondrej Zjevik will talk about his bachelor’s degree program at VSB – Technical University of Ostrava, Czech Republic and how it compares with the mathematics programs at UMD. Lucas Gloege spent a semester abroad at Waikato University in New Zealand, while earning his BS from UMD. He will talk about his preparations for studying abroad, the courses he took at Waikato U. and his experiences in New Zealand. He will also give studyabroad recommendations for UMD mathematics and statistics students.
Time: Thursday, November 21, 2013, 3:004:00PM
Location: 150 Chemistry
Making math fun for mathphobic children
by
Ken Stanley, Director, Dubois Project of Oberlin College
Abstract:
The United States lags many developing countries in educational performance, particularly in our education of children of underrepresented minorities and children from families of lower socioeconomic status. Local funding for schools is part of the problem as students from lowincome families disproportionately attend poorly funded schools, however, local funding does not explain why these children perform poorly in all schools. In Oberlin, Ohio children from all backgrounds attend the same K12 schools, yet the achievement gap persists. Motivation, especially intrinsic motivation, drives educational achievement. The Du Bois Project helps underrepresented minorities and children from low socioeconomic families achieve and maintain excellence in the Oberlin Public Schools by helping them learn to enjoy math. We will explain how we use running, music, simple psychology and motivated Oberlin College students to make math fun.
Time: Thursday, November 15, 2013, 3:004:00PM
Location: 70 Montague Hall
Hypercube orientations with degree restrictions, or what color is my hat?
by
Steve Butler, Department of Mathematics, Iowa State University
Abstract:
There are many variations of hat guessing games, which generically consist of a group of players forming a strategy about how each player will go about guessing the color of their own hat by using information gleaned from looking at the hats of other players (but not their own). Strategies in this game can be rephrased in terms of hypercube orientations with given degree restrictions. We will look at several problems in this direction and give some open problems.
Time: Thursday, November 14, 2013, 3:004:00PM
Location: 130 Solon Campus Center
Why is Tuition So High at UMD?
by
Richard Green, Department of Mathematics, UMD
Abstract:
Tuition at UMD is now 55 times as high as it was in 1960, when I was a student here. Adjusted for inflation, tuition is seven times as high as it was in 1960. In this talk I will demonstrate the fact of tuition increase and I will discuss some of its causes and consequences. I will give three reasons why tuition at UMD should be no more than onethird of what it is now. I will also discuss some recent literature on the management and funding of American higher education, including the radical, democratic idea that public colleges and universities should be tuitionfree.
Time: Thursday, November 7, 2013, 3:004:00PM
Location: 150 Chemistry
Independent Variable Rescale to Solve Parabolic PDEs with Periodic Boundary Conditions Containing State Dependent Coefficients
by
Brian Hinderliter, Department of Mechanical and Industrial Engineering, UMD
Abstract:
Developing a test procedure that can predict the corrosion protection of a coating designed to last for 20 years is challenging, particularly accurately predicting behavior over decades with tests that last months. Fick’s second law of diffusion (parabolic PDE) is applied to coating surfaces exposed to varying surface water concentrations and temperatures (boundary conditions) at cyclical intervals. The diffusion coefficient is temperature dependent, in this example, of an Arrhenius form. The governing equations are solved using Laplace transforms after time rescaling to account for the variation in temperature, which impacts the diffusion coefficient between the wet and dry portions of several accelerated weathering protocols. This serves to predict the asymptotic water concentration in the coating as well as at the coatingmetal interface based on physical constants of the coating and parameters of the accelerated weathering protocol of interest. The analytic solution to Fick’s second law also allows the water concentration at the substratecoating interface to be predicted based on Arrhenius parameters of the diffusion process. This resultant average time of wetness and water concentration variance at the coatingsubstrate interface can be used to more directly compare corrosion and adhesion loss between various accelerated weathering protocols and natural weathering conditions.
Time: Thursday, October 31, 2013, 3:004:00PM
Location: 130 Solon Campus Center
Attitudes and prestige systems among Varieties of Kriol Language in Belize
by
Ron Regal, Department of Mathematics, UMD
William Salmon, Department of Linguistics, UMD
Abstract:
Belize, formerly British Honduras, gained full independence from Great Britain in 1981. While there is a strong influence of English as a result of its colonial history, Belize is linguistically diverse. In an ongoing project, Jennifer Gomez Menjivar, Foreign Languages UMD, and William Salmon, Linguistics, UMD, are examining the attitude and prestige system in place among varieties of Kriol, an Englishbased creole. As part of their study, Drs. Menjivar and Salmon had respondents rate speakers from Belize City and Punta Gorda, two different cities in Belize, on 16 personality attributes. Will Salmon will describe their study, and Ron Regal will tell some about considerations statistical data analysis and an analysis in this study in particular.
The talk will give an introduction to one aspect of linguistics and will be particularly of interest to students potentially interested in double majors in mathematics/statistics and linguistics. Study reports on language attitudes toward varieties of Belizean Kriol in coastal Belize. We used a verbalguise test with 82 participants, collecting both quantitative and qualitative data in Punta Gorda and Belize City, and we found that the variety of Kriol spoken in Belize City is perceived along several dimensions as being of greater prestige than the variety spoken in Punta Gorda. Derivative of these findings is the potentially more interesting fact that there is more than one variety of Kriol spoken in Belize in the first place—a fact which has not been previously reported in the literature. This research is part of an ongoing project investigating the overt and covert linguistic prestige system in place with respect to Belizean Kriol. The larger project will break down attitude factors among the individual ethnic groups in Belize in a series of articles.
Time: Thursday, October 24, 2013, 3:004:00PM
Location: 150 Chemistry
David Clark, Department of Mathematics, UMTC
Abstract: The seven siblings at the Clark farm have a massive list of chores to do. How can they divide them up fairly? Can they divide them fairly? Luckily, designs can help! Designs are a combinatorial object, which encode fairness, balance, and geometric structure. They are useful in a remarkable variety of situations, from dividing chores fairly through designing statistical experiments. One of the key modern uses of designs is to provide flexible and efficient errorcorrecting codes, which protect data transmissions from errors. We will define designs, give many examples, and study how their representation as (0,1)matrices provides a surprising link to cutting edge communications.
Time: Thursday, October 17, 2013, 3:004:00PM
Location: 130 Solon Campus Center
Math Majors and Information Security in a Digital Age: Any Connection?
by
Dr. William Krossner
Abstract: We consider the usual model of a sender of information, a channel of communication, and the intended receiver of this information. In the digital age, what role does mathematics play in rendering the transmitted information secure from the eyes of unintended or malicious receiving entities (such as spies, governments, corporations, cybercriminals, and the like)? Of course, for centuries various cryptographic methods (codes and ciphers) have been invented and used to try to keep information secret.
In the 20th century, the design of cryptographic methods was taken over by mathematics, so much so that today there are many job openings for math majors and graduates in both governmental and commercial entities around the world to deal with information security issues. The speaker will briefly outline one of the earliest allmathematical cipher methods (from 1929), but spend most of the time demonstrating the verylittleknown fact that within each computer operating system (Windows, Mac or Linux) there is a cryptographic laboratory available for use, powerful enough to produce cipher methods difficult for even supercomputers to solve. Any math major is smart enough to use this laboratory, and everything connected with it is free.
Audience members who bring their own USB drives may copy all of the speaker's apps for their own use at the end of the talk.
Time: Thursday, October 10, 2013, 3:004:00PM
Location: 150 Chemistry
Families of Infinite Series With Interesting Limiting Structure
by
John Greene, Department of Mathematics, UMD
Time: Thursday, October 3, 2013, 3:004:00PM
Location: 130 Solon Campus Center
Mathematics: The Science of Patterns
by
Joseph Gallian
Professor of Mathematics, UMD
Abstract: I will discuss three research projects involving patterns I have worked on that are accessible to a broad interdisciplinary audience. One was to figure out the algorithms used by computers to check the validity of product identification numbers on bar codes, credit cards, and books. Another entails deciphering the secret algorithm used by Minnesota and other states to code driver's license numbers. The third was to devise algorithms to create intricate symmetry patterns.
Although intellectual curiosity is the motivation for all my research, the results sometime yield unanticipated applications and unexpected media attention.
These will be described in the presentation.
Time: Friday, September 20, 2013, 3:004:00PM
Location: 70 Montague Hall
Steiner problems, soap films, minimal surfaces, and complex analysis
by
Michael Dorff
Professor of Mathematics, Brigham Young University
Abstract: We will start with a Steiner problem that ask the question what is the shortest path between several points. Then we will transform Steiner problems up one dimension to minimal surfaces that can be modeled by soap films demonstrating a few handson examples. As we do this we will discuss some differential geometry as background for minimal surfaces, diverge into complexvalued harmonic mappings, and discuss the connection between minimal surfaces and complexvalued harmonic mappings. Finally we will discuss some new research using complexvalued harmonic mappings to construct harmonic mappings.
Time: Thursday, September 19, 2013, 4:30PM
Location: 130 Solon Campus Center
How Math is Changing the World
by
Michael Dorff
Professor of Mathematics, Brigham Young University
Abstract: In Oct 2010, an article called "How much math do we really need?" was published in the Washington Post. The author, a mathematician, wrote, "Unlike literature, history, politics and music, math has little relevance to everyday life" and "All the mathematics one needs in real life can be learned in early years without much fuss." Is this true? Have you ever been asked, "What can you do with a degree in math?" Except for teaching, many people are clueless on what you can do with strong math skills. In this talk, we will discuss some of the exciting things mathematicians in business, industry, and government are doing in their careers and how these things are changing the world. And we will reveal the three things that recruiters say every math student should do to get a job.
Time: Thursday, September 19, 2013, 3:004:00PM
Location: 150 Chemistry