Search Results

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
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.
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.
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.
Iterative Solution of Linear Boundary Value Problems
The investigation is initially a continuation of Neuberger's work on linear boundary value problems. A very general iterative procedure for solution of these problems is described. The alternating-projection theorem of von Neumann is the mathematical starting point for this study. Later theorems demonstrate the validity of numerical approximation for Neuberger's method under certain conditions. A sampling of differential equations within the scope of our iterative method is given. The numerical evidence is that the procedure works well on neutral-state equations, for which no software is written now.
Universally Measurable Sets And Nonisomorphic Subalgebras
This dissertation is divided into two parts. The first part addresses the following problem: Suppose 𝑣 is a finitely additive probability measure defined on the power set 𝒜 of the integer Z so that each singleton set gets measure zero. Let X be a product space Π/β∈B * Zᵦ where each Zₐ is a copy of the integers. Let 𝒜ᴮ be the algebra of subsets of X generated by the subproducts Π/β∈B * Cᵦ where for all but finitely many β, Cᵦ = Zᵦ. Let 𝑣_B denote the product measure on 𝒜ᴮ which has each factor measure a copy of 𝑣. A subset E of X is said to be 𝑣_B -measurable iff [sic] there is only one finitely additive probability on the algebra generated by 𝒜ᴮ ∪ [E] which extends 𝑣_B. The set E ⊆ X is said to be universally product measurable (u.p.m.) iff [sic] for each finitely additive probability measure μ on 𝒜 which gives each singleton measure zero,E is μ_B -measurable. Two theorems are proved along with generalizations. The second part of this dissertation gives a proof of the following theorem and some generalizations: There are 2ᶜ nonisomorphic subalgebras of the power set algebra of the integers (where c = power of the continuum).
Back to Top of Screen