In this paper we give a characterization theorem for the reciprocal Dunford-Pettis property as defined by Grothendieck. The relationship of this property to Pelczynski's property V is examined. In particular it is shown that every Banach space with property V has the reciprocal Dunford-Pettis property and an example is given to show that the converse fails to hold. Moreover the characterizations of property V and the reciprocal Dunford-Pettis property lead to the definitions of property V* and property RDP* respectively. Me compare and contrast results for the reciprocal Dunford-Pettis property and property RDP* with those for properties V and V*. In the final chapter we use a result of Brooks to obtain a characterization for the Radon-Nikodým property.

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

This paper develops a numerical algorithm that produces finite element solutions for a broad class of partial differential equations. The method is based on steepest descent methods in the Sobolev space H¹(Ω). Although the method may be applied in more general settings, we consider only differential equations that may be written as a first order quasi-linear system. The method is developed in a Hilbert space setting where strong convergence is established for part of the iteration. We also prove convergence for an inner iteration in the finite element setting. The method is demonstrated on Burger's equation and the Navier-Stokes equations as applied to the square cavity flow problem. Numerical evidence suggests that the accuracy of the method is second order,. A documented listing of the FORTRAN code for the Navier-Stokes equations is included.

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 …

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.

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 …

In this paper we consider a radially symmetric nonlinear Dirichlet problem in a ball, where the nonlinearity is "superlinear" and "superlinear with jumping."

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 …

In this dissertation, we describe the automorphism groups for the strong Bruhat orders A_n-1, B_n, and D_n. In particular, the automorphism group of A_n-1 for n ≥ 3 is isomorphic to the dihedral group of order eight, D_4; the automorphism group of B_n for n ≥ 3 is isomorphic to C_2 x C_2 where C_2 is the cyclic group of order two; the automorphism group of D_n for n > 5 and n even is isomorphic to C_2 x C_2 x C_2; and the automorphism group of D_n for n ≥ 5 and n odd is isomorphic to the dihedral group D_4.

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).

This dissertation explores geometric measure theory; the first part explores a question posed by Paul Erdös -- Is there a number c > 0 such that if E is a Lebesgue measurable subset of the plane with λ²(E) (planar measure)> c, then E contains the vertices of a triangle with area equal to one? -- other related geometric questions that arise from the topic. In the second part, "we parametrize the theorems from general topology characterizing the continuous images and the homeomorphic images of the Cantor set, C" (abstract, para. 5).

The purpose of this paper is to develop a general method for using Finite Elements in the Steepest Descent Method. The main application is to a partial differential equation for a Transonic Flow Problem. It is also applied to Burger's equation, Laplace's equation and the minimal surface equation. The entire method is tested by computer runs which give satisfactory results. The validity of certain of the procedures used are proved theoretically. The way that the writer handles finite elements is quite different from traditional finite element methods. The variational principle is not needed. The theory is based upon the calculation of a matrix representation of operators in the gradient of a certain functional. Systematic use is made of local interpolation functions.

This paper examines several questions regarding Banach spaces, completeness and compactness of Banach spaces, dual spaces and weak and weak* topologies. Examples of completeness and isometries are given using the c₀ and 𝓁ᴰ spaces. The Hahn-Banach extension theorem is presented, along with some applications. General theory about finite and infinite dimensional normed linear spaces is the bulk of the second chapter. A proof of the uniform boundedness principle is also given. Chapter three talks in detail about dual spaces and weak and weak* topologies. An embedding proof and proofs involving weak and weak compactness are also given. The Cauchy-Bunyakowski-Schwarz inequality and Alaoglu's theorem are also proven.

This thesis investigates some of the properties of R-modules. The material is presented in three chapters. Definitions and theorems which are assumed are stated in Chapter I. Proofs of these theorems may be found in Zariski and Samuel, Commutative Algebra, Vol. I, 1958. It is assumed that the reader is familiar with the basic properties of commutative rings and ideals in rings. Properties of R-modules are developed in Chapter II. The most important results presented in this chapter include existence theorems for R-modules and properties of submodules in R-modules. The third and final chapter presents an example which illustrates how a ring R, may be regarded as an R-module and speaks of the direct sum of ideals of a ring as a direct sum of submodules.

In the thesis, the author traces the historical development of descriptive set theory from the work of H. Lebesgue to the introduction of projective descriptive set theory. Proofs of most of the major results are given. Topics covered include Corel lattices, universal sets, the operation A, analytic sets, coanalytic sets, and the continuum hypothesis The appendix contains a translation of the famous letters exchanged between R. Baire, E. Borel, J. Hadamard and H. Lebesgue concerning Zermelo's axiom of choice.

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.

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

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.

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.

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

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.

This paper is concerned with finite difference methods for approximating solutions to the partial differential heat equation. The first chapel gives some introductory background into the physical problem, then motivates three finite difference methods. Chapters II through IV provide statements and proofs for the theorems used in the methods of Chapter I. The final Chapter, V, provides conclusions and an indication of future work. An appendix includes the computer codes written by the author with numerical results.

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.

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.