Other Mathematics Commons^™

The Creation Of A Video Review Guide For The Free-Response Section Of The Advanced Placement Calculus Exam, Jeffrey Brown

Honors Theses

The Creation of a Video Review Guide for the Free-Response Section of the Advanced Placement Calculus Exam follows the creation of a resource to help students prepare for the College Board’s Advanced Placement Calculus Exam. This project originated out of the authors personal experiences in preparing for this exam. The goal of the project was to create an accessible resource that reviews content, provides insights into the Advanced Placement exam, and creates successful habits in student responses. This paper, chronologically, details the development of the resource and a reflection on the final product and future uses.

A Traders Guide To The Predictive Universe- A Model For Predicting Oil Price Targets And Trading On Them, Jimmie Harold Lenz

Doctor of Business Administration Dissertations

At heart every trader loves volatility; this is where return on investment comes from, this is what drives the proverbial “positive alpha.” As a trader, understanding the probabilities related to the volatility of prices is key, however if you could also predict future prices with reliability the world would be your oyster. To this end, I have achieved three goals with this dissertation, to develop a model to predict future short term prices (direction and magnitude), to effectively test this by generating consistent profits utilizing a trading model developed for this purpose, and to write a paper that anyone with …

Regular Round Matroids, Svetlana Borissova

Electronic Theses, Projects, and Dissertations

A matroid M is a finite set E, called the ground set of M, together with a notion of what it means for subsets of E to be independent. Some matroids, called regular matroids, have the property that all elements in their ground set can be represented by vectors over any field. A matroid is called round if its dual has no two disjoint minimal dependent sets. Roundness is an important property that was very useful in the recent proof of Rota's conjecture, which remained an unsolved problem for 40 years in matroid theory. In this thesis, we …

Bio-Mathematics: Introduction To The Mathematical Model Of The Hepatitis C Virus, Lucille J. Durfee

Electronic Theses, Projects, and Dissertations

In this thesis, we will study bio-mathematics. We will introduce differential equations, biological applications, and simulations with emphasis in molecular events. One of the first courses of action is to introduce and construct a mathematical model of our biological element. The biological element of study is the Hepatitis C virus. The idea in creating a mathematical model is to approach the biological element in small steps. We will first introduce a block (schematic) diagram of the element, create differential equations that define the diagram, convert the dimensional equations to non-dimensional equations, reduce the number of parameters, identify the important parameters, …

Embedding Oriented Graphs In Books, Stacey R. Mcadams

Doctoral Dissertations

A book consists of a line L in [special characters omitted]3, called the spine, and a collection of half planes, called pages, whose common boundary is L. A k-book is book with k pages. A k-page book embedding is a continuous one-to-one mapping of a graph G into a book such that the vertices are mapped into L and the edges are each mapped to either the spine or a particular page, such that no two edges cross in any page. Each page contains a planar subgraph of G. The book thickness, denoted bt( …

A Survey Of Graphs Of Minimum Order With Given Automorphism Group, Jessica Alyse Woodruff

Math Theses

We survey vertex minimal graphs with prescribed automorphism group. Whenever possible, we also investigate the construction of such minimal graphs, confirm minimality, and prove a given graph has the correct automorphism group.

Definition Of A Method For The Formulation Of Problems To Be Solved With High Performance Computing, Ramya Peruri

Master of Science in Computer Science Theses

Computational power made available by current technology has been continuously increasing, however today’s problems are larger and more complex and demand even more computational power. Interest in computational problems has also been increasing and is an important research area in computer science. These complex problems are solved with computational models that use an underlying mathematical model and are solved using computer resources, simulation, and are run with High Performance Computing. For such computations, parallel computing has been employed to achieve high performance. This thesis identifies families of problems that can best be solved using modelling and implementation techniques of parallel …

Newsvendor Models With Monte Carlo Sampling, Ijeoma W. Ekwegh

Electronic Theses and Dissertations

Newsvendor Models with Monte Carlo Sampling by Ijeoma Winifred Ekwegh The newsvendor model is used in solving inventory problems in which demand is random. In this thesis, we will focus on a method of using Monte Carlo sampling to estimate the order quantity that will either maximizes revenue or minimizes cost given that demand is uncertain. Given data, the Monte Carlo approach will be used in sampling data over scenarios and also estimating the probability density function. A bootstrapping process yields an empirical distribution for the order quantity that will maximize the expected profit. Finally, this method will be used …

Multilevel Models For Longitudinal Data, Aastha Khatiwada

Electronic Theses and Dissertations

Longitudinal data arise when individuals are measured several times during an ob- servation period and thus the data for each individual are not independent. There are several ways of analyzing longitudinal data when different treatments are com- pared. Multilevel models are used to analyze data that are clustered in some way. In this work, multilevel models are used to analyze longitudinal data from a case study. Results from other more commonly used methods are compared to multilevel models. Also, comparison in output between two software, SAS and R, is done. Finally a method consisting of fitting individual models for each …

Hybrid Chebyshev Polynomial Scheme For The Numerical Solution Of Partial Differential Equations, Balaram Khatri Ghimire

Dissertations

In the numerical solution of partial differential equations (PDEs), it is common to find situations where the best choice is to use more than one method to arrive at an accurate solution. In this dissertation, hybrid Chebyshev polynomial scheme (HCPS) is proposed which is applied in two-step approach and one-step approach. In the two-step approach, first, Chebyshev polynomials are used to approximate a particular solution of a PDE. Chebyshev nodes which are the roots of Chebyshev polynomials are used in the polynomial interpolation due to its spectral convergence. Then, the resulting homogeneous equation is solved by boundary type methods including …

Mathematical Approaches To Sustainability Assessment And Protocol Development For The Bioenergy Sustainability Target Assessment Resource (Bio-Star), Nathan Louis Pollesch

Doctoral Dissertations

Bioenergy is renewable energy made of materials derived from biological, non-fossil sources. In addition to the benefits of utilizing an energy source that is renewable, bioenergy is being researched for its potential positive impact on climate change mitigation, job creation, and regional energy security. It has also been studied to investigate possible challenges related to indirect and direct land-use change and food security. Bioenergy sustainability assessment provides a method to identify, quantify, and interpret indicators, or metrics, of bioenergy sustainability in order to study trade-offs between environmental, social, and economic aspects of bioenergy production and use. Assessment is crucial to …

An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger

Electronic Theses and Dissertations

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R³, but also to the general case of finding minimal functionals on hypersurfaces in Rⁿ associated with an arbitrary metric.

Extension Theorems On Matrix Weighted Sobolev Spaces, Christopher Ryan Loga

Doctoral Dissertations

Let D a subset of Rⁿ [R n] be a domain with Lipschitz boundary and 1 ≤ p < ∞ [1 less than or equal to p less than infinity]. Suppose for each x in Rⁿ that W(x) is an m x m [m by m] positive definite matrix which satisfies the matrix A_p [A p] condition. For k = 0, 1, 2, 3;... define the matrix weighted, vector valued, Sobolev space [L p k of D,W] with

[the weighted L p k norm of vector valued f over D to the p power equals the sum over all alpha with order less than k of the integral over D of the the pth power …

The Kauffman Bracket And Genus Of Alternating Links, Bryan M. Nguyen

Electronic Theses, Projects, and Dissertations

Giving a knot, there are three rules to help us finding the Kauffman bracket polynomial. Choosing knot’s orientation, then applying the Seifert algorithm to find the Euler characteristic and genus of its surface. Finally finding the relationship of the Kauffman bracket polynomial and the genus of the alternating links is the main goal of this paper.

A Dual Fano, And Dual Non-Fano Matroidal Network, Stephen Lee Johnson

Electronic Theses, Projects, and Dissertations

Matroidal networks are useful tools in furthering research in network coding. They have been used to show the limitations of linear coding solutions. In this paper we examine the basic information on network coding and matroid theory. We then go over the method of creating matroidal networks. Finally we construct matroidal networks from the dual of the fano matroid and the dual of the non-fano matroid, and breifly discuss some coding solutions.

The Evolution Of Cryptology, Gwendolyn Rae Souza

Electronic Theses, Projects, and Dissertations

We live in an age when our most private information is becoming exceedingly difficult to keep private. Cryptology allows for the creation of encryptive barriers that protect this information. Though the information is protected, it is not entirely inaccessible. A recipient may be able to access the information by decoding the message. This possible threat has encouraged cryptologists to evolve and complicate their encrypting methods so that future information can remain safe and become more difficult to decode. There are various methods of encryption that demonstrate how cryptology continues to evolve through time. These methods revolve around different areas of …

Realizing Tournaments As Models For K-Majority Voting, Gina Marie Cheney

Electronic Theses, Projects, and Dissertations

A k-majority tournament is a directed graph that models a k-majority voting scenario, which is realized by 2k - 1 rankings, called linear orderings, of the vertices in the tournament. Every k-majority voting scenario can be modeled by a tournament, but not every tournament is a model for a k-majority voting scenario. In this thesis we show that all acyclic tournaments can be realized as 2-majority tournaments. Further, we develop methods to realize certain quadratic residue tournaments as k-majority tournaments. Thus, each tournament within these classes of tournaments is a model for a k …

Population Projection And Habitat Preference Modeling Of The Endangered James Spinymussel (Pleurobema Collina), Marisa Draper

Senior Honors Projects, 2010-2019

The James Spinymussel (Pleurobema collina) is an endangered mussel species at the top of Virginia’s conservation list. The James Spinymussel plays a critical role in the environment by filtering and cleaning stream water while providing shelter and food for macroinvertebrates; however, conservation efforts are complicated by the mussels’ burrowing behavior, camouflage, and complex life cycle. The goals of the research conducted were to estimate detection probabilities that could be used to predict species presence and facilitate field work, and to track individually marked mussels to test for habitat preferences. Using existing literature and mark-recapture field data, these goals were accomplished …

The Root Finite Condition On Groups And Its Application To Group Rings, James Gollin

Theses and Dissertations

A group $G$ is said to satisfy the root-finite condition if for every $g \in G$, there are only finitely many $x \in G$ such that there exists a positive integer $n$ such that $x^n = g$. It is shown that groups satisfy the root-finite condition iff they satisfy three subconditions, which are shown to be independent. Free groups are root-finite. Ordered groups are shown to satisfy one of the subconditions for the root-finite condition. Finitely generated abelian groups satisfy the root-finite condition. If, in a torsion-free abelian group $G$, there exists a positive integer $r$ such that the subgroup …

A Survey On Hadamard Matrices, Adam J. Laclair

Chancellor’s Honors Program Projects

No abstract provided.

Neighborhood-Restricted Achromatic Colorings Of Graphs, James D. Chandler Sr.

Electronic Theses and Dissertations

A (closed) neighborhood-restricted 2-achromatic-coloring of a graph G is an assignment of colors to the vertices of G such that no more than two colors are assigned in any closed neighborhood. In other words, for every vertex v in G, the vertex v and its neighbors are in at most two different color classes. The 2-achromatic number is defined as the maximum number of colors in any 2-achromatic-coloring of G. We study the 2-achromatic number. In particular, we improve a known upper bound and characterize the extremal graphs for some other known bounds.

Drawing Numbers And Listening To Patterns, Loren Zo Haynes

Honors College Theses

The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …

Best Approximations, Lethargy Theorems And Smoothness, Caleb Case

CMC Senior Theses

In this paper we consider sequences of best approximation. We first examine the rho best approximation function and its applications, through an example in approximation theory and two new examples in calculating n-widths. We then further discuss approximation theory by examining a modern proof of Weierstrass's Theorem using Dirac sequences, and providing a new proof of Chebyshev's Equioscillation Theorem, inspired by the de La Vallee Poussin Theorem. Finally, we examine the limits of approximation theorem by looking at Bernstein Lethargy theorem, and a modern generalization to infinite-dimensional subspaces. We all note that smooth functions are bounded by Jackson's Inequalities, but …

The Diameter Of A Rouquier Block, Andrew Mayer

Williams Honors College, Honors Research Projects

For my Honors Research Project, I will be researching special properties of Rouquier blocks that represent the partitions of integers. This problem is motivated by ongoing work in representation theory of the symmetric group. For each integer n and each prime p, there is an object called a Rouquier block; this block can be visualized as a collection of points in a plane, each corresponding to a partition. In this group of points, we say a pair of points is “connected” if certain conditions on the partitions are met. We compare each partition with each other partition, add edges when …

Winning Strategies In The Board Game Nowhere To Go, Najee Kahil Mcfarland-Drye

Senior Projects Spring 2016

Nowhere To Go is a two player board game played on a graph. The players take turns placing blockers on edges, and moving from vertex to vertex using unblocked edges and unoccupied vertices. A player wins by ensuring their opponent is on a vertex with all blocked edges. This project goes over winning strategies for Player 1 for Nowhere To Go on the standard board and other potential boards.

Envy-Free Fair Division With Two Players And Multiple Cakes, Justin J. Shin

Senior Projects Fall 2016

When dividing a valuable resource amongst a group of players, it is desirable to have each player believe that their allocation is at least as valuable as everyone else's allocation. This condition, where nobody is envious of anybody else's share in a division, is called envy-freeness. Fair division problems over continuous pools of resources are affectionately known as cake-cutting problems, as they resemble attempts to slice and distribute cake amongst guests as fairly as possible. Previous work in multi-cake fair division problems have attempted to prove that certain conditions do not allow for guaranteed envy-free divisions. In this paper, we …

Exploring Tournament Graphs And Their Win Sequences, Sadiki O. Lewis

Senior Projects Fall 2016

In this project we will be looking at tournaments on graphs and their win sequences. The main purpose for a tournament is to determine a winner amongst a group of competitors. Usually tournaments are played in an elimination style where the winner of a game advances and the loser is knocked out the tournament. For the purpose of this project I will be focusing on Round Robin Tournaments where all competitors get the opportunity to play against each other once. This style of tournaments gives us a more real life perspective of a fair tournament. We will model these Round …

Monte Carlo Approx. Methods For Stochastic Optimization, John Fowler

Pomona Senior Theses

This thesis provides an overview of stochastic optimization (SP) problems and looks at how the Sample Average Approximation (SAA) method is used to solve them. We review several applications of this problem-solving technique that have been published in papers over the last few years. The number and variety of the examples should give an indication of the usefulness of this technique. The examples also provide opportunities to discuss important aspects of SPs and the SAA method including model assumptions, optimality gaps, the use of deterministic methods for finite sample sizes, and the accelerated Benders decomposition algorithm. We also give a …

Subgroups Of Finite Wreath Product Groups For P=3, Jessica L. Gonda

Williams Honors College, Honors Research Projects

Let M be the additive abelian group of 3-by-3 matrices whose entries are from the ring of integers modulo 9. The problem of determining all the normal subgroups of the regular wreath product group P=Z₉≀(Z₃ × Z₃) that are contained in its base subgroup is equivalent to the problem of determining the subgroups of M that are invariant under two particular endomorphisms of M. In this thesis we give a partial solution to the latter problem by implementing a systematic approach using concepts from group theory and linear algebra.

The Automorphism Group Of The Halved Cube, Benjamin B. Mackinnon

Theses and Dissertations

An n-dimensional halved cube is a graph whose vertices are the binary strings of length n, where two vertices are adjacent if and only if they differ in exactly two positions. It can be regarded as the graph whose vertex set is one partite set of the n-dimensional hypercube, with an edge joining vertices at hamming distance two. In this thesis we compute the automorphism groups of the halved cubes by embedding them in R n and realizing the automorphism group as a subgroup of GLn(R). As an application we show that a halved cube is a circulant graph if …