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.

Let X be a Polish space and Q a measurable partition of X into Gδ equivalence classes. In 1978, S. M. Srivastava proved the existence of a Borel cross section for Q. He asked whether more can be concluded in case each equivalence class is uncountable. This question is answered here in the affirmative. The main result of the author is a proof that shows the existence of a Castaing Representation for Q.

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, …

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 purpose of this paper is to examine properties of the mean integral. The mean integral is compared with the regular integral. If [a;b] is an interval, f is quasicontinuous on [a;b] and g has bounded variation on [a;b], then the man integral of f with respect to g exists on [a;b]. The following theorem is proved. If [a*;b*] and [a;b] each is an interval and h is a function from [a*;b*] into R, then the following two statements are equivalent: 1) If f is a function from [a;b] into [a*;b*], gi is a function from [a;b] into R with bounded variation and (m)∫^b_afdg exists then (m)∫^b_ah(f)dg exists. 2) h is continuous.

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.

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

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.

This paper is an investigation of several basic properties of noetherian rings. Chapter I gives a brief introduction, statements of definitions, and statements of theorems without proof. Some of the main results in the study of noetherian rings are proved in Chapter II. These results include proofs of the equivalence of the maximal condition, the ascending chain condition, and that every ideal is finitely generated. Some other results are that if a ring R is noetherian, then R[x] is noetherian, and that if every prime ideal of a ring R is finitely generated, then R is noetherian.

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.

In 1909, F. Riesz succeeded in giving an integral represntation for continuous linear functionals on C[0,1]. Although other authors, notably Hadamard and Frechet, had given representations for continuous linear functionals on C[0,1], their results lacked the clarity, elegance, and some of the substance (uniqueness) of Riesz's theorem. Subsequently, the integral representation of continuous linear functionals has been known as the Riesz Representation Theorem. In this paper, three different proofs of the Riesz Representation Theorem are presented. The first approach uses the denseness of the Bernstein polynomials in C[0,1] along with results of Helly to write the continuous linear functionals as Stieltjes integrals. The second approach makes use of the Hahn-Banach Theorem in order to write the functional as an integral. The paper concludes with a detailed presentation of a Daniell integral development of the Riesz Representation Theorem.

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 …

The problem under consideration is that of determining a simple and effective invariant of knots. To this end, the Conway polynomial is defined as a generalization of Alexander's original knot polynomial. It is noted, however, that the Conway polynomial is not a complete invariant. If two knots are equivalent, as defined in this investigation, then they receive identical polynomials. Yet, if two knots have identical polynomials, no information about their equivalence may be obtained. To define the Conway polynomial, the Axioms for Computation are given and many examples of their use are included. A major result of this investigation is the proof of topological invariance of these polynomials and the proof that the axioms are sufficient for the calculation of the knot polynomial for any given knot or link.