This Is AuburnElectronic Theses and Dissertations

Browsing by Department "Mathematics and Statistics"

Now showing items 141-160 of 283

K4-e Designs with a Hole 

Back, Roxanne (2010-07-27)
In this paper we look at K4 − e designs on Kw−v + v. We settle the case when w and v are of the same parity.

The Lattice Gas Model and Lattice Boltzmann Model on Hexagonal Grids 

Jin, Kang (2005-08-15)
We present an overview of the FHP model and the Lattice BGK model. Details regarding boundary conditions and initial conditions are discussed throught implementations on driven cavity flow, Poiseuille flow, and flow past ...

Lebesgue Approximation of Superprocesses 

He, Xin (2013-07-19)
Superprocesses are certain measure-valued Markov processes, whose distributions can be characterized by two components: the branching mechanism and the spatial motion. It is well known that some basic superprocesses are ...

Leverage Sampling for Single-Index Models 

Almutairi, Basmah (2021-01-04)  ETD File Embargoed
In this thesis, a generalized leverage-based sub-sampling method for single-index models is proposed. The approach gives more efficient estimators than random sub-samples of the same size. Also, robust rank-based estimators ...

Limited information strategies for topological games 

Clontz, Steven Craig, Jr. (2015-04-08)
A topological game G(X) is a two-player game which characterizes properties of a topological space X based upon the existence of winning perfect-information strategies for players in the game. If the property P is ...

Linear Topological Spaces 

McGuffey, William (2014-04-25)
In this thesis several topics from Topology, Linear Algebra, and Real Analysis are combined in the study of linear topological spaces. We begin with a brief look at linear spaces before moving on to study some basic ...

List-Edge Coloring Planar Graphs with Bounded Maximum Degree 

Harrelson, Joshua (2019-07-23)
In this thesis we prove that triangulations of maximum degree 5 are 6-list-edge-colorable. We also find necessary conditions for maximum degree to extend a list-edge-precoloring to E(G) for a planar graph G. The techniques ...

Location-Scale Bivariate Weibull Distributions For Bivariate 

Han, Yi (2005-12-15)
Much research has been conducted over the last thirty years in the development and characterization of bivariate survival distributions. Typically, the multivariate distribution is derived assuming that the marginal ...

Lower Bounds for Betti Numbers in Vietoris–Rips Complexes of Hypercubes 

Wang, Zichao (2024-04-29)
This thesis serves as a comprehensive introduction and elucidation of Henry Adams and Žiga Virk's seminal work \cite{Lower bounds} on new lower bounds on the Betti numbers for Vietoris–Rips complexes of hypercube graphs ...

Mathematical and Numerical Analysis for Linear Peridynamic Boundary Value Problems 

Wu, Hao (2017-04-26)
Peridynamics is motivated in aid of modeling the problems from continuum mechanics which involve the spontaneous discontinuity forms in the motion of a material system. By replacing differentiation with integration, ...

Mathematical Studies of Population Models in Stochastic Environments 

Jiaqi, Cheng (2022-04-28)
This dissertation is devoted to the study of population models in stochastic environments. We will investigate a two-species lottery model in non-stationary stochastic environment, an $N-$species lottery model in stationary ...

Mathematics Behind Planimeters 

Yardimci, Osman (2013-06-18)
Original master thesis project: By studying the literature, collect and write a survey paper on the mathematics of the planimeters. Planimeter is a somewhat forgotten ingenious device which was invented in 1814 to satisfy ...

Matrix Algebras over Strongly Non-Singular Rings 

McQuaig, Bradley (2014-03-31)
We consider some existing results regarding rings for which the classes of torsion-free and non-singular right modules coincide. Here, a right R-module M is non-singular if xI is nonzero for every nonzero x in M and every ...

Maximal L1 Regularity for a Class of Parabolic Systems and Applications to Navier-Stokes Equations 

Xu, Huan (2021-07-14)
This dissertation is devoted to the maximal L1-in-time regularity for a class of linear parabolic systems with variable coefficients. This theory can be applied to investigate the global-in-time well-posedness and stability ...

Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs 

Noble, Abigail (2012-08-02)
A set of S edge-disjoint hamilton cycles in a graph G is said to be maximal if the hamilton cycles in S form a subgraph of G such that G-E(S) has no hamilton cycle. The set of integers m for which a graph G contains a ...

Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs IV 

Tidwell, David (2021-12-06)
Finding the values of s for which there exists a maximal set of s edge-disjoint Hamilton cycles in the complete multipartite graph K_n^p has been considered in papers for over 20 years. This paper finally settles the problem ...

Maximum and minimum degree in iterated line graphs 

Aggarwal, Manu (2013-06-13)
In this thesis we analyze two papers, both by Dr. Stephen G. Hartke and Dr. Aparna W. Higginson, on maximum and minimum degrees of a graph $G$ under iterated line graph operations. Let $\Delta_{k}$ and $\delta_{k}$ denote ...

Measure-preserving dynamical systems on R3 with all trajectories bounded 

Ford, Jeffrey (2017-11-16)
We present here constructions, both smooth and piecewise-linear, of non-singular, measure-preserving dynamical systems on R3, with each trajectory contained in a bounded set. In the smooth case, we use a sequence of nested ...

The Metamorphosis of 2-fold Triple Systems into Maximum Packings of 2Kn with 4-cycles 

McClanahan, Stacie (2011-04-27)
The graph is called a hinge. A hinge system of order n is a pair (X, H) where H is a collection of edge disjoint hinges which partition the edge set of 2Kn with vertex set X. Let (X, H) be a hinge system and D the collection ...

The Metamorphosis of Maximum Packings of 2Kn with Triples into Maximum Packings of 2Kn with 4-cycles 

Couch, P. J. (2012-05-07)
In this work, the problem of constructing a maximum packing of 2Kn with triples having a metamorphosis into a maximum packing of 2Kn with 4-cycles is concluded by solving the problem for every n ≥ 11 such that n ≡ 2, 5, ...