Search Results

open access

Applications of Graph Theory and Topology to Combinatorial Designs

Description: This dissertation is concerned with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to obtain a design from a difference family. Chapters II to IV study the existence of an affine 3-(p^m,4,λ) design where the v-set is the Galois field GF(p^m). Associated to each prime p, this paper constructs a graph. If the graph has a 1-factor, then a difference family and hence an affine design exists. The question arises of how to determine … more
Date: December 1988
Creator: Somporn Sutinuntopas
Partner: UNT Libraries
open access

Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension

Description: This dissertation is a study of the dynamics of one-dimensional unimodal maps and is mainly concerned with those maps which are trapezoidal. The trapezoidal function, f_e, is defined for eΣ(0,1/2) by f_e(x)=x/e for xΣ[0,e], f_e(x)=1 for xΣ(e,1-e), and f_e(x)=(1-x)/e for xΣ[1-e,1]. We study the symbolic dynamics of the kneading sequences and relate them to the analytic dynamics of these maps. Chapter one is an overview of the present theory of Metropolis, Stein, and Stein (MSS). In Chapter two a… more
Date: May 1988
Creator: Brucks, Karen M. (Karen Marie), 1957-
Partner: UNT Libraries
open access

Operators on Continuous Function Spaces and Weak Precompactness

Description: If T:C(H,X)-->Y is a bounded linear operator then there exists a unique weakly regular finitely additive set function m:-->L(X,Y**) so that T(f) = ∫Hfdm. In this paper, bounded linear operators on C(H,X) are studied in terms the measure given by this representation theorem. The first chapter provides a brief history of representation theorems of these classes of operators. In the second chapter the represenation theorem used in the remainder of the paper is presented. If T is a weakly compact o… more
Date: August 1988
Creator: Abbott, Catherine Ann
Partner: UNT Libraries
open access

Dually Semimodular Consistent Lattices

Description: A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the… more
Date: May 1988
Creator: Gragg, Karen E. (Karen Elizabeth)
Partner: UNT Libraries
open access

On the Development of Descriptive Set Theory

Description: In the thesis, the author traces the historical development of descriptive set theory from the work of H. Lebesgue to the introduction of projective descriptive set theory. Proofs of most of the major results are given. Topics covered include Corel lattices, universal sets, the operation A, analytic sets, coanalytic sets, and the continuum hypothesis The appendix contains a translation of the famous letters exchanged between R. Baire, E. Borel, J. Hadamard and H. Lebesgue concerning Zermelo's a… more
Date: August 1988
Creator: Schlee, Glen A. (Glen Alan)
Partner: UNT Libraries
Back to Top of Screen