You limited your search to:

  Partner: UNT Libraries
 Department: Department of Mathematics
 Collection: UNT Theses and Dissertations
Continuous Combinatorics of a Lattice Graph in the Cantor Space
We present a novel theorem of Borel Combinatorics that sheds light on the types of continuous functions that can be defined on the Cantor space. We specifically consider the part X=F(2ᴳ) from the Cantor space, where the group G is the additive group of integer pairs ℤ². That is, X is the set of aperiodic {0,1} labelings of the two-dimensional infinite lattice graph. We give X the Bernoulli shift action, and this action induces a graph on X in which each connected component is again a two-dimensional lattice graph. It is folklore that no continuous (indeed, Borel) function provides a two-coloring of the graph on X, despite the fact that any finite subgraph of X is bipartite. Our main result offers a much more complete analysis of continuous functions on this space. We construct a countable collection of finite graphs, each consisting of twelve "tiles", such that for any property P (such as "two-coloring") that is locally recognizable in the proper sense, a continuous function with property P exists on X if and only if a function with a corresponding property P' exists on one of the graphs in the collection. We present the theorem, and give several applications. digital.library.unt.edu/ark:/67531/metadc849680/
The Relative Complexity of Various Classification Problems among Compact Metric Spaces
In this thesis, we discuss three main projects which are related to Polish groups and their actions on standard Borel spaces. In the first part, we show that the complexity of the classification problem of continua is Borel bireducible to a universal orbit equivalence relation induce by a Polish group on a standard Borel space. In the second part, we compare the relative complexity of various types of classification problems concerning subspaces of [0,1]^n for all natural number n. In the last chapter, we give a topological characterization theorem for the class of locally compact two-sided invariant non-Archimedean Polish groups. Using this theorem, we show the non-existence of a universal group and the existence of a surjectively universal group in the class. digital.library.unt.edu/ark:/67531/metadc849626/
An Exploration of the Word2vec Algorithm: Creating a Vector Representation of a Language Vocabulary that Encodes Meaning and Usage Patterns in the Vector Space Structure
This thesis is an exloration and exposition of a highly efficient shallow neural network algorithm called word2vec, which was developed by T. Mikolov et al. in order to create vector representations of a language vocabulary such that information about the meaning and usage of the vocabulary words is encoded in the vector space structure. Chapter 1 introduces natural language processing, vector representations of language vocabularies, and the word2vec algorithm. Chapter 2 reviews the basic mathematical theory of deterministic convex optimization. Chapter 3 provides background on some concepts from computer science that are used in the word2vec algorithm: Huffman trees, neural networks, and binary cross-entropy. Chapter 4 provides a detailed discussion of the word2vec algorithm itself and includes a discussion of continuous bag of words, skip-gram, hierarchical softmax, and negative sampling. Finally, Chapter 5 explores some applications of vector representations: word categorization, analogy completion, and language translation assistance. digital.library.unt.edu/ark:/67531/metadc849728/
Reduced Ideals and Periodic Sequences in Pure Cubic Fields
The “infrastructure” of quadratic fields is a body of theory developed by Dan Shanks, Richard Mollin and others, in which they relate “reduced ideals” in the rings and sub-rings of integers in quadratic fields with periodicity in continued fraction expansions of quadratic numbers. In this thesis, we develop cubic analogs for several infrastructure theorems. We work in the field K=Q(), where 3=m for some square-free integer m, not congruent to ±1, modulo 9. First, we generalize the definition of a reduced ideal so that it applies to K, or to any number field. Then we show that K has only finitely many reduced ideals, and provide an algorithm for listing them. Next, we define a sequence based on the number alpha that is periodic and corresponds to the finite set of reduced principal ideals in K. Using this rudimentary infrastructure, we are able to establish results about fundamental units and reduced ideals for some classes of pure cubic fields. We also introduce an application to Diophantine approximation, in which we present a 2-dimensional analog of the Lagrange value of a badly approximable number, and calculate some examples. digital.library.unt.edu/ark:/67531/metadc804842/
Trees and Ordinal Indices in C(k) Spaces for K Countable Compact
In the dissertation we study the C(K) spaces focusing on the case when K is countable compact and more specifically, the structure of C() spaces for < ω1 via special type of trees that they contain. The dissertation is composed of three major sections. In the first section we give a detailed proof of the theorem of Bessaga and Pelczynski on the isomorphic classification of C() spaces. In due time, we describe the standard bases for C(ω) and prove that the bases are monotone. In the second section we consider the lattice-trees introduced by Bourgain, Rosenthal and Schechtman in C() spaces, and define rerooting and restriction of trees. The last section is devoted to the main results. We give some lower estimates of the ordinal-indices in C(ω). We prove that if the tree in C(ω) has large order with small constant then each function in the root must have infinitely many big coordinates. Along the way we deduce some upper estimates for c0 and C(ω), and give a simple proof of Cambern's result that the Banach-Mazur distance between c0 and c = C(ω) is equal to 3. digital.library.unt.edu/ark:/67531/metadc804883/
Restricting Invariants and Arrangements of Finite Complex Reflection Groups
Suppose that G is a finite, unitary reflection group acting on a complex vector space V and X is a subspace of V. Define N to be the setwise stabilizer of X in G, Z to be the pointwise stabilizer, and C=N/Z. Then restriction defines a homomorphism from the algebra of G-invariant polynomial functions on V to the algebra of C-invariant functions on X. In my thesis, I extend earlier work by Douglass and Röhrle for Coxeter groups to the case where G is a complex reflection group of type G(r,p,n) in the notation of Shephard and Todd and X is in the lattice of the reflection arrangement of G. The main result characterizes when the restriction mapping is surjective in terms of the exponents of G and C and their reflection arrangements. digital.library.unt.edu/ark:/67531/metadc804919/
Contributions to Descriptive Set Theory
In this dissertation we study closure properties of pointclasses, scales on sets of reals and the models L[T2n], which are very natural canonical inner models of ZFC. We first characterize projective-like hierarchies by their associated ordinals. This solves a conjecture of Steel and a conjecture of Kechris, Solovay, and Steel. The solution to the first conjecture allows us in particular to reprove a strong partition property result on the ordinal of a Steel pointclass and derive a new boundedness principle which could be useful in the study of the cardinal structure of L(R). We then develop new methods which produce lightface scales on certain sets of reals. The methods are inspired by Jackson’s proof of the Kechris-Martin theorem. We then generalize the Kechris-Martin Theorem to all the Π12n+1 pointclasses using Jackson’s theory of descriptions. This in turns allows us to characterize the sets of reals of a certain initial segment of the models L[T2n]. We then use this characterization and the generalization of Kechris-Martin theorem to show that the L[T2n] are unique. This generalizes previous work of Hjorth. We then characterize the L[T2n] in term of inner models theory, showing that they actually are constructible models over direct limit of mice with Woodin cardinals, a counterpart to Steel’s result that the L[T2n+1] are extender models, and finally show that the generalized contiuum hypothesis holds in these models, solving a conjecture of Woodin. digital.library.unt.edu/ark:/67531/metadc804953/
Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation
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 of interest are rectangular mixed domains. A new type of conditions is introduced. Ladder conditions take the uncommon approach of specifying information on the interior of a mixed domain. Specifically, function values are specified on the parabolic portion of a mixed domain. The remaining conditions are specified on the boundary. A conjecture is posed and states that ladder conditions are necessary and sufficient for existence and uniqueness of a solution to the Tricomi equation. Numerical experiments, produced by application of the descent method, provide strong evidence in support of the conjecture. Ladder conditions allow for a continuous deformation from Dirichlet conditions to initial-boundary value conditions. Such a deformation is applied to a class of Tricomi-type equations which transition from degenerate elliptic to degenerate hyperbolic. A conjecture is posed and states that each problem is uniquely solvable and the solutions vary continuously as the differential equation and corresponding conditions vary continuously. If the conjecture holds true, the result will provide a method of unifying elliptic Dirichlet problems and hyperbolic initial-boundary value problem. Numerical evidence in support of the conjecture is presented. digital.library.unt.edu/ark:/67531/metadc699977/
Hermitian Jacobi Forms and Congruences
In this thesis, we introduce a new space of Hermitian Jacobi forms, and we determine its structure. As an application, we study heat cycles of Hermitian Jacobi forms, and we establish a criterion for the existence of U(p) congruences of Hermitian Jacobi forms. We demonstrate that criterion with some explicit examples. Finally, in the appendix we give tables of Fourier series coefficients of several Hermitian Jacobi forms. digital.library.unt.edu/ark:/67531/metadc700083/
A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil
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. digital.library.unt.edu/ark:/67531/metadc699611/
Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools
"To discuss the effect all this war activity has had upon the Dallas Schools and to voice a protest against those who seek to discredit mathematics and at the same time to contribute a readable thesis upon the subject is largely the purpose of this study." --leaf 2 digital.library.unt.edu/ark:/67531/metadc699532/
Absolute Continuity and the Integration of Bounded Set Functions
The first chapter gives basic definitions and theorems concerning set functions and set function integrals. The lemmas and theorems are presented without proof in this chapter. The second chapter deals with absolute continuity and Lipschitz condition. Particular emphasis is placed on the properties of max and min integrals. The third chapter deals with approximating absolutely continuous functions with bounded functions. It also deals with the existence of the integrals composed of various combinations of bounded functions and finitely additive functions. The concluding theorem states if the integral of the product of a bounded function and a non-negative finitely additive function exists, then the integral of the product of the bounded function with an absolutely continuous function exists over any element in a field of subsets of a set U. digital.library.unt.edu/ark:/67531/metadc663440/
A Partial Characterization of Upper Semi-Continuous Decompositions
The goal of this paper is to characterize, at least partially, upper semi-continuous decompositions of topological spaces and the role that upper semi-continuity plays in preserving certain topological properties under decomposition mappings. Attention is also given to establishing what role upper semi-continuity plays in determining conditions under which decomposition spaces possess certain properties. A number of results for non-upper semi-continuous decompositions are included to help clarify the scope of the part upper semi-continuity plays in determining relationships between topological spaces and their decomposition spaces. digital.library.unt.edu/ark:/67531/metadc663520/
Proofs of Some Limit Theorems in Probability
This study gives detailed proofs of some limit theorems in probability which are important in theoretical and applied probability, The general introduction contains definitions and theorems that are basic tools of the later development. Included in this first chapter is material concerning normal distributions and characteristic functions, The second chapter introduces lower and upper bounds of the ratio of the binomial distribution to the normal distribution., Then these bound are used to prove the local Deioivre-Laplace limit theorem. The third chapter includes proofs of the central limit theorems for identically distributed and non-identically distributed random variables, digital.library.unt.edu/ark:/67531/metadc663330/
Valuations and Valuation Rings
This paper is an investigation of several basic properties of ordered Abelian groups, valuations, the relationship between valuation rings, valuations, and their value groups and valuation rings. The proofs to all theorems stated without proof can be found in Zariski and Samuel, Commutative Algebra, Vol. I, 1858. In Chapter I several basic theorems which are used in later proofs are stated without proof, and we prove several theorems on the structure of ordered Abelian groups, and the basic relationships between these groups, valuations, and their valuation rings in a field. In Chapter II we deal with valuation rings, and relate the structure of valuation rings to the structure of their value groups. digital.library.unt.edu/ark:/67531/metadc663650/
Linear Operators
This paper is a study of linear operators defined on normed linear spaces. A basic knowledge of set theory and vector spaces is assumed, and all spaces considered have real vector spaces. The first chapter is a general introduction that contains assumed definitions and theorems. Included in this chapter is material concerning linear functionals, continuity, and boundedness. The second chapter contains the proofs of three fundamental theorems of linear analysis: the Open Mapping Theorem, the Hahn-Banach Theorem, and the Uniform Boundedness Principle. The third chapter is concerned with applying some of the results established in earlier chapters. In particular, the concepts of compact operators and Schauder bases are introduced, and a proof that an operator is compact if and only if its adjoint is compact is included. This chapter concludes with a proof of an important application of the Open Mapping Theorem, namely, the Closed Graph Theorem. digital.library.unt.edu/ark:/67531/metadc663614/
Equivalent Sets and Cardinal Numbers
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 Bernstein Theorem is studied and three different proofs of it are given. In Chapter III, the concept of cardinal number is introduced by means of two axioms of A. Tarski, and some fundamental theorems on cardinal arithmetic are proved. digital.library.unt.edu/ark:/67531/metadc663009/
The Use of Chebyshev Polynomials in Numerical Analysis
The purpose of this paper is to investigate the nature and practical uses of Chebyshev polynomials. Chapter I gives recognition to mathematicians responsible for studies in this area. Chapter II enumerates several mathematical situations in which the polynomials naturally arise and suggests reasons for the pursuance of their study. Chapter III includes: Chebyshev polynomials as related to "best" polynomial approximation, Chebyshev series, and methods of producing polynomial approximations to continuous functions. Chapter IV discusses the use of Chebyshev polynomials to solve certain differential equations and Chebyshev-Gauss quadrature. digital.library.unt.edu/ark:/67531/metadc663496/
Inverse Limit Spaces
Inverse systems, inverse limit spaces, and bonding maps are defined. An investigation of the properties that an inverse limit space inherits, depending on the conditions placed on the factor spaces and bonding maps is made. Conditions necessary to ensure that the inverse limit space is compact, connected, locally connected, and semi-locally connected are examined. A mapping from one inverse system to another is defined and the nature of the function between the respective inverse limits, induced by this mapping, is investigated. Certain restrictions guarantee that the induced function is continuous, onto, monotone, periodic, or open. It is also shown that any compact metric space is the continuous image of the cantor set. Finally, any compact Hausdorff space is characterized as the inverse limit of an inverse system of polyhedra. digital.library.unt.edu/ark:/67531/metadc663483/
Properties of Some Classical Integral Domains
Greatest common divisor domains, Bezout domains, valuation rings, and Prüfer domains are studied. Chapter One gives a brief introduction, statements of definitions, and statements of theorems without proof. In Chapter Two theorems about greatest common divisor domains and characterizations of Bezout domains, valuation rings, and Prüfer domains are proved. Also included are characterizations of a flat overring. Some of the results are that an integral domain is a Prüfer domain if and only if every overring is flat and that every overring of a Prüfer domain is a Prüfer domain. digital.library.unt.edu/ark:/67531/metadc663731/
Chebyshev Subsets in Smooth Normed Linear Spaces
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 norm in spaces of finite dimension. In the third chapter it is shown that every reflexive normed linear space having a uniformly Gateaux differentiable norm has the property that every weakly closed Chebyshev subset, with non-empty weak interior that is norm-wise dense in the subset, is convex. digital.library.unt.edu/ark:/67531/metadc663499/
Topics in Category Theory
The purpose of this paper is to examine some basic topics in category theory. A category consists of a class of mathematical objects along with a morphism class having an associative composition. The paper is divided into two chapters. Chapter I deals with intrinsic properties of categories. Various "sub-objects" and properties of morphisms are defined and examples are given. Chapter II deals with morphisms between categories called functors and the natural transformations between functors. Special types of functors are defined and examples are given. digital.library.unt.edu/ark:/67531/metadc663720/
Spaces of Closed Subsets of a Topological Space
The purpose of this paper is to examine selected topologies, the Vietoris topology in particular, on S(X), the collection of nonempty, closed subsets of a topological space X. Characteristics of open and closed subsets of S(X), with the Vietoris topology, are noted. The relationships between the space X and the space S(X), with the Vietoris topology, concerning the properties of countability, compactness, and connectedness and the separation properties are investigated. Additional topologies are defined on S(X), and each is compared to the Vietoris topology on S(X). Finally, topological convergence of nets of subsets of X is considered. It is found that topological convergence induces a topology on S(X), and that this topology is the Vietoris topology on S(X) when X is a compact, Hausdorff space. digital.library.unt.edu/ark:/67531/metadc663365/
Wiener's Approximation Theorem for Locally Compact Abelian Groups
This study of classical and modern harmonic analysis extends the classical Wiener's approximation theorem to locally compact abelian groups. The first chapter deals with harmonic analysis on the n-dimensional Euclidean space. Included in this chapter are some properties of functions in L1(Rn) and T1(Rn), the Wiener-Levy theorem, and Wiener's approximation theorem. The second chapter introduces the notion of standard function algebra, cospectrum, and Wiener algebra. An abstract form of Wiener's approximation theorem and its generalization is obtained. The third chapter introduces the dual group of a locally compact abelian group, defines the Fourier transform of functions in L1(G), and establishes several properties of functions in L1(G) and T1(G). Wiener's approximation theorem and its generalization for L1(G) is established. digital.library.unt.edu/ark:/67531/metadc663188/
Topologies on Complete Lattices
One of the more important concepts in mathematics is the concept of order, that is, the description or comparison of two elements of a set in terms of one preceding or being smaller than or equal to the other. If the elements of a set, as pairs, exhibit certain order-type characteristics, the set is said to be a partially ordered set. The purpose of this paper is to investigate a special class of partially ordered sets, called lattices, and to investigate topologies induced on these lattices by specially defined order related properties called order-convergence and star-convergence. digital.library.unt.edu/ark:/67531/metadc663129/
Euclidean Rings
The cardinality of the set of units, and of the set of equivalence classes of primes in non-trivial Euclidean domains is discussed with reference to the categories "finite" and "infinite." It is shown that no Euclidean domains exist for which both of these sets are finite. The other three combinations are possible and examples are given. For the more general Euclidean rings, the first combination is possible and examples are likewise given. Prime factorization is also discussed in both Euclidean rings and Euclidean domains. For Euclidean rings, an alternative definition of prime elements in terms of associates is compared and contrasted to the usual definitions. digital.library.unt.edu/ark:/67531/metadc663654/
Duals and Weak Completeness in Certain Sequence Spaces
In this paper the weak completeness of certain sequence spaces is examined. In particular, we show that each of the sequence spaces c0 and 9, 1 < p < c, is a Banach space. A Riesz representation for the dual space of each of these sequence spaces is given. A Riesz representation theorem for Hilbert space is also proven. In the third chapter we conclude that any reflexive space is weakly (sequentially) complete. We give 01 as an example of a non-reflexive space that is weakly complete. Two examples, c0 and YJ, are given of spaces that fail to be weakly complete. digital.library.unt.edu/ark:/67531/metadc504338/
Interpolation and Approximation
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. digital.library.unt.edu/ark:/67531/metadc504571/
Complete Ordered Fields
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. digital.library.unt.edu/ark:/67531/metadc504449/
The Wallman Spaces and Compactifications
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. digital.library.unt.edu/ark:/67531/metadc504392/
Valuations on Fields
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. digital.library.unt.edu/ark:/67531/metadc504040/
Subdirectly Irreducible Semigroups
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. digital.library.unt.edu/ark:/67531/metadc504365/
Integrability, Measurability, and Summability of Certain Set Functions
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. digital.library.unt.edu/ark:/67531/metadc504032/
Hyperspaces
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. digital.library.unt.edu/ark:/67531/metadc503983/
Fundamental Issues in Support Vector Machines
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 final section presents an algorithm by Dr. Kallman (preprint), based on earlier Russian work by B.F. Mitchell, V.F Demyanov, and V.N. Malozemov, and proves its convergence. The section also discusses briefly architectural features of the algorithm expected to result in practical speed increases. digital.library.unt.edu/ark:/67531/metadc500155/
Maximum Likelihood Estimation of Logistic Sinusoidal Regression Models
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 digital.library.unt.edu/ark:/67531/metadc407796/
Polynomial Isomorphisms of Cayley Objects Over a Finite Field
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. digital.library.unt.edu/ark:/67531/metadc331144/
Hausdorff, Packing and Capacity Dimensions
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 the constant times the Hausdorff measure is greater than or equal to the packing measure when a subset of the realization is evaluated. Self—affine Sierpinski carpets, which have been analyzed by McMullen with respect to their Hausdorff dimension and capacity dimension, are analyzed with respect to their packing dimension. Conditions under which the Hausdorff measure of the construction object is positive and finite are given. digital.library.unt.edu/ark:/67531/metadc330990/
The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as Minors
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). digital.library.unt.edu/ark:/67531/metadc330849/
Minimization of a Nonlinear Elasticity Functional Using Steepest Descent
The method of steepest descent is used to minimize typical functionals from elasticity. digital.library.unt.edu/ark:/67531/metadc331296/
Bounded, Finitely Additive, but Not Absolutely Continuous Set Functions
In leading up to the proof, methods for constructing fields and finitely additive set functions are introduced with an application involving the Tagaki function given as an example. Also, non-absolutely continuous set functions are constructed using Banach limits and maximal filters. digital.library.unt.edu/ark:/67531/metadc332375/
Applications of Graph Theory and Topology to Combinatorial Designs
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 when the graph has a 1-factor. It is not hard to see that the graph is connected and of even order. Tutte's theorem shows that if the graph is 2-connected and regular of degree three, then the graph has a 1-factor. By using the concept of quadratic reciprocity, this paper shows that if p Ξ 53 or 77 (mod 120), the graph is almost regular of degree three, i.e., every vertex has degree three, except two vertices each have degree tow. Adding an extra edge joining the two vertices with degree tow gives a regular graph of degree three. Also, Tutte proved that if A is an edge of the graph satisfying the above conditions, then it must have a 1-factor which contains A. The second part of the dissertation is concerned with determining if two designs are isomorphic. Here the v-set is any group G and translation by any element in G gives a design automorphism. Given a design B and its difference family D, two topological spaces, B and D, are constructed. We give topological conditions which imply that a design isomorphism is a group isomorphism. digital.library.unt.edu/ark:/67531/metadc331968/
Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension
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 formula is given that counts the number of MSS sequences of length n. Next, the number of distinct primitive colorings of n beads with two colors, as counted by Gilbert and Riordan, is shown to equal the number of MSS sequences of length n. An algorithm is given that produces a bisection between these two quantities for each n. Lastly, the number of negative orbits of size n for the function f(z)=z^2-2, as counted by P.J. Myrberg, is shown to equal the number of MSS sequences of length n. For an MSS sequence P, let H_ϖ(P) be the unique common extension of the harmonics of P. In Chapter three it is proved that there is exactly one J(P)Σ[0,1] such that the itinerary of λ(P) under the map is λ(P)f_e is H_ϖ(P). In Chapter four it is shown that only period doubling or period halving bifurcations can occur for the family λf_e, λΣ[0,1]. Results concerning how the size of a stable orbit changes as bifurcations of the family λf_e occur are given. Let λΣ[0,1] be such that 1/2 is a periodic point of λf_e. In this case 1/2 is superstable. Chapter five investigates the boundary of the basin of attraction of this stable orbit. An algorithm is given that yields a graph directed construction such that the object constructed is the basin boundary. From this we analyze the Hausdorff dimension and measure in that dimension of the boundary. The dimension is related to the simple β-numbers, as defined by Parry. digital.library.unt.edu/ark:/67531/metadc332102/
Operators on Continuous Function Spaces and Weak Precompactness
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 operator on C(H,X) with representing measure m, then m(A) is a weakly compact operator for every Borel set A. Furthermore, m is strongly bounded. Analogous statements may be made for many interesting classes of operators. In chapter III, two classes of operators, weakly precompact and QSP, are studied. Examples are provided to show that if T is weakly precompact (QSP) then m(A) need not be weakly precompact (QSP), for every Borel set A. In addition, it will be shown that weakly precompact and GSP operators need not have strongly bounded representing measures. Sufficient conditions are provided which guarantee that a weakly precompact (QSP) operator has weakly precompact (QSP) values. A sufficient condition for a weakly precomact operator to be strongly bounded is given. In chapter IV, weakly precompact subsets of L1(μ,X) are examined. For a Banach space X whose dual has the Radon-Nikodym property, it is shown that the weakly precompact subsets of L1(μ,X) are exactly the uniformly integrable subsets of L1(μ,X). Furthermore, it is shown that this characterization does not hold in Banach spaces X for which X* does not have the weak Radon-Nikodym property. digital.library.unt.edu/ark:/67531/metadc331171/
Existence of a Solution for a Wave Equation and an Elliptic Dirichlet Problem
In this paper we consider an existence of a solution for a nonlinear nonmonotone wave equation in [0,π]xR and an existence of a positive solution for a non-positone Dirichlet problem in a bounded subset of R^n. digital.library.unt.edu/ark:/67531/metadc331780/
Dually Semimodular Consistent Lattices
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 number of elements covering exactly k elements is equal to the number of elements covered by exactly k elements. Here, it is established that if a finite dually semimodular consistent lattice has the same number of join-irreducibles as meet-irreducibles, then it is modular. Hence, a converse of Dilworth's theorem, in the case when k equals 1, is obtained for finite dually semimodular consistent lattices. Several combinatorial results are shown for finite consistent lattices similar to those already established for finite geometric lattices. The reach of an element x in a lattice L is the difference between the rank of x*, the join of x and all the elements covering x, and the rank of x; the maximum reach of all elements in L is the reach of L. Sharp lower bounds for the total number of elements and the number of elements of a given reach in a semimodular consistent lattice given the rank, the reach, and the number of join-irreducibles are found. Extremal lattices attaining these bounds are described. Similar results are then obtained for finite dually semimodular consistent lattices. digital.library.unt.edu/ark:/67531/metadc330641/
Invertible Ideals and the Strong Two-Generator Property in Some Polynomial Subrings
Let K be any field and Q be the rationals. Define K^1[X] = {f(X) e K[X]| the coefficient of X in f(X) is zero} and Q^1β[X] = {f(X) e Q[X]| the coefficent of β1(X) in the binomial expansion of f(X) is zero}, where {β1(X)}^∞ i=0 are the well-known binomial polynomials. In this work, I establish the following results: K^1[X] and Q^1β[X] are one-dimensional, Noetherian, non-Prüfer domains with the two-generator property on ideals. Using the unique factorization structure of the overrings K[X] and Q[X], the nonprincipal ideal structures of both rings are characterized, and from this characterization, necessary and sufficient conditions are found for a nonprincipal ideal to be invertible. The nonprincipal invertible ideals are then characterized in terms of the coefficients of the generators, and an explicit formula for the inverse of any proper invertible ideal is found. Finally, the class groups of both rings are shown to be torsion free abelian groups. Let n be any nonnegative integer. Results similar to the above are found in the generalizations of these two rings, K^n[X] and q^nβ[X], where the coefficients on the first n nonconstant basis elements are zero. For the domains K^1[X] and Q^1β[X], the property of strong two-generation is explored in detail and the following results are established: 1. K^1[X] and Q^1β[X] are not strongly two-generated, 2. In either ring, any polynomial with a constant term, or of degree two or three is a strong two-generator. 3. In K^1[X] any polynomial divisible by X^4 is not a strong two-generator, 4. An ideal I in K^1[X] or Q^1β[X] is strongly two-generated if and only if it is invertible. digital.library.unt.edu/ark:/67531/metadc331673/
Containment Relations Between Classes of Regular Ideals in a Ring with Few Zero Divisors
This dissertation focuses on the significance of containment relations between the above mentioned classes of ideals. The main problem considered in Chapter II is determining conditions which lead a ring to be a P-ring, D-ring, or AM-ring when every regular ideal is a P-ideal, D-ideal, or AM-ideal, respectively. We also consider containment relations between classes of regular ideals which guarantee that the ring is a quasi-valuation ring. We continue this study into the third chapter; in particular, we look at the conditions in a quasi-valuation ring which lead to a = Jr, sr - f, and a = v. Furthermore we give necessary and sufficient conditions that a ring be a discrete rank one quasi-valuation ring. For example, if R is Noetherian, then ft = J if and only if R is a discrete rank one quasi-valuation ring. digital.library.unt.edu/ark:/67531/metadc331394/
Weakly Dense Subsets of Homogeneous Complete Boolean Algebras
The primary result from this dissertation is following inequality: d(B) ≤ min(2^< wd(B),sup{λ^c(B): λ < wd(B)}) in ZFC, where B is a homogeneous complete Boolean algebra, d(B) is the density, wd(B) is the weak density, and c(B) is the cellularity of B. Chapter II of this dissertation is a general overview of homogeneous complete Boolean algebras. Assuming the existence of a weakly inaccessible cardinal, we give an example of a homogeneous complete Boolean algebra which does not attain its cellularity. In chapter III, we prove that for any integer n > 1, wd_2(B) = wd_n(B). Also in this chapter, we show that if X⊂B is κ—weakly dense for 1 < κ < sat(B), then sup{wd_κ(B):κ < sat(B)} = d(B). In chapter IV, we address the following question: If X is weakly dense in a homogeneous complete Boolean algebra B, does there necessarily exist b € B\{0} such that {x∗b: x ∈ X} is dense in B|b = {c € B: c ≤ b}? We show that the answer is no for collapsing algebras. In chapter V, we give new proofs to some well known results concerning supporting antichains. A direct consequence of these results is the relation c(B) < wd(B), i.e., the weak density of a homogeneous complete Boolean algebra B is at least as big as the cellularity. Also in this chapter, we introduce discernible sets. We prove that a discernible set of cardinality no greater than c(B) cannot be weakly dense. In chapter VI, we prove the main result of this dissertation, i.e., d(B) ≤ min(2^< wd(B),sup{λ^c(B): λ < wd(B)}). In chapter VII, we list some unsolved problems concerning this dissertation. digital.library.unt.edu/ark:/67531/metadc330803/
Radially Symmetric Solutions to a Superlinear Dirichlet Problem in a Ball
In this paper we consider a radially symmetric nonlinear Dirichlet problem in a ball, where the nonlinearity is "superlinear" and "superlinear with jumping." digital.library.unt.edu/ark:/67531/metadc330725/
FIRST PREV 1 2 3 4 5 NEXT LAST