Latest content added for UNT Digital Library Collection: UNT Theses and Dissertationshttp://digital.library.unt.edu/explore/collections/UNTETD/browse/?fq=str_degree_discipline:Mathematics2016-03-20T10:34:12-05:00UNT LibrariesThis is a custom feed for browsing UNT Digital Library Collection: UNT Theses and DissertationsOptimal Strategies for Stopping Near the Top of a Sequence2016-03-20T10:34:12-05:00http://digital.library.unt.edu/ark:/67531/metadc822812/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc822812/"><img alt="Optimal Strategies for Stopping Near the Top of a Sequence" title="Optimal Strategies for Stopping Near the Top of a Sequence" src="http://digital.library.unt.edu/ark:/67531/metadc822812/thumbnail/"/></a></p><p>In Chapter 1 the classical secretary problem is introduced. Chapters 2 and 3 are variations of this problem. Chapter 2, discusses the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter p and finite time horizon n. The optimal strategy (continue or stop) depends on a sequence of threshold values (critical probabilities) which has an oscillating pattern. Several properties of this sequence have been proved by Dr. Allaart. Further properties have been recently proved. In Chapter 3, a gambler will observe a finite sequence of continuous random variables. After he observes a value he must decide to stop or continue taking observations. He can play two different games A) Win at the maximum or B) Win within a proportion of the maximum. In the first section the sequence to be observed is independent. It is shown that for each n>1, theoptimal win probability in game A is bounded below by (1-1/n)^{n-1}. It is accomplished by reducing the problem to that of choosing the maximum of a special sequence of two-valued random variables and applying the sum-the-odds theorem of Bruss (2000). Secondly, it is assumed the sequence is i.i.d. The best lower bounds are provided for the winning probabilities in game B given any continuous distribution. These bounds are the optimal win probabilities of a game A which was examined by Gilbert and Mosteller (1966).</p>Reduced Ideals and Periodic Sequences in Pure Cubic Fields2016-03-04T16:14:01-06:00http://digital.library.unt.edu/ark:/67531/metadc804842/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc804842/"><img alt="Reduced Ideals and Periodic Sequences in Pure Cubic Fields" title="Reduced Ideals and Periodic Sequences in Pure Cubic Fields" src="http://digital.library.unt.edu/ark:/67531/metadc804842/thumbnail/"/></a></p><p>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.</p>Trees and Ordinal Indices in C(k) Spaces for K Countable Compact2016-03-04T16:14:01-06:00http://digital.library.unt.edu/ark:/67531/metadc804883/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc804883/"><img alt="Trees and Ordinal Indices in C(k) Spaces for K Countable Compact" title="Trees and Ordinal Indices in C(k) Spaces for K Countable Compact" src="http://digital.library.unt.edu/ark:/67531/metadc804883/thumbnail/"/></a></p><p>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.</p>Restricting Invariants and Arrangements of Finite Complex Reflection Groups2016-03-04T16:14:01-06:00http://digital.library.unt.edu/ark:/67531/metadc804919/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc804919/"><img alt="Restricting Invariants and Arrangements of Finite Complex Reflection Groups" title="Restricting Invariants and Arrangements of Finite Complex Reflection Groups" src="http://digital.library.unt.edu/ark:/67531/metadc804919/thumbnail/"/></a></p><p>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.</p>Contributions to Descriptive Set Theory2016-03-04T16:14:01-06:00http://digital.library.unt.edu/ark:/67531/metadc804953/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc804953/"><img alt="Contributions to Descriptive Set Theory" title="Contributions to Descriptive Set Theory" src="http://digital.library.unt.edu/ark:/67531/metadc804953/thumbnail/"/></a></p><p>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.</p>Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation2015-08-21T05:42:39-05:00http://digital.library.unt.edu/ark:/67531/metadc699977/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc699977/"><img alt="Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation" title="Condition-dependent Hilbert Spaces for Steepest Descent and Application to the Tricomi Equation" src="http://digital.library.unt.edu/ark:/67531/metadc699977/thumbnail/"/></a></p><p>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.</p>Hermitian Jacobi Forms and Congruences2015-08-21T05:42:39-05:00http://digital.library.unt.edu/ark:/67531/metadc700083/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc700083/"><img alt="Hermitian Jacobi Forms and Congruences" title="Hermitian Jacobi Forms and Congruences" src="http://digital.library.unt.edu/ark:/67531/metadc700083/thumbnail/"/></a></p><p>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.</p>A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil2015-08-15T22:32:30-05:00http://digital.library.unt.edu/ark:/67531/metadc699611/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc699611/"><img alt="A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil" title="A Comparison of Velocities Computed by Two-Dimensional Potential Theory and Velocities Measured in the Vicinity of an Airfoil" src="http://digital.library.unt.edu/ark:/67531/metadc699611/thumbnail/"/></a></p><p>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.</p>Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools2015-08-15T22:32:30-05:00http://digital.library.unt.edu/ark:/67531/metadc699532/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc699532/"><img alt="Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools" title="Some Effects of the War Upon the Mathematics Curriculum and the Motivating Forces at Work as Reflected in the Dallas City Schools" src="http://digital.library.unt.edu/ark:/67531/metadc699532/thumbnail/"/></a></p><p>"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</p>Fundamental Issues in Support Vector Machines2015-03-08T17:44:37-05:00http://digital.library.unt.edu/ark:/67531/metadc500155/<p><a href="http://digital.library.unt.edu/ark:/67531/metadc500155/"><img alt="Fundamental Issues in Support Vector Machines" title="Fundamental Issues in Support Vector Machines" src="http://digital.library.unt.edu/ark:/67531/metadc500155/thumbnail/"/></a></p><p>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.</p>