You limited your search to:

  Partner: UNT Libraries
 Decade: 2000-2009
 Degree Discipline: Mathematics
 Collection: UNT Theses and Dissertations
Hamiltonian cycles in subset and subspace graphs.

Hamiltonian cycles in subset and subspace graphs.

Access: Use of this item is restricted to the UNT Community.
Date: December 2004
Creator: Ghenciu, Petre Ion
Description: In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and Ismail's work in the 1996 paper "Binomial and Q-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and their Q-Analogues," we defined subset graphs, subspace graphs, and their associated bipartite graphs. The main emphasis of this dissertation is to describe those graphs and study their Hamiltonicity. The results on subset graphs are presented in Chapter 3, on subset bipartite graphs in Chapter 4, and on subspace graphs and subspace bipartite graphs in Chapter 5. We conclude the dissertation by suggesting some generalizations of our results concerning the panciclicity of the graphs.
Contributing Partner: UNT Libraries
Hyperbolic Monge-Ampère Equation

Hyperbolic Monge-Ampère Equation

Access: Use of this item is restricted to the UNT Community.
Date: August 2006
Creator: Howard, Tamani M.
Description: In this paper we use the Sobolev steepest descent method introduced by John W. Neuberger to solve the hyperbolic Monge-Ampère equation. First, we use the discrete Sobolev steepest descent method to find numerical solutions; we use several initial guesses, and explore the effect of some imposed boundary conditions on the solutions. Next, we prove convergence of the continuous Sobolev steepest descent to show local existence of solutions to the hyperbolic Monge-Ampère equation. Finally, we prove some results on the Sobolev gradients that mainly arise from general nonlinear differential equations.
Contributing Partner: UNT Libraries
Hyperspace Topologies

Hyperspace Topologies

Date: August 2001
Creator: Freeman, Jeannette Broad
Description: In this paper we study properties of metric spaces. We consider the collection of all nonempty closed subsets, Cl(X), of a metric space (X,d) and topologies on C.(X) induced by d. In particular, we investigate the Hausdorff topology and the Wijsman topology. Necessary and sufficient conditions are given for when a particular pseudo-metric is a metric in the Wijsman topology. The metric properties of the two topologies are compared and contrasted to show which also hold in the respective topologies. We then look at the metric space R-n, and build two residual sets. One residual set is the collection of uncountable, closed subsets of R-n and the other residual set is the collection of closed subsets of R-n having n-dimensional Lebesgue measure zero. We conclude with the intersection of these two sets being a residual set representing the collection of uncountable, closed subsets of R-n having n-dimensional Lebesgue measure zero.
Contributing Partner: UNT Libraries
Infinite Planar Graphs

Infinite Planar Graphs

Date: May 2000
Creator: Aurand, Eric William
Description: How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of geodesic fibers for graphs in this extended class and that for any graph in this extended class the only bounded automorphism is the identity automorphism.
Contributing Partner: UNT Libraries
Level Curves of the Angle Function of a Positive Definite Symmetric Matrix

Level Curves of the Angle Function of a Positive Definite Symmetric Matrix

Access: Use of this item is restricted to the UNT Community.
Date: December 2009
Creator: Bajracharya, Neeraj
Description: Given a real N by N matrix A, write p(A) for the maximum angle by which A rotates any unit vector. Suppose that A and B are positive definite symmetric (PDS) N by N matrices. Then their Jordan product {A, B} := AB + BA is also symmetric, but not necessarily positive definite. If p(A) + p(B) is obtuse, then there exists a special orthogonal matrix S such that {A, SBS^(-1)} is indefinite. Of course, if A and B commute, then {A, B} is positive definite. Our work grows from the following question: if A and B are commuting positive definite symmetric matrices such that p(A) + p(B) is obtuse, what is the minimal p(S) such that {A, SBS^(-1)} indefinite? In this dissertation we will describe the level curves of the angle function mapping a unit vector x to the angle between x and Ax for a 3 by 3 PDS matrix A, and discuss their interaction with those of a second such matrix.
Contributing Partner: UNT Libraries
Localized Radial Solutions for Nonlinear p-Laplacian Equation in RN

Localized Radial Solutions for Nonlinear p-Laplacian Equation in RN

Date: May 2008
Creator: Pudipeddi, Sridevi
Description: We establish the existence of radial solutions to the p-Laplacian equation ∆p u + f(u)=0 in RN, where f behaves like |u|q-1 u when u is large and f(u) < 0 for small positive u. We show that for each nonnegative integer n, there is a localized solution u which has exactly n zeros. Also, we look for radial solutions of a superlinear Dirichlet problem in a ball. We show that for each nonnegative integer n, there is a solution u which has exactly n zeros. Here we give an alternate proof to that which was given by Castro and Kurepa.
Contributing Partner: UNT Libraries
Lyapunov Exponents, Entropy and Dimension

Lyapunov Exponents, Entropy and Dimension

Date: August 2004
Creator: Williams, Jeremy M.
Description: We consider diffeomorphisms of a compact Riemann Surface. A development of Oseledec's Multiplicative Ergodic Theorem is given, along with a development of measure theoretic entropy and dimension. The main result, due to L.S. Young, is that for certain diffeomorphisms of a surface, there is a beautiful relationship between these three concepts; namely that the entropy equals dimension times expansion.
Contributing Partner: UNT Libraries
Mathematical Modeling of Charged Liquid Droplets: Numerical Simulation and Stability Analysis

Mathematical Modeling of Charged Liquid Droplets: Numerical Simulation and Stability Analysis

Date: May 2006
Creator: Vantzos, Orestis
Description: The goal of this thesis is to study of the evolution of 3D electrically charged liquid droplets of fluid evolving under the influence of surface tension and electrostatic forces. In the first part of the thesis, an appropriate mathematical model of the problem is introduced and the linear stability analysis is developed by perturbing a sphere with spherical harmonics. In the second part, the numerical solution of the problem is described with the use of the boundary elements method (BEM) on an adaptive mesh of triangular elements. The numerical method is validated by comparison with exact solutions. Finally, various numerical results are presented. These include neck formation in droplets, the evolution of surfaces with holes, singularity formation on droplets with various symmetries and numerical evidence that oblate spheroids are unstable.
Contributing Partner: UNT Libraries
Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7

Maximum-Sized Matroids with no Minors Isomorphic to U2,5, F7, F7¯, OR P7

Date: May 2000
Creator: Mecay, Stefan Terence
Description: Let M be the class of simple matroids which do not contain the 5-point line U2,5 , the Fano plane F7 , the non-Fano plane F7- , or the matroid P7 , as minors. Let h(n) be the maximum number of points in a rank-n matroid in M. We show that h(2)=4, h(3)=7, and h(n)=n(n+1)/2 for n>3, and we also find all the maximum-sized matroids for each rank.
Contributing Partner: UNT Libraries
A New Algorithm for Finding the Minimum Distance between Two Convex Hulls

A New Algorithm for Finding the Minimum Distance between Two Convex Hulls

Date: May 2009
Creator: Kaown, Dougsoo
Description: The problem of computing the minimum distance between two convex hulls has applications to many areas including robotics, computer graphics and path planning. Moreover, determining the minimum distance between two convex hulls plays a significant role in support vector machines (SVM). In this study, a new algorithm for finding the minimum distance between two convex hulls is proposed and investigated. A convergence of the algorithm is proved and applicability of the algorithm to support vector machines is demostrated. The performance of the new algorithm is compared with the performance of one of the most popular algorithms, the sequential minimal optimization (SMO) method. The new algorithm is simple to understand, easy to implement, and can be more efficient than the SMO method for many SVM problems.
Contributing Partner: UNT Libraries