Degree Level

Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux (open access)

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

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
Date: August 1983
Creator: Sutherland, David C. (David Craig)
System: The UNT Digital Library
Axiom of Choice Equivalences and Some Applications (open access)

Axiom of Choice Equivalences and Some Applications

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.
Date: August 1983
Creator: Race, Denise T. (Denise Tatsch)
System: The UNT Digital Library
Convergence of Infinite Series (open access)

Convergence of Infinite Series

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.
Date: August 1983
Creator: Abbott, Catherine Ann
System: The UNT Digital Library
Product Measure (open access)

Product Measure

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.
Date: August 1983
Creator: Race, David M. (David Michael)
System: The UNT Digital Library