Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- ETD (26)
- Chemical Graph Theory (3)
- Coadjoint orbit (3)
- Algebraic Geometry (2)
- Degree sequence (2)
-
- Full Newton-step (2)
- Homological algebra (2)
- Interior-point method (2)
- Linear complementarity problem (2)
- Machine Learning (2)
- Molecular Graphs (2)
- N-colored (2)
- Optimization (2)
- Regularity (2)
- Trees (2)
- Weighted distribution (2)
- A MLE (1)
- Adic space (1)
- Adjunction (1)
- Akaike information criterion (1)
- Algebraic geometry (1)
- Applied Mathematics (1)
- Artificial Intelligence (1)
- Artificial Neural Networks (1)
- Astrochemistry (1)
- Atlanta BeltLine (1)
- Auslander-Reiten conjecture (1)
- Bass-Gura (1)
- Beta entropy (1)
- Beta-Dagum distribution (1)
Articles 31 - 60 of 62
Full-Text Articles in Physical Sciences and Mathematics
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
Electronic Theses and Dissertations
Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Electronic Theses and Dissertations
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Electronic Theses and Dissertations
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently, the packing density for all but two (up to equivalence) permutation patterns up to length 4 can be obtained. In this thesis we consider the analogous question for colored patterns and permutations. By introducing the concept of colored blocks …
Gorenstein Projective (Pre)Covers, Michael J. Fox
Gorenstein Projective (Pre)Covers, Michael J. Fox
Electronic Theses and Dissertations
The existence of the Gorenstein projective precovers is one of the main open problems in Gorenstein Homological algebra. We give sufficient conditions in order for the class of Gorenstein projective complexes to be special precovering in the category of complexes of R-modules Ch(R). More precisely, we prove that if every complex in Ch(R) has a special Gorenstein flat cover, every Gorenstein projective complex is Gorenstein flat, and every Gorenstein flat complex has finite Goenstein projective dimension, then the class of Gorenstein projective complexes, GP(C), is special precovering in Ch(R).
Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins
Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins
Electronic Theses and Dissertations
It was recently proved that if R is a coherent ring such that R is also left n-perfect, then the class of Gorenstein projective modules, GP, is precovering. We will prove that the class of Gorenstein projective modules is special precovering over any left GF-closed ring R such that every Gorenstein projective module is Gorenstein flat and every Gorenstein flat module has finite Gorenstein projective dimension. This class of rings includes that of right coherent and left n-perfect rings.
Automorphisms Of Graph Curves On K3 Surfaces, Joshua C. Ferrerra
Automorphisms Of Graph Curves On K3 Surfaces, Joshua C. Ferrerra
Electronic Theses and Dissertations
We examine the automorphism group of configurations of rational curves on $K3$ surfaces. We use the properties of finite automorphisms of $\PP^1$ to examine what restrictions a given elliptic fibration imposes on the possible finite order non-symplectic automorphisms of the $K3$ surface. We also examine the fixed loci of these automorphisms, and construct an explicit fibration to demonstrate the process.
Graphs Of Classroom Networks, Rebecca Holliday
Graphs Of Classroom Networks, Rebecca Holliday
Electronic Theses and Dissertations
In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.
Electronic Theses and Dissertations
The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Electronic Theses and Dissertations
In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close enough to central path. Thus, the centering steps are eliminated. This improvement is based on the Lemma(Roos, 2015). Thanks to this lemma, proximity …
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman
Electronic Theses and Dissertations
In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type questions on distances between leaves are studied as well as some other labeling questions …
Elements Of Convergence Approach Theory, William D. Trott
Elements Of Convergence Approach Theory, William D. Trott
Electronic Theses and Dissertations
We introduce two generalizations to convergence approach spaces of classical results characterizing regularity of a convergence space in terms of continuous extensions of maps on one hand, and in terms of continuity of limits for the continuous convergence on the other. Characterizations are obtained for two alternative extensions of reg- ularity to convergence-approach spaces: regularity and strong regularity. Along the way, we give a brief overview of the theory of convergence spaces and of convergence approach spaces.
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Electronic Theses and Dissertations
Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.
Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford
Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford
Electronic Theses and Dissertations
Chemical graph theory began as a way for mathematicians to bring together the areas of the Physical Sciences and Mathematics. Through its use, mathematicians are able to model chemical systems, predict their properties as well as structure-property relationships. In this dissertation, we consider two questions involving chemical graph theory and its applications. We first look at tree-like polyphenyl systems, which form an important family of compounds in Chemistry, particularly in Material Science. The importance can be seen in LEDs, transmitters, and electronics. In recent years, many extremal results regarding such systems under specific constraints have been reported. More specifically are …
Precise Partitions Of Large Graphs, Pouria Salehi Nowbandegani
Precise Partitions Of Large Graphs, Pouria Salehi Nowbandegani
Electronic Theses and Dissertations
First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path decomposition of graphs with fixed start vertices and fixed lengths. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices. Furthermore, sharp minimum degree and degree sum conditions …
A Constructive Proof Of The Borel-Weil Theorem For Classical Groups, Kostiantyn Timchenko
A Constructive Proof Of The Borel-Weil Theorem For Classical Groups, Kostiantyn Timchenko
Electronic Theses and Dissertations
The Borel-Weil theorem is usually understood as a realization theorem for representations that have already been shown to exist by other means (``Theorem of the Highest Weight''). In this thesis we turn the tables and show that, at least in the case of the classical groups $G = U(n)$, $SO(n)$ and $Sp(2n)$, the Borel-Weil construction can be used to quite explicitly prove existence of an irreducible representation having highest weight $\lambda$, for each dominant integral form $\lambda$ on the Lie algebra of a maximal torus of $G$.
Statistical Properties Of The Mc-Dagum And Related Distributions, Sasith Rajasooriya
Statistical Properties Of The Mc-Dagum And Related Distributions, Sasith Rajasooriya
Electronic Theses and Dissertations
In this thesis, we present a new class of distributions called Mc-Dagum distribution. This class of distributions contains several distributions such as beta-Dagum, beta-Burr III, beta-Fisk and Dagum distributions as special cases. The hazard function, reverse hazard function, moments and mean residual life function are obtained. Inequality measures, entropy and Fisher information are presented. Maximum likelihood estimates of the model parameters are given.
Variational Methods On Elastic Curves, Daniel D. Rocker
Variational Methods On Elastic Curves, Daniel D. Rocker
Electronic Theses and Dissertations
In this thesis we investigate elastic curves. These are curves with minimal bending energy as measured by the total squared curvature functional. We show that these can be computed by evolving curves in the direction of the negative gradient in certain Hilbert space settings. By discretizing the curves and using numerical integration, we compute approximate minimizers and display using computer graphics. We propose a conjecture based on the rotation number of a curve that predicts the critical point curves that minimize bending energy.
Approximate Similarity Reduction, Rui Zhang
Approximate Similarity Reduction, Rui Zhang
Electronic Theses and Dissertations
The nonlinear K (n;1) equation with damping is investigated via the approximate homotopy symmetry method and approximate homotopy direct method. The approximate homotopy symmetry and homotopy similarity reduction equations of different orders are derived and the corresponding homotopy series reduction solutionsare obtained. As a result, the formal coincidence for both methods is displayed.
Pressure Poisson Method For The Incompressible Navier-Stokes Equations Using Galerkin Finite Elements, John Cornthwaite
Pressure Poisson Method For The Incompressible Navier-Stokes Equations Using Galerkin Finite Elements, John Cornthwaite
Electronic Theses and Dissertations
In this thesis we examine the Navier-Stokes equations (NSE) with the continuity equation replaced by a pressure Poisson equation (PPE). Appropriate boundary conditions are developed for the PPE, which allow for a fully decoupled numerical scheme to recover the pressure. The variational form of the NSE with PPE is derived and used in the Galerkin Finite Element discretization. The Galerkin finite element method is then used to solve the NSE with PPE. Moderate accuracy is shown.
Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov
Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov
Electronic Theses and Dissertations
In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.
A Non-Parametric Approach To Change-Point Detection In Cross-Asset Correlations, L. Kaili Diamond
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 …
Compositions, Bijections, And Enumerations, Charles R. Dedrickson Iii
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.
Integer Solutions To Optimization Problems And Modular Sequences Of Nexus Numbers, Jeremy T. Davis
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
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.
The Distribution Of Individual Stock Returns In A Modified Black-Scholes Option Pricing Model, Daniel Lee Richey
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
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.
Properties Of Weighted Generalized Beta Distribution Of The Second Kind, Yuan Ye
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 …
Infeasible Full-Newton-Step Interior-Point Method For The Linear Complementarity Problems, Antré Marquel Drummer
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 …
On Diamond-Alpha Dynamic Equations And Inequalities, Nuriye Atasever
On Diamond-Alpha Dynamic Equations And Inequalities, Nuriye Atasever
Electronic Theses and Dissertations
In view of the recently developed theory of calculus for dynamic equations on time scales (which unifies discrete and continuous systems), in this project we give some of the basics of the extension of the theory to the combined delta (forward) and nabla (backward) derivatives. In this set up the newly developed theory of diamond-alpha derivatives are analyzed through some equation and inequality properties. In particular Opial type Diamond-alpha dynamic Inequalities are discussed in this context and recently developed results and their improved versions are given in this work.
Theoretical Properties And Estimation In Weighted Weibull And Related Distributions, Ryan Roman
Theoretical Properties And Estimation In Weighted Weibull And Related Distributions, Ryan Roman
Electronic Theses and Dissertations
The Weibull distribution is a well known and common distribution. In this thesis, theoretical properties of weighted Weibull distributions are presented. Properties of the non-weighted Weibull distribution are also reiterated for comparison. The probability density functions, cumulative distribution functions, survival functions, hazard functions and reverse hazard functions are given for each distribution. In addition, Glaser's Lemma is applied to determine the behavior of the hazard functions. The standardized moments, differential entropy, Fisher information and results based on the likelihood function are given for each distribution as well. These results are also shown for the Rayleigh distribution, a special case of …