Physical Sciences and Mathematics Commons^™

Cost Effective Domination In Graphs, Tabitha Lynn Mccoy

Electronic Theses and Dissertations

A set S of vertices in a graph G = (V,E) is a dominating set if every vertex in V \ S is adjacent to at least one vertex in S. A vertex v in a dominating set S is said to be it cost effective if it is adjacent to at least as many vertices in V \ S as it is in S. A dominating set S is cost effective if every vertex in S is cost effective. The minimum cardinality of a cost effective dominating set of G is the cost …

A Non-Parametric Approach To Change-Point Detection In Cross-Asset Correlations, L. Kaili Diamond

Electronic Theses and Dissertations

In this thesis we explore the problem of detecting change-points in cross-asset correlations using a non-parametric approach. We began by comparing and contrasting several common methods for change-point detection as well as methods for measuring correlation. We finally settle on a statistic introduced in early 2012 by Herold Dehling et.al. and test this statistic against real world financial data. We provide the estimated change-point for this data as well as the asymptotic p-value associated with this statistic. Once this process was complete we went on to use simulated data to measure the accuracy, power, and type 1 error associated with …

Integer Solutions To Optimization Problems And Modular Sequences Of Nexus Numbers, Jeremy T. Davis

Electronic Theses and Dissertations

In this thesis, we examine the use of integers through two ideas. As mathematics teachers, we prefer students not use calculators on assessments. In order to require this, students compute the problems by hand. We take a look at the classic Calculus I optimization box problem while restricting values to integers. In addition, sticking with the integer theme, we take a new look at the nexus numbers. Nexus numbers are extensions of the hex and rhombic dodecahedral numbers. We put these numbers into a sequence, and through a few computations of modular arithmetic, we analyze the sequences and their patterns …

Integer Compositions, Gray Code, And The Fibonacci Sequence, Linus Lindroos

Electronic Theses and Dissertations

In this thesis I show the relation of binary and Gray Code to integer compositions and the Fibonacci sequence through the use of analytic combinatorics, Zeckendorf's Theorem, and generating functions.

Compositions, Bijections, And Enumerations, Charles R. Dedrickson Iii

Electronic Theses and Dissertations

In this thesis we give an introduction to colored-compositions of an integer. This is a generalization of traditional integer compositions, and we show a few results for n-color compositions which are analogous to regular compositions with both combinatorial and analytic proofs. We also show several bijections between various types of compositions to certain types of numeric strings, and provide a generalization of a classic bijection between compositions and binary strings.

Nested (2,R)-Regular Graphs And Their Network Properties., Josh Daniel Brooks

Electronic Theses and Dissertations

A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively adjacent to exactly r vertices. If a graph G is (2, r)-regular where p, s, and m are positive integers, and m ≥ 2, then when n is sufficiently large, then G is isomorphic to G = K_s+mK_p, where 2(p-1)+s = r. A nested (2,r)-regular graph is constructed by replacing selected cliques with a (2,r)-regular graph and joining the vertices of the peripheral cliques. For …

Global Domination Stable Graphs, Elizabeth Marie Harris

Electronic Theses and Dissertations

A set of vertices S in a graph G is a global dominating set (GDS) of G if S is a dominating set for both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications on the global domination number. In particular, we explore edge removal, edge addition, and vertex removal.

Liar's Domination In Grid Graphs, Christopher Kent Sterling

Electronic Theses and Dissertations

As introduced by Slater in 2008, liar's domination provides a way of modeling protection devices where one may be faulty. Assume each vertex of a graph G is the possible location for an intruder such as a thief. A protection device at a vertex v is assumed to be able to detect the intruder at any vertex in its closed neighborhood N[v] and identify at which vertex in N[v] the intruder is located. A dominating set is required to identify any intruder's location in the graph G, and if any one device can fail to …

Preferential Arrangement Containment In Strict Superpatterns, Martha Louise Liendo

Electronic Theses and Dissertations

Most results on pattern containment deal more directly with pattern avoidance, or the enumeration and characterization of strings which avoid a given set of patterns. Little research has been conducted regarding the word size required for a word to contain all patterns of a given set of patterns. The set of patterns for which containment is sought in this thesis is the set of preferential arrangements of a given length. The term preferential arrangement denotes strings of characters in which repeated characters are allowed, but not necessary. Cardinalities for sets of all preferential arrangements of given lengths and alphabet sizes …

On The Algebraic Reformulation Of The Partition Function, Emily Igo

Electronic Theses and Dissertations

The partition function has long enchanted the minds of great mathematicians, dating from Euler's attempts at calculating the value of this function in the 1700's, to Hardy and Ramanujan's asymptotic approach in the early twentieth century, through to Rademacher's representation as an explicit infinite series mid-century. This thesis will explore the historical attempts at grasping the behavior of this function, with particular attention paid to Euler's Pentagonal Number Theorem and Rademacher's Infinite Sum. We will then explore two reformulations due to Ono et al., with sample calculations from the recent algebraic reformulation, announced January, 2011.

On Hall Magnetohydrodynamics: X-Type Neutral Point And Parker Problem, Kyle Reger

Electronic Theses and Dissertations

The framework for the Hall magnetohydrodynamic (MHD) model for plasma physics is built up from kinetic theory and used to analytically solve problems of interest in the field. The Hall MHD model describes fast magnetic reconnection processes in space and laboratory plasmas. Specifically, the magnetic reconnection process at an X-type neutral point, where current sheets form and store enormous amounts of magnetic energy which is later released as magnetic storms when the sheets break up, is investigated. The phenomena of magnetic flux pile-up driving the merging of antiparallel magnetic fields at an ion stagnation-point flow in a thin current sheet, …

Autoregressive Models, Kelly Wade

Electronic Theses and Dissertations

Consider a sequence of random variables which obeys a first order autoregressive model with unknown parameter alpha. Under suitable assumptions on the error structure of the model, the limiting distribution of the normalized least squares estimator of alpha is discussed. The choice of the normalizing constant depends on whether alpha is less than one, equals one, or is greater than one in absolute value. In particular, the limiting distribution is normal provided that the absolute value of alpha is less than one, but is a function of Brownian motion whenever the absolute value of alpha equals one. Some general remarks …

Convective Heat Transfer In Nanofluids, Steven Schraudner

Electronic Theses and Dissertations

In recent years, the study of fluid flow with nanoparticles in base fluids has attracted the attention of several researchers due to its various applications to science and engineering problems. Recent investigations on convective heat transfer in nanofluids indicate that the suspended nanoparticles markedly change the transport properties and thereby the heat transfer characteristics. Convection in saturated porous media with nanofluids is also an area of growing interest. In this thesis, we study the effects of radiation on the heat and mass transfer characteristics of nanofluid flows over solid surfaces. In Chapter 2, an investigation is made into the effects …

Improving Student Learning In Undergraduate Mathematics, Gabrielle Rejniak

Electronic Theses and Dissertations

The goal of this study was to investigate ways of improving student learning, par- ticularly conceptual understanding, in undergraduate mathematics courses. This study focused on two areas: course design and animation. The methods of study were the following: Assessing the improvement of student conceptual understanding as a result of team project-based learning, individual inquiry-based learning and the modi ed empo- rium model; and Assessing the impact of animated videos on student learning with the emphasis on concepts. For the first part of our study (impact of course design on student conceptual understanding) we began by comparing the following three groups …

Cayley-Dickson Loops, Jenya Kirshtein

Electronic Theses and Dissertations

In this dissertation we study the Cayley-Dickson loops, multiplicative structures arising from the standard Cayley-Dickson doubling process. More precisely, the Cayley-Dickson loop Q_n is the multiplicative closure of basic elements of the algebra constructed by n applications of the doubling process (the first few examples of such algebras are real numbers, complex numbers, quaternions, octonions, sedenions). Starting at the octonions, Cayley-Dickson algebras and loops become nonassociative, which presents a significant challenge in their study.

We begin by describing basic properties of the Cayley–Dickson loops Q_n. We establish or recall elementary facts about Q_n, e.g., inverses, …

Characterizations Of Zero Divisor Graphs Determined By Equivalence Classes Of Zero Divisors, Amanda Catherine Acosta

Electronic Theses and Dissertations

We study zero divisor graphs of commutative rings determined by equivalence classes of zero divisors, specifically for a Noetherian ring R. We study the classification of these graphs. Specifically, we add more criteria to the list of characterizations that disqualify a graph as the zero divisor graph of a ring. We also briefly discuss Sage, a mathematical software, which was an aid in providing visual pictures for the graphs under study.

Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-Box Structures, Hamad Ahmadi

Electronic Theses and Dissertations

In this dissertation, we investigate three different problems in the field of Quantum computation. First, we discuss the quantum complexity of evaluating the Tutte polynomial of a planar graph. Furthermore, we devise a new quantum algorithm for approximating the phase of a unitary matrix. Finally, we provide quantum tools that can be utilized to extract the structure of black-box modules and algebras. While quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT) ) is highly constrained by the requirement of high-precision controlled phase shift …

On K-Trees And Special Classes Of K-Trees, John Wheless Estes

Electronic Theses and Dissertations

The class of k-trees is defined recursively as follows: the smallest k-tree is the k-clique. If G is a graph obtained by attaching a vertex v to a k-clique in a k-tree, then G is also a k-tree. Trees, connected acyclic graphs, are k-trees for k = 1. We introduce a new parameter known as the shell of a k-tree, and from the shell special subclasses of k-trees, tree-like k-trees, are classified. Tree-like k-trees are generalizations of paths, maximal outerplanar graphs, and chordal planar graphs with toughness exceeding one. Let fs = fs( G) be the number of independent sets …

Applications Of Compressive Sensing To Surveillance Problems, Christopher Huff

Electronic Theses and Dissertations

In many surveillance scenarios, one concern that arises is how to construct an imager that is capable of capturing the scene with high fidelity. This could be problematic for two reasons: first, the optics and electronics in the camera may have difficulty in dealing with so much information; secondly, bandwidth constraints, may pose difficulty in transmitting information from the imager to the user efficiently for reconstruction or realization. In this thesis, we will discuss a mathematical framework that is capable of skirting the two aforementioned issues. This framework is rooted in a technique commonly referred to as compressive sensing. We …

Tensor Products Of Vector Seminormed Spaces, John William Dever

Electronic Theses and Dissertations

A vector seminormed space is a triple consisting of a vector space, a Dedekind complete Riesz space, and a vector valued seminorm, called a vector seminorm, defined on the vector space and taking values in the Riesz space. The collection of vector seminormed spaces with suitably defined morphisms is shown to be a category containing finite products. A theory of vector seminorms on the tensor products of vector seminormed spaces is developed in analogy with the theory of tensor products of Banach spaces. Accordingly, a reasonable cross vector seminorm, or simply tensor seminorm, is defined such that a vector seminorm …

Contributions To Robust Methods: Modified Rank Covariance Matrix And Spatial-Em Algorithm, Kai Yu

Electronic Theses and Dissertations

Classical multivariate statistical inference methods including multivariate analysis of variance, principal component analysis, factor analysis, canonical correlation analysis are based on sample covariance matrix. Those moment-based techniques are optimal (most efficient) under the normality distributional assumption. They are, however, extremely sensitive to outlying observations, susceptible to small perturbation in data and poor in the efficiency for heavy-tailed distributions. A straightforward treatment is to replace the sample covariance matrix with a robust one. Visuri et al. (2000) proposed a technique for robust covariance matrix estimation based on different notions of multivariate sign and rank. Among them, the spatial rank based covariance …

The Distribution Of Individual Stock Returns In A Modified Black-Scholes Option Pricing Model, Daniel Lee Richey

Electronic Theses and Dissertations

Author's abstract: There have been many attempts to find a model that can accurately price options. These models are built on many assumptions, including which probability distribution stock returns follow. In this paper, we test several distributions to see which best fit the log returns of 20 different companies over a period between November 1, 2006 to October 31, 2011. If a "best" distribution is found, a modified Black-Scholes model will be defined by modifying the Weiner process. We use Monte Carlo simulations to generate estimated prices under specified parameters, and compare these prices to those simulated by the model …

Homogeneous Symplectic Manifolds Of The Galilei Group, Michael S. Davis

Electronic Theses and Dissertations

In this thesis we classify all symplectic manifolds admitting a transitive, 2-form preserving action of the Galilei group G. Using the moment map and a theorem of Kirillov-Kostant-Souriau, we reduce the problem to that of classifying the coadjoint orbits of a central extension of G discovered by Bargmann. We then develop a systematic inductive technique to construct a cross section of the coadjoint action. The resulting symplectic orbits are interpreted as the manifolds of classical motions of elementary particles with or without spin, mass, and color.

Infeasible Full-Newton-Step Interior-Point Method For The Linear Complementarity Problems, Antré Marquel Drummer

Electronic Theses and Dissertations

In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method …

Properties Of Weighted Generalized Beta Distribution Of The Second Kind, Yuan Ye

Electronic Theses and Dissertations

Author's abstract: In this thesis, a new class of weighted generalized beta distribution of the second kind (WGB2) is presented. The construction makes use of the conservability approach' which includes the size or length-biased distribution as a special case. The class of WGB2 is used as descriptive models for the distribution of income. The results that are presented generalize the generalized beta distribution of second kind (GB2). The properties of these distributions including behavior of pdf, cdf, hazard functions, moments, mean, variance, coefficient of variation (CV), coefficient of skewness (CS), coefficient of kurtosis (CK) are obtained. The moments of other …