## You limited your search to:

**Partner:**UNT Libraries

**Decade:**2000-2009

**Degree Discipline:**Mathematics

**Collection:**UNT Theses and Dissertations

### 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

**Permallink:**digital.library.unt.edu/ark:/67531/metadc28376/

### On the density of minimal free subflows of general symbolic flows.

**Date:**August 2009

**Creator:**Seward, Brandon Michael

**Description:**This paper studies symbolic dynamical systems {0, 1}G, where G is a countably infinite group, {0, 1}G has the product topology, and G acts on {0, 1}G by shifts. It is proven that for every countably infinite group G the union of the minimal free subflows of {0, 1}G is dense. In fact, a stronger result is obtained which states that if G is a countably infinite group and U is an open subset of {0, 1}G, then there is a collection of size continuum consisting of pairwise disjoint minimal free subflows intersecting U.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc11009/

### The Global Structure of Iterated Function Systems

**Date:**May 2009

**Creator:**Snyder, Jason Edward

**Description:**I study sets of attractors and non-attractors of finite iterated function systems. I provide examples of compact sets which are attractors of iterated function systems as well as compact sets which are not attractors of any iterated function system. I show that the set of all attractors is a dense Fs set and the space of all non-attractors is a dense Gd set it the space of all non-empty compact subsets of a space X. I also investigate the small trans-finite inductive dimension of the space of all attractors of iterated function systems generated by similarity maps on [0,1].

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc9917/

### 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

**Permallink:**digital.library.unt.edu/ark:/67531/metadc9845/

### Urysohn ultrametric spaces and isometry groups.

**Date:**May 2009

**Creator:**Shao, Chuang

**Description:**In this dissertation we study a special sub-collection of Polish metric spaces: complete separable ultrametric spaces. Polish metric spaces have been studied for quite a long while, and a lot of results have been obtained. Motivated by some of earlier research, we work on the following two main parts in this dissertation. In the first part, we show the existence of Urysohn Polish R-ultrametric spaces, for an arbitrary countable set R of non-negative numbers, including 0. Then we give point-by-point construction of a countable R-ultra-Urysohn space. We also obtain a complete characterization for the set R which corresponding to a R-Urysohn metric space. From this characterization we conclude that there exist R-Urysohn spaces for a wide family of countable R. Moreover, we determine the complexity of the classification of all Polish ultrametric spaces. In the second part, we investigate the isometry groups of Polish ultrametric spaces. We prove that isometry group of an Urysohn Polish R-ultrametric space is universal among isometry groups of Polish R-ultrametric spaces. We completely characterize the isometry groups of finite ultrametric spaces and the isometry groups of countable compact ultrametric spaces. Moreover, we give some necessary conditions for finite groups to be isomorphic to some isometry ...

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc9918/

### A Constructive Method for Finding Critical Point of the Ginzburg-Landau Energy Functional

**Date:**August 2008

**Creator:**Kazemi, Parimah

**Description:**In this work I present a constructive method for finding critical points of the Ginzburg-Landau energy functional using the method of Sobolev gradients. I give a description of the construction of the Sobolev gradient and obtain convergence results for continuous steepest descent with this gradient. I study the Ginzburg-Landau functional with magnetic field and the Ginzburg-Landau functional without magnetic field. I then present the numerical results I obtained by using steepest descent with the discretized Sobolev gradient.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc9075/

### Spaces of operators containing co and/or l ∞ with an application of vector measures.

**Date:**August 2008

**Creator:**Schulle, Polly Jane

**Description:**The Banach spaces L(X, Y), K(X, Y), Lw*(X*, Y), and Kw*(X*, Y) are studied to determine when they contain the classical Banach spaces co or l ∞. The complementation of the Banach space K(X, Y) in L(X, Y) is discussed as well as what impact this complementation has on the embedding of co or l∞ in K(X, Y) or L(X, Y). Results concerning the complementation of the Banach space Kw*(X*, Y) in Lw*(X*, Y) are also explored and how that complementation affects the embedding of co or l ∞ in Kw*(X*, Y) or Lw*(X*, Y). The l p spaces for 1 ≤ p < ∞ are studied to determine when the space of compact operators from one l p space to another contains co. The paper contains a new result which classifies these spaces of operators. Results of Kalton, Feder, and Emmanuele concerning the complementation of K(X, Y) in L(X, Y) are generalized. A new result using vector measures is given to provide more efficient proofs of theorems by Kalton, Feder, Emmanuele, Emmanuele and John, and Bator and Lewis as well as a new proof of the fact that l ∞ is prime.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc9036/

### 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

**Permallink:**digital.library.unt.edu/ark:/67531/metadc6059/

### Uniqueness Results for the Infinite Unitary, Orthogonal and Associated Groups

**Date:**May 2008

**Creator:**Atim, Alexandru Gabriel

**Description:**Let H be a separable infinite dimensional complex Hilbert space, let U(H) be the Polish topological group of unitary operators on H, let G be a Polish topological group and φ:G→U(H) an algebraic isomorphism. Then φ is a topological isomorphism. The same theorem holds for the projective unitary group, for the group of *-automorphisms of L(H) and for the complex isometry group. If H is a separable real Hilbert space with dim(H)≥3, the theorem is also true for the orthogonal group O(H), for the projective orthogonal group and for the real isometry group. The theorem fails for U(H) if H is finite dimensional complex Hilbert space.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc6136/

### Around the Fibonacci Numeration System

**Date:**May 2007

**Creator:**Edson, Marcia Ruth

**Description:**Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can be written as a sum of distinct Fibonacci numbers, we exhibit certain regularity properties of R(n), one of which is connected to the Euler φ-function. In addition, using a theorem of Fine and Wilf, we give a formula for R(n) in terms of binomial coefficients modulo two.

**Contributing Partner:**UNT Libraries

**Permallink:**digital.library.unt.edu/ark:/67531/metadc3676/