## You limited your search to:

Partner: UNT Libraries
Department: Department of Mathematics
Year: 2000
Degree Level: Doctoral
Collection: UNT Theses and Dissertations
Results 1 - 3 of 3
|   |

### Examples and Applications of Infinite Iterated Function Systems

Date: August 2000
Creator: Hanus, Pawel Grzegorz
Description: The aim of this work is the study of infinite conformal iterated function systems. More specifically, we investigate some properties of a limit set J associated to such system, its Hausdorff and packing measure and Hausdorff dimension. We provide necessary and sufficient conditions for such systems to be bi-Lipschitz equivalent. We use the concept of scaling functions to obtain some result about 1-dimensional systems. We discuss particular examples of infinite iterated function systems derived from complex continued fraction expansions with restricted entries. Each system is obtained from an infinite number of contractions. We show that under certain conditions the limit sets of such systems possess zero Hausdorff measure and positive finite packing measure. We include an algorithm for an approximation of the Hausdorff dimension of limit sets. One numerical result is presented. In this thesis we also explore the concept of positively recurrent function. We use iterated function systems to construct a natural, wide class of such functions that have strong ergodic properties.
Contributing Partner: UNT Libraries

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

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