UNT Theses and Dissertations - 5 Matching Results

Search Results

Results: 1 - 5
open access

The Global Structure of Iterated Function Systems

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… more
Date: May 2009
Creator: Snyder, Jason Edward
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

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

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 quest… more
Date: December 2009
Creator: Bajracharya, Neeraj
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

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

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 … more
Date: May 2009
Creator: Kaown, Dougsoo
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

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

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 subfl… more
Date: August 2009
Creator: Seward, Brandon Michael
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Urysohn ultrametric spaces and isometry groups.

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-p… more
Date: May 2009
Creator: Shao, Chuang
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
Back to Top of Screen