UNT Theses and Dissertations - 60 Matching Results

Search Results

Results: 1 - 24 next
open access

Analysis Of Sequential Barycenter Random Probability Measures via Discrete Constructions

Description: Hill and Monticino (1998) introduced a constructive method for generating random probability measures with a prescribed mean or distribution on the mean. The method involves sequentially generating an array of barycenters that uniquely defines a probability measure. This work analyzes statistical properties of the measures generated by sequential barycenter array constructions. Specifically, this work addresses how changing the base measures of the construction affects the statististics of m… more
Date: December 2002
Creator: Valdes, LeRoy I.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Applications in Fixed Point Theory

Description: Banach's contraction principle is probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's contraction principle are made. Some of these applications involve obtaining new metrics on a space, forcing a continuous map to have a fixed point, and using condi… more
Date: December 2005
Creator: Farmer, Matthew Ray
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
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
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Borel Determinacy and Metamathematics

Description: Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and… more
Date: December 2001
Creator: Bryant, Ross
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Chebyshev Subsets in Smooth Normed Linear Spaces

Description: This paper is a study of the relation between smoothness of the norm on a normed linear space and the property that every Chebyshev subset is convex. Every normed linear space of finite dimension, having a smooth norm, has the property that every Chebyshev subset is convex. In the second chapter two properties of the norm, uniform Gateaux differentiability and uniform Frechet differentiability where the latter implies the former, are given and are shown to be equivalent to smoothness of the nor… more
Date: December 1974
Creator: Svrcek, Frank J.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Classification of Regular Planar Graphs

Description: The purpose of this paper is the investigation and classification of regular planar graphs. The motive behind this investigation was a desire to better understand those properties which allow a graph to be represented in the plane in such a manner that no two edges cross except perhaps at vertices.
Date: December 1972
Creator: McCalla, Linda F.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Compact Operators and the Schrödinger Equation

Description: In this thesis I look at the theory of compact operators in a general Hilbert space, as well as the inverse of the Hamiltonian operator in the specific case of L2[a,b]. I show that this inverse is a compact, positive, and bounded linear operator. Also the eigenfunctions of this operator form a basis for the space of continuous functions as a subspace of L2[a,b]. A numerical method is proposed to solve for these eigenfunctions when the Hamiltonian is considered as an operator on Rn. The pape… more
Date: December 2006
Creator: Kazemi, Parimah
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Completeness Axioms in an Ordered Field

Description: The purpose of this paper was to prove the equivalence of the following completeness axioms. This purpose was carried out by first defining an ordered field and developing some basic theorems relative to it, then proving that lim [(u+u)*]^n = z (where u is the multiplicative identity, z is the additive identity, and * indicates the multiplicative inverse of an element), and finally proving the equivalence of the five axioms.
Date: December 1971
Creator: Carter, Louis Marie
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Continuous, Nowhere-Differentiable Function with a Dense Set of Proper Local Extrema

Description: In this paper, we use the following scheme to construct a continuous, nowhere-differentiable function 𝑓 which is the uniform limit of a sequence of sawtooth functions 𝑓ₙ : [0, 1] → [0, 1] with increasingly sharp teeth. Let 𝑋 = [0, 1] x [0, 1] and 𝐹(𝑋) be the Hausdorff metric space determined by 𝑋. We define contraction maps 𝑤₁ , 𝑤₂ , 𝑤₃ on 𝑋. These maps define a contraction map 𝑤 on 𝐹(𝑋) via 𝑤(𝐴) = 𝑤₁(𝐴) ⋃ 𝑤₂(𝐴) ⋃ 𝑤₃(𝐴). The iteration under 𝑤 of the diagonal in 𝑋 defines a sequence of graphs of… more
Date: December 1993
Creator: Huggins, Mark C. (Mark Christopher)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Continuous, Nowhere-Differentiable Functions with no Finite or Infinite One-Sided Derivative Anywhere

Description: In this paper, we study continuous functions with no finite or infinite one-sided derivative anywhere. In 1925, A. S. Beskovitch published an example of such a function. Since then we call them Beskovitch functions. This construction is presented in chapter 2, The example was simple enough to clear the doubts about the existence of Besicovitch functions. In 1932, S. Saks showed that the set of Besicovitch functions is only a meager set in C[0,1]. Thus the Baire category method for showing the e… more
Date: December 1994
Creator: Lee, Jae S. (Jae Seung)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

The Continuous Wavelet Transform and the Wave Front Set

Description: In this paper I formulate an explicit wavelet transform that, applied to any distribution in S^1(R^2), yields a function on phase space whose high-frequency singularities coincide precisely with the wave front set of the distribution. This characterizes the wave front set of a distribution in terms of the singularities of its wavelet transform with respect to a suitably chosen basic wavelet.
Date: December 1993
Creator: Navarro, Jaime
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Contributions to Descriptive Set Theory

Description: Assume AD+V=L(R). In the first chapter, let W^1_1 denote the club measure on \omega_1. We analyze the embedding j_{W^1_1}\restr HOD from the point of view of inner model theory. We use our analysis to answer a question of Jackson-Ketchersid about codes for ordinals less than \omega_\omega. In the second chapter, we provide an indiscernibles analysis for models of the form L[T_n,x]. We use our analysis to provide new proofs of the strong partition property on \delta^1_{2n+1}
Date: December 2016
Creator: Dance, Cody
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Conway's Link Polynomial: a Generalization of the Classic Alexander's Knot Polynomial

Description: The problem under consideration is that of determining a simple and effective invariant of knots. To this end, the Conway polynomial is defined as a generalization of Alexander's original knot polynomial. It is noted, however, that the Conway polynomial is not a complete invariant. If two knots are equivalent, as defined in this investigation, then they receive identical polynomials. Yet, if two knots have identical polynomials, no information about their equivalence may be obtained. To define … more
Date: December 1986
Creator: Woodard, Mary Kay
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Counting Plane Tropical Curves via Lattice Paths in Polygons

Description: A projective plane tropical curve is a proper immersion of a graph into the real Cartesian plane subject to some conditions such as that the images of all the edges must be lines with rational slopes. Two important combinatorial invariants of a projective plane tropical curve are its degree, d, and genus g. First, we explore Gathmann and Markwig's approach to the study of the moduli spaces of such curves and explain their proof that the number of projective plane tropical curves, counting mult… more
Date: December 2021
Creator: Zhang, Yingyu
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Cycles and Cliques in Steinhaus Graphs

Description: In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian.
Date: December 1994
Creator: Lim, Daekeun
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

A Decomposition of the Group Algebra of a Hyperoctahedral Group

Description: The descent algebra of a Coxeter group is a subalgebra of the group algebra with interesting representation theoretic properties. For instance, the natural map from the descent algebra of the symmetric group to the character ring is a surjective algebra homomorphism, so the descent algebra implicitly encodes information about the representations of the symmetric group. However, this property does not hold for other Coxeter groups. Moreover, a complete set of primitive idempotents in the descent… more
Date: December 2016
Creator: Tomlin, Drew E
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Equivalent Sets and Cardinal Numbers

Description: The purpose of this thesis is to study the equivalence relation between sets A and B: A o B if and only if there exists a one to one function f from A onto B. In Chapter I, some of the fundamental properties of the equivalence relation are derived. Certain basic results on countable and uncountable sets are given. In Chapter II, a number of theorems on equivalent sets are proved and Dedekind's definitions of finite and infinite are compared with the ordinary concepts of finite and infinite. The… more
Date: December 1975
Creator: Hsueh, Shawing
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries

Hamiltonian cycles in subset and subspace graphs.

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 defin… more
Access: Restricted to UNT Community Members. Login required if off-campus.
Date: December 2004
Creator: Ghenciu, Petre Ion
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Homotopies and Deformation Retracts

Description: This paper introduces the background concepts necessary to develop a detailed proof of a theorem by Ralph H. Fox which states that two topological spaces are the same homotopy type if and only if both are deformation retracts of a third space, the mapping cylinder. The concepts of homotopy and deformation are introduced in chapter 2, and retraction and deformation retract are defined in chapter 3. Chapter 4 develops the idea of the mapping cylinder, and the proof is completed. Three special cas… more
Date: December 1990
Creator: Stark, William D. (William David)
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
open access

Hyperspaces

Description: This paper is an exposition of the theory of the hyperspaces 2^X and C(X) of a topological space X. These spaces are obtained from X by collecting the nonempty closed and nonempty closed connected subsets respectively, and are topologized by the Vietoris topology. The paper is organized in terms of increasing specialization of spaces, beginning with T1 spaces and proceeding through compact spaces, compact metric spaces and metric continua. Several basic techniques in hyperspace theory are disc… more
Date: December 1976
Creator: Voas, Charles H.
Item Type: Refine your search to only Thesis or Dissertation
Partner: UNT Libraries
Back to Top of Screen