Digital Commons Network^™

Topics On Applications Of Optimization Theories On Statistical Methodologies, Duc Anh Anh Doan

Electronic Theses and Dissertations

In this dissertation, We show the results of our researches in statistical sampling, functional optimization, and methodology for partially observed Markov process (POMP) models. In statistical sampling, we introduce a p-generalized smoothing method that enables the Langevin-Monte Carlo method to generate a sample from a log concave distribution weakly smoothing potential function. For our optimization research, we introduce an accelerated inexact gradient (AIG) method. Combining the strengths while mitigating the weakness of its parent methods: gradient descent and Nesterov's accelerated gradient, AIG converges with excellent rates for both convex and non-convex optimization problems for smooth objective functions. Furthermore, we also …

On Domination And Bondage Numbers Of Some Classes Of Graphs, Andrew Pham

Electronic Theses and Dissertations

Given a simple finite graph G=(V,E), a vertex subset D ? V(G) is said to be a dominating set of G if every vertex v ? V(G)-D is adjacent to a vertex in D. The domination number of G, denoted ?(G), is the minimum cardinality among all dominating sets of G. In a network, the domination number determines the minimum number of sites required to dominate the entire network at a minimum cost. The bondage number of a graph G is the minimum cardinality among all edge sets B such that ?(G-B) > ?(G). The bondage number may serve as a …

Zeros Of The Dedekind Zeta-Function, Mashael Alsharif

Electronic Theses and Dissertations

H. L. Montgomery proved a formula for sums over two sets of nontrivial zeros of the Riemann zeta-function. Assuming the Riemann Hypothesis, he used this formula and Fourier analysis to prove an estimate for the proportion of simple zeros of the Riemann zeta-function. We prove a generalization of his formula for the nontrivial zeros of the Dedekind zeta-function of a Galois number field, and use this formula and Fourier analysis to prove an estimate for the proportion of distinct zeros, assuming the Generalized Riemann Hypothesis.

Quadratic Reciprocity: Proofs And Applications, Awatef Noweafa Almuteri

Electronic Theses and Dissertations

The law of quadratic reciprocity is an important result in number theory. The purpose of this thesis is to present several proofs as well as applications of the law of quadratic reciprocity. I will present three proofs of the quadratic reciprocity. We begin with a proof that depends on Gauss's lemma and Eisenstein's lemma. We then describe another proof due to Eisentein using the $n$th roots of unity. Then we provide a modern proof published in 1991 by Rousseau. In the second part of the thesis, we present two applications of quadratic reciprocity. These include special cases of Dirichlet's theorem …

A First-Year Teacher’S Implementation Of Short-Cycle Formative Assessment Through The Use Of A Classroom Response System And Flexible Grouping, Adrienne Irving Dumas

Electronic Theses and Dissertations

As teachers we are tasked with ensuring that our students are equipped with the skills necessary to not only perform with proficiency on local state and national assessments but also to provide our students with opportunities to develop confidence and competence as learners of mathematics through meaningful challenging and worthwhile activities. As such many teachers have turned to technology and cooperative groups as staples in the classroom. The purpose of this study was to understand how one first-year teacher implemented what she was taught in her undergraduate coursework in teaching two specific units of instruction in two sections of high …

Cramer Type Moderate Deviations For Random Fields And Mutual Information Estimation For Mixed-Pair Random Variables, Aleksandr Beknazaryan

Electronic Theses and Dissertations

In this dissertation we first study Cramer type moderate deviation for partial sums of random fields by applying the conjugate method. In 1938 Cramer published his results on large deviations of sums of i.i.d. random variables after which a lot of research has been done on establishing Cramer type moderate and large deviation theorems for different types of random variables and for various statistics. In particular results have been obtained for independent non-identically distributed random variables for the sum of independent random to estimate the mutual information between two random variables. The estimates enjoy a central limit theorem under some …

Beta Invariant And Variations Of Chain Theorems For Matroids, Sooyeon Lee

Electronic Theses and Dissertations

The beta invariant of a matroid was introduced by Crapo in 1967. We first find the lower bound of the beta invariant of 3-connected matroids with rank r and the matroids which attain the lower bound. Second we characterize the matroids with beta invariant 5 and 6. For binary matroids we characterize matroids with beta invariant 7. These results extend earlier work of Oxley. Lastly we partially answer an open question of chromatic uniqueness of wheels and prove a splitting formula for the beta invariant of generalized parallel connection of two matroids. Tutte's Wheel-and-Whirl theorem and Seymour's Splitter theorem give …

Generalized Characteristics Of A Generic Polytope, Tommy Naugle

Electronic Theses and Dissertations

For a smooth hypersurface S ⊂ R 2n given by the level set of a Hamiltonian function H, a symplectic form ω on R2n induces a vector field XH which flows tangent to S. By the nondegeneracy of ω, there exists a distinguished line bundle LS whose characteristics are the integral curves of XH. When S is the boundary of a smooth convex domain K˜ ⊂ R 2n, then the least action among closed characteristics of LS is equal to the Ekeland-Hofer-Zehnder capacity, a symplectic invariant. From a result due to Artstein-Avidan and Ostrover, there exists a continuous extension of …

Bases In Spaces Of Regular Multilinear Operators And Homogeneous Polynomials On Banach Lattices, Khazhak Varazdat Navoyan

Electronic Theses and Dissertations

For Banach lattices E1,…, Em and F with 1-unconditional bases, we show that the monomial sequence forms a 1-unconditional basis of Lr(E1,…, Em;F), the Banach lattice of all regular m-linear operators from E1×···× Em to F, if and only if each basis of E1,…,Em is shrinking and every positive m-linear operator from E 1×···×Em to F is weakly sequentially continuous. As a consequence, we obtain necessary and sufficient conditions for which the m-fold Fremlin projective tensor product E1⊗ |π|··· ⊗|π|E m (resp. the m-fold positive injective tensor product E1⊗|ϵ|··· ⊗ |ϵ|Em) has a shrinking basis or a boundedly complete basis. …

The Element Spectrum Of A Graph, Milisha Hart-Simmons

Electronic Theses and Dissertations

Characterizations of graphs and matroids that have cycles or circuits of specified cardinality have been given by authors including Edmonds, Junior, Lemos, Murty, Reid, Young, and Wu. In particular, a matroid with circuits of a single cardinality is called a Matroid Design. We consider a generalization of this problem by assigning a weight function to the edges of a graph. We characterize when it is possible to assign a positive integer value weight function to a simple 3-connected graph G such that the graph G contains an edge that is only in cycles of two different weights. For example, as …

Orthogonal Polynomials On An Arc Of The Unit Circle With Respect To A Generalized Jacobi Weight: A Riemann-Hilbert Method Approach, Lynsey Cargile Naugle

Electronic Theses and Dissertations

We investigate the asymptotic behavior of polynomials orthogonal over a symmetric arc of the unit circle with respect to a generalized Jacobi-type weight. Full asymptotic expansions for the orthogonal polynomials are obtained at every point of the complex plane. Our method of proof is based on a characterization of the orthogonal polynomials as solutions of a 2X2 matrix Riemann-Hilbert problem, which extends to the unit circle the original Riemann-Hilbert characterization for orthogonal polynomials on the real line, first discovered by Fokas, Its, and Kitaev. In order to extricate the behavior of the polynomials from its Riemann-Hilbert matrix representation, we follow …

Orthosymmetric Maps And Polynomial Valuations, Stephan Christopher Roberts

Electronic Theses and Dissertations

We present a characterization of orthogonally additive polynomials on vector lattices as orthosymmetric multilinear maps. Our proof avoids partitionaly orthosymmetric maps and results that represent orthogonally additive polynomials as linear maps on a power. We also prove band characterizations for order bounded polynomial valuations and for order continuous polynomials of order bounded variation. Finally, we use polynomial valuations to prove that a certain restriction of the Arens extension of a bounded orthosymmetric multilinear map is orthosymmetric.

Asymptotic Properties Of Polynomials Orthogonal Over Multiply Connected Domains, James A. Henegan

Electronic Theses and Dissertations

We investigate the asymptotic behavior of polynomials orthogonal over certain multiply connected domains. Each domain that we consider has an analytic boundary and is, in a strong sense, conformally equivalent to a canonical type of multiply connected domain called a circular domain. The two most general results involve the construction of a series expansion and an integral representation for these polynomials. We show that the integral representation can be utilized to derive more specific results when the domain of orthogonality is circular. In this case, we shed light on the manner in which the holes in the domain of orthogonality …

Independent Domination Of Subcubic Graphs, Bruce Allan Priddy

Electronic Theses and Dissertations

Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of order n having minimum degree at least two is at most 3(n+1)/7, providing a sharp upper bound for subcubic connected graphs with minimum degree at least two.

On Topological Indices And Domination Numbers Of Graphs, Shaohui Wang

Electronic Theses and Dissertations

Topological indices and dominating problems are popular topics in Graph Theory. There are various topological indices such as degree-based topological indices, distance-based topological indices and counting related topological indices et al. These topological indices correlate certain physicochemical properties such as boiling point, stability of chemical compounds. The concepts of domination number and independent domination number, introduced from the mid-1860s, are very fundamental in Graph Theory. In this dissertation, we provide new theoretical results on these two topics. We study k-trees and cactus graphs with the sharp upper and lower bounds of the degree-based topological indices(Multiplicative Zagreb indices). The extremal cacti …

The Least Prime Number That Splits Completely In S3-Sextic Number Fields, Zhenchao Ge

Electronic Theses and Dissertations

In number theory, an integer n is quadratic residue modulo an odd prime p if n is congruent to a perfect square modulo p. Otherwise, n is is called a quadratic nonresidue. Bounding the least prime quadratic residue and the least quadratic nonresidue are two very classical problems in number theory. These classical problems can be generalized to any number field K by asking for bounds the least for prime that splits completely or does not split completely, respectively, in the ring of integers of K. The goal of this thesis is to bound the least prime that splits completely …

Complex Vector Lattices: Tensor Products And Multilinear Maps, Christopher Michael Schwanke

Electronic Theses and Dissertations

In this thesis, we study completions of Archimedean real vector lattices relative to any nonempty set of continuous positively homogeneous functions defined on Rn. Examples of such completions include square mean closed vector lattices and geometric mean closed vector lattices. These functional completions lead to a vector lattice complexification of any Archimedean real vector lattice. Unlike the vector space complexification of an Archimedean real vector lattice, the vector lattice complexification always results in an Archimedean complex vector lattice. For example, we prove that the vector space complexification of the Fremlin tensor product C(X)⊗C(Y) is not a complex vector lattice when …

Gini Covariance Matrix And Its Affine Equivariant Version, Lauren Anne Weatherall

Electronic Theses and Dissertations

Gini's mean difference (GMD) and its derivatives such as Gini index have been widely used as alternative measures of variability over one century in many research fields especially in finance, economics and social welfare. In this dissertation, we generalize the univariate GMD to the multivariate case and propose a new covariance matrix so called the Gini covariance matrix (GCM). The extension is natural, which is based on the covariance representation of GMD with the notion of multivariate spatial rank function. In order to gain the affine equivariance property for GCM, we utilize the transformation-retransformation (TR) technique and obtain TR version …

Diagonals Of Tensor Products Of Banach Lattices With Bases., Byunghoon Lee

Electronic Theses and Dissertations

In this dissertation, we investigate diagonals of tensor products of Banach lattices with bases. We first consider questions on the positive tensor products of l_p spaces. We characterize the main diagonals of the positive projective tensor product and the positive injective tensor product of l_p space. Then by using these two main diagonals, we characterize the reflexivity, the property of being Kantorovich - Banach spaces, and the property of being order continuous of n-fold positive projective and positive injective tensor products of l_p spaces. Next, we consider the diagonals of injective tensor product of Banach lattices with bases. Let E …

The Characterization Of Graphs With Small Bicycle Spectrum, Bette Catherine Putnam

Electronic Theses and Dissertations

Matroids designs are defined to be matroids in which the hyperplanes all have the same size. The dual of a matroid design is a matroid with all circuits of the same size, called a dual matroid design. The connected bicircular dual matroid designs have been characterized previously. In addition, these results have been extended to connected bicircular matroids with circuits of two sizes in the case that the associated graph is a subdivision of a 3-connected graph. In this dissertation, we will use a graph theoretic approach to discuss the characterizations of bicircular matroids with circuits of two and three …

Rank-Based Two Sample Tests Under A General Alternative, Jamye Curry

Electronic Theses and Dissertations

The problem of testing whether two samples come from the same or different population is a classical one in statistics. In this dissertation, I first study rank based formulation of univariate two-sample distribution-free tests. One form of the test statistic is the average of between-group distances of ranks. The other form of the test statistic is the difference between the average of between-group distances of ranks and the average of within-group distances of ranks. Although they are different in formulation, they are closely related to the two-sample Cramer-von Mises criterion. The first one is a linear transformation of Cramer-von Mises …

(Visible) Tilings Of Squares And Hypercubes, John Randall Burt

Electronic Theses and Dissertations

More than eighty years ago, Erdos considered sums of the side lengths of squares packed into a unit square.Here we consider various classes of tilings , this is, packings where there is no empty space inside the unit square. Several types of questions will be explored here. Various construction techniques are introduced, especially methods of generating tilings from tilings with fewer tiles. For some small values of n, I determine all tilings of the unit square with n tiles. I have found a best possible upper bound for a visible tiling, that is a tiling which every tile shares a …

Moments Of Products Of L-Functions, Caroline Laroche Turnage-Butterbaugh

Electronic Theses and Dissertations

We first consider questions on the distribution of the primes. Using the recent advancement towards the Prime k-tuple Conjecture by Maynard and Tao, we show how to produce infinitely many strings of consecutive primes satisfying specified congruence conditions. We answer an old question of Erdös and Turán by producing strings of consecutive primes whose successive gaps form an increasing (respectively decreasing) sequence. We also show that such strings exist whose successive gaps follow a certain divisibility pattern. Finally, for any coprime integers a and D ≥ 1, we refine a theorem of D. Shiu and find strings of consecutive primes …

Ramsey Theory Using Matroid Minors, Dixie Smith Horne

Electronic Theses and Dissertations

This thesis considers a Ramsey Theory question for graphs and regular matroids. Specifically, how many elements N are required in a 3-connected graphic or regular matroid to force the existence of certain specified minors in that matroid? This question cannot be answered for an arbitrary collection of specified minors. However, there are results from the literature for which the number N exists for certain collections of minors. We first encode totally unimodular matrix representations of certain matroids. We use the computer program MACEK to investigate this question for certain classes of specified minors.

Well-Covered Graphs, Unique Colorability, And Covering Range, Wanda Renea Payne

Electronic Theses and Dissertations

A graph is called well-covered if all of its maximal independent sets have the same cardinality. We give a characterization of well-covered k-trees. A graph is said to be uniquely χ-colorable if, modulo permutations of colors, it has exactly one proper χ-coloring. The k-trees with at least k+1 vertices are minimal uniquely (k +1)-colorable, i.e., they have the minimal number of edges necessary for uniquely (k+1)-colorable graphs. We introduce the k-frames, a new class of minimal uniquely (k+1)-colorable graphs that generalizes the k-trees.

The covering range of a graph is the difference between the cardinality of a largest maximal independent …

On Binary And Regular Matroids Without Small Minors, Kayla Davis Harville

Electronic Theses and Dissertations

The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-minor results for Regular Matroids. Structural theorems on the relationship between minors and k-sums of matroids are developed here in order to provide some of these characterizations. Chapter 2 of the dissertation contains excluded-minor results for Binary Matroids. The first main result of this dissertation is a characterization of the internally 4-connected binary matroids with no minor that is isomorphic to the cycle matroid of the prism+e graph. This characterization generalizes results of Mayhew and Royle [18] for binary matroids and results of Dirac [8] and Lovász …

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 …

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.

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 …

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 …