|
|||||
|
|||||
On April 7, 2001 several Murray State students went to the Kentucky Sectional MAA Spring Conference hosted by the University of Kentucky. There were 9 student talks with 5 presented by Murray State students. The students and the name of their talks are listed below.
Next year's meeting is at Georgetown College in Georgetown, KY.
Students should see how they can participate next year, so we can have even more
students.
"An Application of the Heat Equation to Financial Mathematics," L. Wyatt Alverson II
The Black-Scholes Financial Equation is used to determine if an ordinary stock option of an asset, when compared to the market value of that same asset, has acquired a profit after maturing. This talk will demonstrate how a simple change in variables can turn the famous Black-Scholes Financial Equation into the less complex one-dimensional Heat Equation, which is then solvable using the Fourier Transform Method.
"Randomization Tests as an Alternative to Traditional Statistical Procedures, " Todd Baker
The purpose of this paper is to describe the use of randomization tests (RT). A RT can be used in situations where typically either parametric procedures (such as the t-test or ANOVA) or a rank-based nonparametric procedure is used. RTs make fewer assumptions than the other methods. Applications of the use of RTs in wildlife biology are given.
"Interesting Properties of Laplace Transforms," Thalya Burden
We will analyze the sufficient conditions for a Laplace Transform to exist. We will discuss properties of the derivatives of the Laplace Transform in one and two variables and apply these results to find the solution to ordinary and/or partial differential equations. Time permiting, we will discuss a particular property for Fourier transforms that does not hold for Laplace Transforms.
"Combinatorial Lie Representation Theory with Maple," John Eveland
This talk will present results from an undergraduate honors research project. The original goal of the project was to develop algorithms which would generate concrete pirctures of "Lie algebra representations." (Roughly speaking, a Lie algebra is a vector space which has a certain non-associative multiplication; a Lie algebra representation is a manifestation of a Lie algebra as a collection of matrices.) We were able to develop the desired algorithms and successfully implement them using the computer algebra system Maple. The concrete pictures we produce for a given representation are called "supporting graphs" and take the form of edge-colored directed graphs. We hope that our programs will be used in the future to test conjectures about the combinatorial structure, uniqueness, and relative efficiency of certain supporting graphs.
"Games and Graphs," Alison Marr
Graph theory is well-known for its applications to transportation problems, networking, even computer chip design. But you might also find it to be useful for entertaining guests at your next party. In this talk we will discuss applications of graph theory to some games and puzzles. The main focus of this talk will be the Instant Insanity game made popular in the 1960s by Parker Brothers.
Previous years participation:
2000
|
Math
Home | Faculty
| Math
Programs | Math
Courses |
Math Graduate
| Student
Research |
Last revised on
February 28, 2006
by Kenny
Fister