## You limited your search to:

**Partner:**UNT Libraries

**Department:**Department of Mathematics

**Language:**English

**Collection:**UNT Theses and Dissertations

### Characterizations of Some Combinatorial Geometries

**Date:**August 1992

**Creator:**Yoon, Young-jin

**Description:**We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non—splitting supersolvable signed-graphic geometries : If a non-splitting supersolvable ternary geometry does not contain the Reid geometry as a subgeometry, then it is signed—graphic.

**Contributing Partner:**UNT Libraries

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

### A Classification of Regular Planar Graphs

**Date:**December 1972

**Creator:**McCalla, Linda F.

**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.

**Contributing Partner:**UNT Libraries

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

### A Collapsing Result Using the Axiom of Determinancy and the Theory of Possible Cofinalities

**Date:**May 2001

**Creator:**May, Russell J.

**Description:**Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a) (the ideal of sets which force cof Π α < λ) is generated from J<λ+(a) by adding a singleton. Combining these results with a polarized partition relation on ω1

**Contributing Partner:**UNT Libraries

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

### Compact Convex Sets in Linear Topological Spaces

**Date:**May 1964

**Creator:**Read, David R.

**Description:**The purpose of this paper is to examine properties of convex sets in linear topological spaces with special emphasis on compact convex sets.

**Contributing Partner:**UNT Libraries

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

### Compact Operators and the Schrödinger Equation

**Date:**December 2006

**Creator:**Kazemi, Parimah

**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 paper finishes with a discussion of examples of Schrödinger equations and the solutions.

**Contributing Partner:**UNT Libraries

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

### Compact Topological Spaces

**Date:**June 1964

**Creator:**Conway, Thomas M.

**Description:**The purpose of this paper is to investigate some properties of compact topological spaces and to relate these concepts to the separation properties.

**Contributing Partner:**UNT Libraries

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

### Compactness and Equivalent Notions

**Date:**August 1967

**Creator:**Bell, Wayne Charles

**Description:**One of the classic theorems concerning the real numbers states that every open cover of a closed and bounded subset of the real line contains a finite subcover. Compactness is an abstraction of that notion, and there are several ideas concerning it which are equivalent and many which are similar. The purpose of this paper is to synthesize the more important of these ideas. This synthesis is accomplished by demonstrating either situations in which two ordinarily different conditions are equivalent or combinations of two or more properties which will guarantee a third.

**Contributing Partner:**UNT Libraries

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

### The Comparability of Cardinals

**Date:**May 1964

**Creator:**Owen, Aubrey P.

**Description:**The purpose of this composition is to develop a rigorous, axiomatic proof of the comparability of the cardinals of infinite sets.

**Contributing Partner:**UNT Libraries

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

### A Comparative Study of Non Linear Conjugate Gradient Methods

**Date:**August 2013

**Creator:**Pathak, Subrat

**Description:**We study the development of nonlinear conjugate gradient methods, Fletcher Reeves (FR) and Polak Ribiere (PR). FR extends the linear conjugate gradient method to nonlinear functions by incorporating two changes, for the step length αk a line search is performed and replacing the residual, rk (rk=b-Axk) by the gradient of the nonlinear objective function. The PR method is equivalent to FR method for exact line searches and when the underlying quadratic function is strongly convex. The PR method is basically a variant of FR and primarily differs from it in the choice of the parameter βk. On applying the nonlinear Rosenbrock function to the MATLAB code for the FR and the PR algorithms we observe that the performance of PR method (k=29) is far better than the FR method (k=42). But, we observe that when the MATLAB codes are applied to general nonlinear functions, specifically functions whose minimum is a large negative number not close to zero and the iterates too are large values far off from zero the PR algorithm does not perform well. This problem with the PR method persists even if we run the PR algorithm for more iterations or with an initial guess closer to the ...

**Contributing Partner:**UNT Libraries

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

### Comparison of Some Mappings in Topology

**Date:**January 1964

**Creator:**Aslan, Farhad

**Description:**The main purpose of this paper is the study of transformations in topological space and relationships between special types of transformations.

**Contributing Partner:**UNT Libraries

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

### A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil

**Date:**June 1947

**Creator:**Copp, George

**Description:**In treating the motion of a fluid mathematically, it is convenient to make some simplifying assumptions. The assumptions which are made will be justifiable if they save long and laborious computations in practical problems, and if the predicted results agree closely enough with experimental results for practical use. In dealing with the flow of air about an airfoil, at subsonic speeds, the fluid will be considered as a homogeneous, incompressible, inviscid fluid.

**Contributing Partner:**UNT Libraries

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

### Complemented Subspaces of Bounded Linear Operators

**Date:**August 2003

**Creator:**Bahreini Esfahani, Manijeh

**Description:**For many years mathematicians have been interested in the problem of whether an operator ideal is complemented in the space of all bounded linear operators. In this dissertation the complementation of various classes of operators in the space of all bounded linear operators is considered. This paper begins with a preliminary discussion of linear bounded operators as well as operator ideals. Let L(X, Y ) be a Banach space of all bounded linear operator between Banach spaces X and Y , K(X, Y ) be the space of all compact operators, and W(X, Y ) be the space of all weakly compact operators. We denote space all operator ideals by O.

**Contributing Partner:**UNT Libraries

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

### Complete Ordered Fields

**Date:**August 1977

**Creator:**Arnold, Thompson Sharon

**Description:**The purpose of this thesis is to study the concept of completeness in an ordered field. Several conditions which are necessary and sufficient for completeness in an ordered field are examined. In Chapter I the definitions of a field and an ordered field are presented and several properties of fields and ordered fields are noted. Chapter II defines an Archimedean field and presents several conditions equivalent to the Archimedean property. Definitions of a complete ordered field (in terms of a least upper bound) and the set of real numbers are also stated. Chapter III presents eight conditions which are equivalent to completeness in an ordered field. These conditions include the concepts of nested intervals, Dedekind cuts, bounded monotonic sequences, convergent subsequences, open coverings, cluster points, Cauchy sequences, and continuous functions.

**Contributing Partner:**UNT Libraries

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

### Completely Simple Semigroups

**Date:**August 1968

**Creator:**Barker, Bruce W.

**Description:**The purpose of this thesis is to explore some of the characteristics of 0-simple semigroups and completely 0-simple semigroups.

**Contributing Partner:**UNT Libraries

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

### Completeness Axioms in an Ordered Field

**Date:**December 1971

**Creator:**Carter, Louis Marie

**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.

**Contributing Partner:**UNT Libraries

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

### Completing the Space of Step Functions

**Date:**August 1972

**Creator:**Massey, Linda K.

**Description:**In this thesis a study is made of the space X of all step functions on [0,1]. This investigation includes determining a completion space, X*, for the incomplete space X, defining integration for X*, and proving some theorems about integration in X*.

**Contributing Partner:**UNT Libraries

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

### A Computation of Partial Isomorphism Rank on Ordinal Structures

**Date:**August 2006

**Creator:**Bryant, Ross

**Description:**We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.

**Contributing Partner:**UNT Libraries

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

### The Computation of Ultrapowers by Supercompactness Measures

**Date:**August 1999

**Creator:**Smith, John C.

**Description:**The results from this dissertation are a computation of ultrapowers by supercompactness measures and concepts related to such measures. The second chapter gives an overview of the basic ideas required to carry out the computations. Included are preliminary ideas connected to measures, and the supercompactness measures. Order type results are also considered in this chapter. In chapter III we give an alternate characterization of 2 using the notion of iterated ordinal measures. Basic facts related to this characterization are also considered here. The remaining chapters are devoted to finding bounds fwith arguments taking place both inside and outside the ultrapowers. Conditions related to the upper bound are given in chapter VI.

**Contributing Partner:**UNT Libraries

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

### Concerning linear spaces

**Date:**June 1965

**Creator:**Gilbreath, Joe

**Description:**The basis for this thesis is H. S. Wall's book, Creative Mathematics, with particular emphasis on the chapter in that book entitled "More About Linear Spaces."

**Contributing Partner:**UNT Libraries

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

### Concerning Measure Theory

**Date:**August 1972

**Creator:**Glasscock, Robert Ray

**Description:**The purpose of this thesis is to study the concept of measure and associated concepts. The study is general in nature; that is, no particular examples of a measure are given.

**Contributing Partner:**UNT Libraries

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

### Concerning the Convergence of Some Nets

**Date:**August 1964

**Creator:**Shaw, Jack V.

**Description:**This thesis discusses the convergence of nets through a series of theorems and proofs.

**Contributing Partner:**UNT Libraries

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

### Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation

**Date:**August 2014

**Creator:**Montgomery, Jason W.

**Description:**A steepest descent method is constructed for the general setting of a linear differential equation paired with uniqueness-inducing conditions which might yield a generally overdetermined system. The method differs from traditional steepest descent methods by considering the conditions when defining the corresponding Sobolev space. The descent method converges to the unique solution to the differential equation so that change in condition values is minimal. The system has a solution if and only if the first iteration of steepest descent satisfies the system. The finite analogue of the descent method is applied to example problems involving finite difference equations. The well-posed problems include a singular ordinary differential equation and Laplace’s equation, each paired with respective Dirichlet-type conditions. The overdetermined problems include a first-order nonsingular ordinary differential equation with Dirichlet-type conditions and the wave equation with both Dirichlet and Neumann conditions. The method is applied in an investigation of the Tricomi equation, a long-studied equation which acts as a prototype of mixed partial differential equations and has application in transonic flow. The Tricomi equation has been studied for at least ninety years, yet necessary and sufficient conditions for existence and uniqueness of solutions on an arbitrary mixed domain remain unknown. The domains ...

**Contributing Partner:**UNT Libraries

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

### Conditions under which Certain Inequalities Become Equalities

**Date:**1948

**Creator:**Vaughan, Nick H.

**Description:**The object of this paper is to consider necessary and sufficient conditions in order for certain important inequalities, which are frequently used in analysis, to reduce to equalities.

**Contributing Partner:**UNT Libraries

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

### Connectedness and Some Concepts Related to Connectedness of a Topological Space

**Date:**August 1969

**Creator:**Wallace, Michael A.

**Description:**The purpose of this thesis is to investigate the idea of topological "connectedness" by presenting some of the basic ideas concerning connectedness along with several related concepts.

**Contributing Partner:**UNT Libraries

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