Mathematics Commons^™

Deterministic And Stochastic Bellman's Optimality Principles On Isolated Time Domains And Their Applications In Finance, Nezihe Turhan

Masters Theses & Specialist Projects

The concept of dynamic programming was originally used in late 1949, mostly during the 1950s, by Richard Bellman to describe decision making problems. By 1952, he refined this to the modern meaning, referring specifically to nesting smaller decision problems inside larger decisions. Also, the Bellman equation, one of the basic concepts in dynamic programming, is named after him. Dynamic programming has become an important argument which was used in various fields; such as, economics, finance, bioinformatics, aerospace, information theory, etc. Since Richard Bellman's invention of dynamic programming, economists and mathematicians have formulated and solved a huge variety of sequential decision …

Development Of Fractional Trigonometry And An Application Of Fractional Calculus To Pharmacokinetic Model, Amera Almusharrf

Masters Theses & Specialist Projects

No abstract provided.

Finding The Beat In Music: Using Adaptive Oscillators, Kate M. Burgers

HMC Senior Theses

The task of finding the beat in music is simple for most people, but surprisingly difficult to replicate in a robot. Progress in this problem has been made using various preprocessing techniques (Hitz 2008; Tomic and Janata 2008). However, a real-time method is not yet available. Methods using a class of oscillators called relay relaxation oscillators are promising. In particular, systems of forced Hopf oscillators (Large 2000; Righetti et al. 2006) have been used with relative success. This work describes current methods of beat tracking and develops a new method that incorporates the best ideas from each existing method and …

Markov Bases For Noncommutative Harmonic Analysis Of Partially Ranked Data, Ann Johnston

HMC Senior Theses

Given the result $v_0$ of a survey and a nested collection of summary statistics that could be used to describe that result, it is natural to ask which of these summary statistics best describe $v_0$. In 1998 Diaconis and Sturmfels presented an approach for determining the conditional significance of a higher order statistic, after sampling a space conditioned on the value of a lower order statistic. Their approach involves the computation of a Markov basis, followed by the use of a Markov process with stationary hypergeometric distribution to generate a sample.This technique for data analysis has become an accepted tool …

Verification Of Solutions To The Sensor Location Problem, Chandler May

HMC Senior Theses

Traffic congestion is a serious problem with large economic and environmental impacts. To reduce congestion (as a city planner) or simply to avoid congested channels (as a road user), one might like to accurately know the flow on roads in the traffic network. This information can be obtained from traffic sensors, devices that can be installed on roads or intersections to measure traffic flow. The sensor location problem is the problem of efficiently locating traffic sensors on intersections such that the flow on the entire network can be extrapolated from the readings of those sensors. I build on current research …

Extending List Colorings Of Planar Graphs, Sarah Loeb

HMC Senior Theses

In the study of list colorings of graphs, we assume each vertex of a graph has a specified list of colors from which it may be colored. For planar graphs, it is known that there is a coloring for any list assignment where each list contains five colors. If we have some vertices that are precolored, can we extend this to a coloring of the entire graph? We explore distance constraints when we allow the lists to contain an extra color. For lists of length five, we fix $W$ as a subset of $V(G)$ such that all vertices in $W$ …

Combinatorial Interpretations Of Fibonomial Identities, Elizabeth Reiland

HMC Senior Theses

The Fibonomial numbers are defined by \[ \begin{bmatrix}n \\ k \end{bmatrix} = \frac{\prod_{i=n-k+1} ^{n} F_i}{\prod_{j=1}^{k} F_j} \] where $F_i$ is the $i$th Fibonacci number, defined by the recurrence $F_n=F_{n-1}+F_{n-2}$ with initial conditions $F_0=0,F_1=1$. In the past year, Sagan and Savage have derived a combinatorial interpretation for these Fibonomial numbers, an interpretation that relies upon tilings of a partition and its complement in a given grid.In this thesis, I investigate previously proven theorems for the Fibonomial numbers and attempt to reinterpret and reprove them in light of this new combinatorial description. I also present combinatorial proofs for some identities I did …

Operator Splitting Method And Applications For Semilinear Parabolic Partial Differential Equations, R. Corban Harwood

Faculty Publications - Department of Mathematics

This dissertation presents a redefined operator splitting method used in solving semilinear parabolic partial differential equations. As one such form, the reaction-diffusion equation is highly prevalent in mathematical modeling. Besides being physically meaningful as a separation of two distinct physical processes in this equation, operator splitting simplifies the solution method in several ways. The super-linear speed-up of computations is a rewarding simplification as it presents great benefits for large-scale systems. In solving these semilinear equations, we will develop a condition for oscillation-free methods, a condition independent of the usual stability condition. This numerical consideration is important to fully embody our …

Critical Issues In Middle And Secondary Mathematics Placement: A Case Study, Morgan E. Summers

Undergraduate Honors Capstone Projects

This qualitative research project focuses on the issues facing middle and secondary mathematics placement through an extensive literature review as well as a case study of a local school district. As students move from elementary school to middle and secondary schools, they are placed into classes that appear to be based on ability. One of the driving questions of this project is how is this ability level determined? Through an in-­‐depth look at one school district, it is found that a primary source of information is both norm-­‐referenced and criterion-­‐referenced assessments given to students in fifth and eighth grades. In …

The Impact Of Manipulatives On Learning In The Elementary And Middle School Mathematics Classroom, Laura Dahl

Mathematics Graduate Theses

This paper is a review of research pertaining to the use of manipulatives in the elementary and middle school mathematics classrooms. It embodies the logic behind using manipulative materials in the classroom setting and the impact their use will have on student understanding and enjoyment for learning mathematical concepts. This research paper will identify the struggles and concerns of manipulative use along with the need of increased professional development and training for teachers to be better prepared for the daunting, yet rewarding challenges of successfully teaching mathematics.

The Roller-Coaster Conjecture, Leslie A. Cheteyan

Theses, Dissertations and Culminating Projects

No abstract provided.

Polynomial Solutions To The Diophantine Equation X² + Y³ = 6912z², Emel Demirel

Theses, Dissertations and Culminating Projects

In this paper, I investigate polynomial solutions to the Diophantine equa­ tion, X² +Y³ = 6912Z², where X = g(x,y), Y = h(x,y) and Z = f(x,y) are polynomials with integer coefficients. The focus is on the greatest common di­ visors for the integer values of these polynomials when the polynomials f (x, y), g(x, y) and h(x, y) are relatively prime in Q[x, y]. However, for a fixed integer pair xo, Yo, the integer values f(x0,y0), g(x0, y0) and h(x0,y0) are not necessarily relatively prime in Z. I investigate the greatest common divisors (GCDs) of these three polynomial values …

Row Reduction Of Macaulay Matrices, Lorrin Debenport

Honors Theses

A computer can use a matrix to represent a system of non-linear multivariate polynomial equations. The fastest known ways to transform this system into a form with desirable computational properties rely on transforming its matrix into upper-triangular form [8, 9]. The matrix for such a system will have mostly zero entries, which we call sparse [7]. We propose to analyze several methods of performing row-reduction, the process by which matrices are reduced into upper-triangular form [2].

What is special about row-reducing matrices in this context? When row-reducing a matrix, swapping rows or columns is typically acceptable. However, if the order …

Statistical Inference Of A Measure For Two Binomial Variates, Serena Petersen

UNLV Theses, Dissertations, Professional Papers, and Capstones

We study measures of a comparison for two independent binomial variates which frequently occur in real situations. An estimator for measure of reduction (MOR) is considered for two sample proportions based on a modified maximum likelihood estimation. We study the desirable properties of the estimator: the asymptotic behavior of its unbiasedness and the variance of the estimator. Since the measure ρ is approximately normally distributed when sample sizes are sufficiently large, one may establish approximate confidence intervals for the true value of the estimators. For numerical study, the Monte Carlo experiment is carried out for the various scenarios of two …

Modules Over Localized Group Rings For Groups Mapping Onto Free Groups, Nicholas Davidson

Boise State University Theses and Dissertations

In 1964, Paul Cohn showed that if F is a finitely-generated free group, and Q a field, then all ideals in the group ring Q[F] are free as Q[F]-modules. In particular, all finitely-generated submodules of free Q[F]-modules are free. In 1990, Cynthia Hog-Angeloni reproved this theorem using techniques from geometric group theory. Leaning on Hog-Angeloni's methods, we prove an analogous statement for crossed products D * F, with D a division ring.

With this result in hand, we prove that if G = H⋊F, the semi-direct product …

A Stochastic Model For Wind Turbine Power Quality Using A Levy Index Analysis Of Wind Velocity Data, Jonathan Blackledge, Eugene Coyle, Derek Kearney

Conference papers

The power quality of a wind turbine is determined by many factors but time-dependent variation in the wind velocity are arguably the most important. After a brief review of the statistics of typical wind speed data, a non- Gaussian model for the wind velocity is introduced that is based on a Levy distribution. It is shown how this distribution can be used to derive a stochastic fractional diusion equation for the wind velocity as a function of time whose solution is characterised by the Levy index. A Levy index numerical analysis is then performed on wind velocity data for both …

Noise, Delays, And Resonance In A Neural Network, Austin Quan

HMC Senior Theses

A stochastic-delay differential equation (SDDE) model of a small neural network with recurrent inhibition is presented and analyzed. The model exhibits unexpected transient behavior: oscillations that occur at the boundary of the basins of attraction when the system is bistable. These are known as delay-induced transitory oscillations (DITOs). This behavior is analyzed in the context of stochastic resonance, an unintuitive, though widely researched phenomenon in physical bistable systems where noise can play in constructive role in strengthening an input signal. A method for modeling the dynamics using a probabilistic three-state model is proposed, and supported with numerical evidence. The potential …

Fraction-Free Methods For Determinants, Deanna Richelle Leggett

Master's Theses

Given a matrix of integers, we wish to compute the determinant using a method that does not introduce fractions. Fraction-Free Triangularization, Bareiss’ Algorithm (based on Sylvester’s Identity) and Dodgson’s Method (based on Jacobi’s Theorem) are three such methods. However, both Bareiss’ Algorithm and Dodgson’s Method encounter division by zero for some matrices. Although there is a well-known workaround for the Bareiss Algorithm that works for all matrices, the workarounds that have been developed for Dodgson’s method are somewhat difficult to apply and still fail to resolve the problem completely. After investigating new workarounds for Dodgson’s Method, we give a modified …

Euler E271 : A Link Between Mathematics Of Yesterday, Today, And Tomorrow, Sarah Ann Nelson

Honors Theses

The major focus of this departmental thesis was to complete t he first English translation of E271 Arithmetic Theorems Proven by a New Method, a mathematical treatise published by Leonhard Euler in Latin in 1761. Most importantly, E271 contains Euler's generalization of Fermat's Litt le Theorem and an exploration of the properties of (n). Altogether, this paper includes an Abstract, Introduction, Note to the Readers, Translation of Arithmetic Theorems Proven by a New Method, Epilogue, and References. More specifically, the Introduction is about the historical background of the mathematics and applications leading up to E271 and the key corresponding mathematicians. …

Groups And Semigroups Generated By Automata, David Mccune

Department of Mathematics: Dissertations, Theses, and Student Research

In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups ``expanding automaton semigroups''. We show that this class strictly contains the class of automaton semigroups, and we show that the class of asynchronous automaton semigroups strictly contains the class of expanding automaton semigroups. We demonstrate that undecidability arises in the actions of expanding automaton semigroups and semigroups …