Mathematics Commons^™

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 …

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, …

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 …

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 …

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 …

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 …

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 …

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 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, …

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 …

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 …

Analyzing Common Algebra-Related Misconceptions And Errors Of Middle School Students., Sarah B. Bush

Electronic Theses and Dissertations

The purpose of this study was to examine common algebra-related misconceptions and errors of middle school students. In recent years, success in Algebra I is often considered the mathematics gateway to graduation from high school and success beyond. Therefore, preparation for algebra in the middle grades is essential to student success in Algebra I and high school. This study examines the following research question: What common algebra-related misconceptions and errors exist among students in grades six and eight as identified on student responses on an annual statewide standardized assessment? In this study, qualitative document analysis of existing data was used …

Omnisculptures., Cihan Eroglu

Electronic Theses and Dissertations

In this thesis we will study conditions for the existence of minimal sized omnipatterns in higher dimensions. We will introduce recent work conducted on one dimensional and two dimensional patterns known as omnisequences and omnimosaics, respectively. These have been studied by Abraham et al [3] and Banks et al [2]. The three dimensional patterns we study are called omnisculptures, and will be the focus of this thesis. A (K,a) omnisequence of length n is a string of letters that contains each of the a^k words of length k over [A]={1,2,...a} as a substring. …

Universal Hypergraphs., Michael Deren

Electronic Theses and Dissertations

In this thesis, we study universal hypergraphs. What are these? Let us start with defining a universal graph as a graph on n vertices that contains each of the many possible graphs of a smaller size k < n as an induced subgraph. A hypergraph is a discrete structure on n vertices in which edges can be of any size, unlike graphs, where the edge size is always two. If all edges are of size three, then the hypergraph is said to be 3-uniform. If a 3-uniform hypergraph can have edges colored one of a colors, then it is called a …

A Predictive Model Which Uses Descriptors Of Rna Secondary Structures Derived From Graph Theory., Alissa Ann Rockney

Electronic Theses and Dissertations

The secondary structures of ribonucleic acid (RNA) have been successfully modeled with graph-theoretic structures. Often, simple graphs are used to represent secondary RNA structures; however, in this research, a multigraph representation of RNA is used, in which vertices represent stems and edges represent the internal motifs. Any type of RNA secondary structure may be represented by a graph in this manner. We define novel graphical invariants to quantify the multigraphs and obtain characteristic descriptors of the secondary structures. These descriptors are used to train an artificial neural network (ANN) to recognize the characteristics of secondary RNA structure. Using the ANN, …

Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster

Electronic Theses and Dissertations

This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …

Approximate Transversals Of Latin Squares, Jon Kyle Pula

Electronic Theses and Dissertations

A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such that each symbol appears precisely once in each row and column. A transversal of a latin square is a subset of cells that meets each row, column, and symbol precisely once.

There are many open and difficult questions about the existence and prevalence of transversals. We undertake a systematic study of collections of cells that exhibit regularity properties similar to those of transversals and prove numerous theorems about their existence and structure. We hope that our results …

Exploring Confidence Intervals In The Case Of Binomial And Hypergeometric Distributions, Irene Mojica

Electronic Theses and Dissertations

The objective of this thesis is to examine one of the most fundamental and yet important methodologies used in statistical practice, interval estimation of the probability of success in a binomial distribution. The textbook confidence interval for this problem is known as the Wald interval as it comes from the Wald large sample test for the binomial case. It is generally acknowledged that the actual coverage probability of the standard interval is poor for values of p near 0 or 1. Moreover, recently it has been documented that the coverage properties of the standard interval can be inconsistent even if …

Convergence Of The Mean Shift Algorithm And Its Generalizations, Ting Hu

Electronic Theses and Dissertations

Mean shift is an effective iterative algorithm widely used in image analysis tasks like tracking, image segmentation, smoothing, filtering, edge detection and etc. It iteratively estimates the modes of the probability function of a set of sample data points based in a region. Mean shift was invented in 1975, but it was not widely used until the work by Cheng in 1995. After that, it becomes popular in computer vision. However the convergence, a key character of any iterative algorithm, has been rigorously proved only very recently, but with strong assumptions. In this thesis, the method of mean shift is …

Bayesian Model Selection For Classification With Possibly Large Number Of Groups, Justin Kyle Davis

Electronic Theses and Dissertations

The purpose of the present dissertation is to study model selection techniques which are specifically designed for classification of high-dimensional data with a large number of classes. To the best of our knowledge, this problem has never been studied in depth previously. We assume that the number of components p is much larger than the number of samples n, and that only few of those p components are useful for subsequent classification. In what follows, we introduce two Bayesian models which use two different approaches to the problem: one which discards components which have “almost constant” values (Model 1) and …

Bipartite Density Of Generalized Petersen Graphs, Lisa Jordan Ewell

Electronic Theses and Dissertations

The bipartite density b(G) of a graph G with m edges is the maximum ratio [special characters omitted] where m0 is the number of edges in a bipartitesubgraph of G. In this study we determine the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, k), where n ≥ 3 and 1 ≤ k < n with n ≠ 2k. The Generalized Petersen Graph P(n, k) has vertices [special characters omitted] and edges [special characters omitted] where subscript addition is modulo n. We define subgraphs P'(n, k) of P( n, k) by deleting the edge vn –1v0 and the edges w iwi+k for n – k ≤ i ≤ n – 1. For P'(n, k) and many classes of P(n, k), we determine the exact number of edges which must be removed from P( n, k) to reduce it to a bipartite subgraph. In many classes of Generalized Petersen Graphs the exact bipartite density is derived. For example: b(P(n, k)) = 1 for n even, k odd; b(P(n, k)) = 1 – [special characters omitted] for n and k odd and n > k²; b(P( n, k)) is asymptotically 1 – [special characters omitted] for n odd, k even.

Independence Polynomials Of Molecular Graphs, Cameron Taylor Byrum

Electronic Theses and Dissertations

In the 1980's, it was noticed by molecular chemists that the stability and boiling point of certain molecules were related to the number of independent vertex sets in the molecular graphs of those chemicals. This led to the definition of the Merrifield-Simmons index of a graph G as the number of independent vertex sets in G. This parameter was extended by graph theorists, who counted independent sets of different sizes and defined the independence polynomial F_G(x) of a graph G to be \sum_k F_k(G)x^k where for each k, F_k(G) is the number of independent sets of k vertices. This thesis …

Analytic & Numerical Study Of A Vortex Motion Equation, Daniel Bueller

Electronic Theses and Dissertations

A nonlinear second order differential equation related to vortex motion is derived. This equation is analyzed using various numerical and analytical techniques including finding approximate solutions using a perturbative approach.

Algebraic Aspects Of (Bio) Nano-Chemical Reaction Networks And Bifurcations In Various Dynamical Systems, Teng Chen

Electronic Theses and Dissertations

The dynamics of (bio) chemical reaction networks have been studied by different methods. Among these methods, the chemical reaction network theory has been proven to successfully predicate important qualitative properties, such as the existence of the steady state and the asymptotic behavior of the steady state. However, a constructive approach to the steady state locus has not been presented. In this thesis, with the help of toric geometry, we propose a generic strategy towards this question. This theory is applied to (bio)nano particle configurations. We also investigate Hopf bifurcation surfaces of various dynamical systems.

Estimation For The Cox Model With Various Types Of Censored Data, Tonya Riddlesworth

Electronic Theses and Dissertations

In survival analysis, the Cox model is one of the most widely used tools. However, up to now there has not been any published work on the Cox model with complicated types of censored data, such as doubly censored data, partly-interval censored data, etc., while these types of censored data have been encountered in important medical studies, such as cancer, heart disease, diabetes, etc. In this dissertation, we first derive the bivariate nonparametric maximum likelihood estimator (BNPMLE) F[subscript n](t,z) for joint distribution function F[sub 0](t,z) of survival time T and covariate Z, where T is subject to right censoring, noting …

Hückel Energy Of A Graph: Its Evolution From Quantum Chemistry To Mathematics, Steven Zimmerman

Electronic Theses and Dissertations

The energy of a graph began with German physicist, Erich H¨uckel’s 1931 paper, Quantenttheoretische Beitr¨age zum Benzolproblem. His work developed a method for computing the binding energy of the π-electrons for a certain class of organic molecules. The vertices of the graph represented the carbon atoms while the single edge between each pair of distinct vertices represented the hydrogen bonds between the carbon atoms. In turn, the chemical graphs were represented by an n × n matrix used in solving Schr¨odinger’s eigenvalue/eigenvector equation. The sum of the absolute values of these graph eigenvalues represented the total π-electron energy. The criteria …

Finding Dud Vertices In Defensive Alliances And Secure Sets Using Computational Tools, George Worley Ii

Electronic Theses and Dissertations

Defensive alliances are a way of using graphs to model the defense of resources (people, buildings, countries, etc.) against attacks where the number of potential attackers against each resource is known. The initial study of defensive alliances focused on questions of minimal defensive alliances in a graph and the minimum possible size of a defensive alliance in a graph, but in order to apply defensive alliances in modeling real-world situations, additional considerations are important. In particular, since each vertex in a defensive alliance represents some real-world object that has a cost associated with remaining in the defensive alliance, it is …

Fractal Spectral Measures In Two Dimensions, Beng Oscar Alrud

Electronic Theses and Dissertations

We study spectral properties for invariant measures associated to affine iterated function systems. We present various conditions under which the existence of a Hadamard pair implies the existence of a spectrum for the fractal measure. This solves a conjecture proposed by Dorin Dutkay and Palle Jorgensen, in several special cases in dimension 2.

Covering Systems Of Polynomial Rings Over Finite Fields, Michael Wayne Azlin

Electronic Theses and Dissertations

In 1950 Paul Erdos observed that every integer belonged to a certain system of congruences with distinct moduli. He called such systems of congruences covering systems. Utilizing his covering system, he disproved a conjecture of de Polignac asking, “for every odd k, is there a prime of the form 2n + k?” Examples of covering systems of the integers are presented along with some brief history and a sketch of the disproof by Erd?s. Open conjectures concerning covering systems and best known results of attempts to prove these conjectures are given. Analogies are drawn between the integers and Fq[x], and …