## You limited your search to:

**Partner:**UNT Libraries

**Department:**Department of Mathematics

**Collection:**UNT Theses and Dissertations

### Interpolation and Approximation

**Date:**May 1977

**Creator:**Lal, Ram

**Description:**In this paper, there are three chapters. The first chapter discusses interpolation. Here a theorem about the uniqueness of the solution to the general interpolation problem is proven. Then the problem of how to represent this unique solution is discussed. Finally, the error involved in the interpolation and the convergence of the interpolation process is developed. In the second chapter a theorem about the uniform approximation to continuous functions is proven. Then the best approximation and the least squares approximation (a special case of best approximation) is discussed. In the third chapter orthogonal polynomials as discussed as well as bounded linear functionals in Hilbert spaces, interpolation and approximation and approximation in Hilbert space.

**Contributing Partner:**UNT Libraries

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

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

### The Wallman Spaces and Compactifications

**Date:**December 1976

**Creator:**Liu, Wei-kong

**Description:**If X is a topological space and Y is a ring of closed sets, then a necessary and sufficient condition for the Wallman space W(X,F) to be a compactification of X is that X be T1 andYF separating. A necessary and sufficient condition for a Wallman compactification to be Hausdoff is that F be a normal base. As a result, not all T, compactifications can be of Wallman type. One point and finite Hausdorff compactifications are of Wallman type.

**Contributing Partner:**UNT Libraries

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

### Valuations on Fields

**Date:**May 1977

**Creator:**Walker, Catherine A.

**Description:**This thesis investigates some properties of valuations on fields. Basic definitions and theorems assumed are stated in Capter I. Chapter II introduces the concept of a valuation on a field. Real valuations and non-Archimedean valuations are presented. Chapter III generalizes non-Archimedean valuations. Examples are described in Chapters I and II. A result is the theorem stating that a real valuation of a field K is non-Archimedean if and only if $(a+b) < max4# (a), (b) for all a and b in K. Chapter III generally defines a non-Archimedean valuation as an ordered abelian group. Real non-Archimedean valuations are either discrete or nondiscrete. Chapter III shows that every valuation ring identifies a non-Archimedean valuation and every non-Archimedean valuation identifies a valuation ring.

**Contributing Partner:**UNT Libraries

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

### Subdirectly Irreducible Semigroups

**Date:**December 1978

**Creator:**Winton, Richard Alan

**Description:**Definition 1.1. The ordered pair (S,*) is a semi-group iff S is a set and * is an associative binary operation (multiplication) on S. Notation. A semigroup (S,*) will ordinarily be referred to by the set S, with the multiplication understood. In other words, if (a,b)e SX , then *[(a,b)] = a*b = ab. The proof of the following proposition is found on p. 4 of Introduction to Semigroups, by Mario Petrich. Proposition 1.2. Every semigroup S satisfies the general associative law.

**Contributing Partner:**UNT Libraries

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

### Integrability, Measurability, and Summability of Certain Set Functions

**Date:**December 1977

**Creator:**Dawson, Dan Paul

**Description:**The purpose of this paper is to investigate the integrability, measurability, and summability of certain set functions. The paper is divided into four chapters. The first chapter contains basic definitions and preliminary remarks about set functions and absolute continuity. In Chapter i, the integrability of bounded set functions is investigated. The chapter culminates with a theorem that characterizes the transmission of the integrability of a real function of n bounded set functions. In Chapter III, measurability is defined and a characterization of the transmission of measurability by a function of n variables is provided, In Chapter IV, summability is defined and the summability of set functions is investigated, Included is a characterization of the transmission of summability by a function of n variables.

**Contributing Partner:**UNT Libraries

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

### Hyperspaces

**Date:**December 1976

**Creator:**Voas, Charles H.

**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 discussed, and these techniques are applied to elucidate the topological structure of hyperspaces.

**Contributing Partner:**UNT Libraries

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

### Continua and Related Topics

**Date:**August 1982

**Creator:**Brucks, Karen M. (Karen Marie), 1957-

**Description:**This paper is a study of continue and related metric spaces, Chapter I is an introductory chapter. Irreducible continua and noncut points are the main topics in Chapter II. The third chapter begins with a few results on locally connected spaces. These results are then used to prove results in locally connected continua. Decomposable and indecomposable continua are dealt with in Chapter IV. Totally disconnected metric spaces are studied in the beginning of Chapter V. Then we see that every compact metric space is a continuous image of the Cantor set. A continuous map from the Cantor set onto [0,1] is constructed. Also, a continuous map from [0,1] onto [0,1]x[0,1] is built, Then an order preserving homeomorphism is constructed from a metric arc onto [0,1],

**Contributing Partner:**UNT Libraries

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

### Sufficient Criteria for Total Differentiability of a Real Valued Function of a Complex Variable in Rn an Extension of H. Rademacher's Result for R²

**Date:**August 1982

**Creator:**Matovsky, Veron Rodieck

**Description:**This thesis provides sufficient conditions for total differentiability almost everywhere of a real-valued function of a complex variable defined on a bounded region in IRn. This thesis extends H. Rademacher's 1918 results in IR2 which culminated in total differentiability, to IRn

**Contributing Partner:**UNT Libraries

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

### Fourier Transforms of Functions on a Finite Abelian Group

**Date:**August 1982

**Creator:**Currey, Bradley Norton

**Description:**This paper presents a theory of Fourier transforms of complex-valued functions on a finite abelian group and investigates two applications of this theory. Chapter I is an introduction with remarks on notation. Basic theory, including Pontrvagin duality and the Poisson Summation formula, is the subject of Chapter II. In Chapter III the Fourier transform is viewed as an intertwining operator for certain unitary group representations. The solution of the eigenvalue problem of the Fourier transform of functions on the group Z/n of integers module n leads to a proof of the quadratic reciprocity law in Chapter IV. Chapter V addresses the, use of the Fourier transform in computing.

**Contributing Partner:**UNT Libraries

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

### An Existence Theorem for an Integral Equation

**Date:**May 1985

**Creator:**Hunt, Cynthia Young

**Description:**The principal theorem of this thesis is a theorem by Peano on the existence of a solution to a certain integral equation. The two primary notions underlying this theorem are uniform convergence and equi-continuity. Theorems related to these two topics are proved in Chapter II. In Chapter III we state and prove a classical existence and uniqueness theorem for an integral equation. In Chapter IV we consider the approximation on certain functions by means of elementary expressions involving "bent line" functions. The last chapter, Chapter V, is the proof of the theorem by Peano mentioned above. Also included in this chapter is an example in which the integral equation has more than one solution. The first chapter sets forth basic definitions and theorems with which the reader should be acquainted.

**Contributing Partner:**UNT Libraries

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

### Product Measure

**Date:**August 1983

**Creator:**Race, David M. (David Michael)

**Description:**In this paper we will present two different approaches to the development of product measures. In the second chapter we follow the lead of H. L. Royden in his book Real Analysis and develop product measure in the context of outer measure. The approach in the third and fourth chapters will be the one taken by N. Dunford and J. Schwartz in their book Linear Operators Part I. Specifically, in the fourth chapter, product measures arise almost entirely as a consequence of integration theory. Both developments culminate with proofs of well known theorems due to Fubini and Tonelli.

**Contributing Partner:**UNT Libraries

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

### Axiom of Choice Equivalences and Some Applications

**Date:**August 1983

**Creator:**Race, Denise T. (Denise Tatsch)

**Description:**In this paper several equivalences of the axiom of choice are examined. In particular, the axiom of choice, Zorn's lemma, Tukey's lemma, the Hausdorff maximal principle, and the well-ordering theorem are shown to be equivalent. Cardinal and ordinal number theory is also studied. The Schroder-Bernstein theorem is proven and used in establishing order results for cardinal numbers. It is also demonstrated that the first uncountable ordinal space is unique up to order isomorphism. We conclude by encountering several applications of the axiom of choice. In particular, we show that every vector space must have a Hamel basis and that any two Hamel bases for the same space must have the same cardinality. We establish that the Tychonoff product theorem implies the axiom of choice and see the use of the axiom of choice in the proof of the Hahn- Banach theorem.

**Contributing Partner:**UNT Libraries

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

### Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux

**Date:**August 1983

**Creator:**Sutherland, David C. (David Craig)

**Description:**In this thesis, we describe Schensted's algorithm for finding the length of a longest increasing subsequence of a finite sequence. Schensted's algorithm also constructs a bijection between permutations of the first N natural numbers and standard bitableaux of size N. We also describe the Hillman-Grassl algorithm which constructs a bijection between reverse plane partitions and the solutions in natural numbers of a linear equation involving hook lengths. Pascal programs and sample output for both algorithms appear in the appendix. In addition, we describe the operations on standard bitableaux corresponding to the operations of inverting and reversing permutations. Finally, we show that these operations generate the dihedral group D_4

**Contributing Partner:**UNT Libraries

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

### Convergence of Infinite Series

**Date:**August 1983

**Creator:**Abbott, Catherine Ann

**Description:**The purpose of this paper is to examine certain questions concerning infinite series. The first chapter introduces several basic definitions and theorems from calculus. In particular, this chapter contains the proofs for various convergence tests for series of real numbers. The second chapter deals primarily with the equivalence of absolute convergence, unconditional convergence, bounded multiplier convergence, and c0 multiplier convergence for series of real numbers. Also included in this chapter is a proof that an unconditionally convergent series may be rearranged so that it converges to any real number desired. The third chapter contains a proof of the Silverman-Toeplitz Theorem together with several applications.

**Contributing Partner:**UNT Libraries

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

### Dimension Theory

**Date:**August 1986

**Creator:**Frere, Scot M. (Scot Martin)

**Description:**This paper contains a discussion of topological dimension theory. Original proofs of theorems, as well as a presentation of theorems and proofs selected from Ryszard Engelking's Dimension Theory are contained within the body of this endeavor. Preliminary notation is introduced in Chapter I. Chapter II consists of the definition of and theorems relating to the small inductive dimension function Ind. Large inductive dimension is investigated in Chapter III. Chapter IV comprises the definition of covering dimension and theorems discussing the equivalence of the different dimension functions in certain topological settings. Arguments pertaining to the dimension o f Jn are also contained in Chapter IV.

**Contributing Partner:**UNT Libraries

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

### The Mean Integral

**Date:**December 1985

**Creator:**Spear, Donald W.

**Description:**The purpose of this paper is to examine properties of the mean integral. The mean integral is compared with the regular integral. If [a;b] is an interval, f is quasicontinuous on [a;b] and g has bounded variation on [a;b], then the man integral of f with respect to g exists on [a;b]. The following theorem is proved. If [a*;b*] and [a;b] each is an interval and h is a function from [a*;b*] into R, then the following two statements are equivalent: 1) If f is a function from [a;b] into [a*;b*], gi is a function from [a;b] into R with bounded variation and (m)∫^b_afdg exists then (m)∫^b_ah(f)dg exists. 2) h is continuous.

**Contributing Partner:**UNT Libraries

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

### Some Properties of Noetherian Rings

**Date:**May 1986

**Creator:**Vaughan, Stephen N. (Stephen Nick)

**Description:**This paper is an investigation of several basic properties of noetherian rings. Chapter I gives a brief introduction, statements of definitions, and statements of theorems without proof. Some of the main results in the study of noetherian rings are proved in Chapter II. These results include proofs of the equivalence of the maximal condition, the ascending chain condition, and that every ideal is finitely generated. Some other results are that if a ring R is noetherian, then R[x] is noetherian, and that if every prime ideal of a ring R is finitely generated, then R is noetherian.

**Contributing Partner:**UNT Libraries

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

### Fundamental Issues in Support Vector Machines

**Date:**May 2014

**Creator:**McWhorter, Samuel P.

**Description:**This dissertation considers certain issues in support vector machines (SVMs), including a description of their construction, aspects of certain exponential kernels used in some SVMs, and a presentation of an algorithm that computes the necessary elements of their operation with proof of convergence. In its first section, this dissertation provides a reasonably complete description of SVMs and their theoretical basis, along with a few motivating examples and counterexamples. This section may be used as an accessible, stand-alone introduction to the subject of SVMs for the advanced undergraduate. Its second section provides a proof of the positive-definiteness of a certain useful function here called E and dened as follows: Let V be a complex inner product space. Let N be a function that maps a vector from V to its norm. Let p be a real number between 0 and 2 inclusive and for any in V , let ( be N() raised to the p-th power. Finally, let a be a positive real number. Then E() is exp(()). Although the result is not new (other proofs are known but involve deep properties of stochastic processes) this proof is accessible to advanced undergraduates with a decent grasp of linear algebra. Its ...

**Contributing Partner:**UNT Libraries

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

### Maximum Likelihood Estimation of Logistic Sinusoidal Regression Models

**Date:**December 2013

**Creator:**Weng, Yu

**Description:**We consider the problem of maximum likelihood estimation of logistic sinusoidal regression models and develop some asymptotic theory including the consistency and joint rates of convergence for the maximum likelihood estimators. The key techniques build upon a synthesis of the results of Walker and Song and Li for the widely studied sinusoidal regression model and on making a connection to a result of Radchenko. Monte Carlo simulations are also presented to demonstrate the finite-sample performance of the estimators

**Contributing Partner:**UNT Libraries

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

### Polynomial Isomorphisms of Cayley Objects Over a Finite Field

**Date:**December 1989

**Creator:**Park, Hong Goo

**Description:**In this dissertation the Bays-Lambossy theorem is generalized to GF(pn). The Bays-Lambossy theorem states that if two Cayley objects each based on GF(p) are isomorphic then they are isomorphic by a multiplier map. We use this characterization to show that under certain conditions two isomorphic Cayley objects over GF(pn) must be isomorphic by a function on GF(pn) of a particular type.

**Contributing Partner:**UNT Libraries

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

### Hausdorff, Packing and Capacity Dimensions

**Date:**August 1989

**Creator:**Spear, Donald W.

**Description:**In this thesis, Hausdorff, packing and capacity dimensions are studied by evaluating sets in the Euclidean space R^. Also the lower entropy dimension is calculated for some Cantor sets. By incorporating technics of Munroe and of Saint Raymond and Tricot, outer measures are created. A Vitali covering theorem for packings is proved. Methods (by Taylor and Tricot, Kahane and Salem, and Schweiger) for determining the Hausdorff and capacity dimensions of sets using probability measures are discussed and extended. The packing pre-measure and measure are shown to be scaled after an affine transformation. A Cantor set constructed by L.D. Pitt is shown to be dimensionless using methods developed in this thesis. A Cantor set is constructed for which all four dimensions are different. Graph directed constructions (compositions of similitudes follow a path in a directed graph) used by Mauldin and Willjams are presented. Mauldin and Williams calculate the Hausdorff dimension, or, of the object of a graph directed construction and show that if the graph is strongly connected, then the a—Hausdorff measure is positive and finite. Similar results will be shown for the packing dimension and the packing measure. When the graph is strongly connected, there is a constant so that ...

**Contributing Partner:**UNT Libraries

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

### The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors

**Date:**August 1989

**Creator:**Hipp, James W. (James William), 1956-

**Description:**We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the 5-point line, the 4-wheel W_4, and the 4-whirl W^4 as minors is 6n - 5, for n ≥ 3. Examples of geometries having rank n and size 6n - 5 include parallel connections of the geometries V_19 and PG(2,3).

**Contributing Partner:**UNT Libraries

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

### Minimization of a Nonlinear Elasticity Functional Using Steepest Descent

**Date:**August 1988

**Creator:**McCabe, Terence W. (Terence William)

**Description:**The method of steepest descent is used to minimize typical functionals from elasticity.

**Contributing Partner:**UNT Libraries

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