Search Results

open access

Dimensions in Random Constructions.

Description: We consider random fractals generated by random recursive constructions, prove zero-one laws concerning their dimensions and find their packing and Minkowski dimensions. Also we investigate the packing measure in corresponding dimension. For a class of random distribution functions we prove that their packing and Hausdorff dimensions coincide.
Date: May 2002
Creator: Berlinkov, Artemi
open access

Around the Fibonacci Numeration System

Description: Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can be expressed as a sum of distinct Fibonacci numbers in one or more ways. Setting R(n) to be the number of ways n can be written as a sum of distinct Fibonacci numbers, we exhibit certain regularity properties of R(n), one of which is connected to the Euler φ-function. In addition, using a theorem of Fine and Wilf, we… more
Date: May 2007
Creator: Edson, Marcia Ruth
open access

Borel Determinacy and Metamathematics

Description: Borel determinacy states that if G(T;X) is a game and X is Borel, then G(T;X) is determined. Proved by Martin in 1975, Borel determinacy is a theorem of ZFC set theory, and is, in fact, the best determinacy result in ZFC. However, the proof uses sets of high set theoretic type (N1 many power sets of ω). Friedman proved in 1971 that these sets are necessary by showing that the Axiom of Replacement is necessary for any proof of Borel Determinacy. To prove this, Friedman produces a model of ZC and… more
Date: December 2001
Creator: Bryant, Ross
open access

Determining Properties of Synaptic Structure in a Neural Network through Spike Train Analysis

Description: A "complex" system typically has a relatively large number of dynamically interacting components and tends to exhibit emergent behavior that cannot be explained by analyzing each component separately. A biological neural network is one example of such a system. A multi-agent model of such a network is developed to study the relationships between a network's structure and its spike train output. Using this model, inferences are made about the synaptic structure of networks through cluster analys… more
Date: May 2007
Creator: Brooks, Evan
open access

Applications of Graph Theory and Topology to Combinatorial Designs

Description: 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 … more
Date: December 1988
Creator: Somporn Sutinuntopas
open access

Containment Relations Between Classes of Regular Ideals in a Ring with Few Zero Divisors

Description: This dissertation focuses on the significance of containment relations between the above mentioned classes of ideals. The main problem considered in Chapter II is determining conditions which lead a ring to be a P-ring, D-ring, or AM-ring when every regular ideal is a P-ideal, D-ideal, or AM-ideal, respectively. We also consider containment relations between classes of regular ideals which guarantee that the ring is a quasi-valuation ring. We continue this study into the third chapter; in parti… more
Date: May 1987
Creator: Race, Denise T. (Denise Tatsch)
open access

Dynamics of One-Dimensional Maps: Symbols, Uniqueness, and Dimension

Description: This dissertation is a study of the dynamics of one-dimensional unimodal maps and is mainly concerned with those maps which are trapezoidal. The trapezoidal function, f_e, is defined for eΣ(0,1/2) by f_e(x)=x/e for xΣ[0,e], f_e(x)=1 for xΣ(e,1-e), and f_e(x)=(1-x)/e for xΣ[1-e,1]. We study the symbolic dynamics of the kneading sequences and relate them to the analytic dynamics of these maps. Chapter one is an overview of the present theory of Metropolis, Stein, and Stein (MSS). In Chapter two a… more
Date: May 1988
Creator: Brucks, Karen M. (Karen Marie), 1957-
open access

The Reciprocal Dunford-Pettis and Radon-Nikodym Properties in Banach Spaces

Description: 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 … more
Date: August 1984
Creator: Leavelle, Tommy L. (Tommy Lee)
open access

Invertible Ideals and the Strong Two-Generator Property in Some Polynomial Subrings

Description: Let K be any field and Q be the rationals. Define K^1[X] = {f(X) e K[X]| the coefficient of X in f(X) is zero} and Q^1β[X] = {f(X) e Q[X]| the coefficent of β1(X) in the binomial expansion of f(X) is zero}, where {β1(X)}^∞ i=0 are the well-known binomial polynomials. In this work, I establish the following results: K^1[X] and Q^1β[X] are one-dimensional, Noetherian, non-Prüfer domains with the two-generator property on ideals. Using the unique factorization structure of the overrings K[X] and Q… more
Date: May 1987
Creator: Chapman, Scott T. (Scott Thomas)
open access

R₀ Spaces, R₁ Spaces, And Hyperspaces

Description: The purpose of this paper is to further investigate R0 spaces, R1 spaces, and hyperspaces. The R0 axiom was introduced by N. A. Shanin in 1943. Later, in 1961, A. S. Davis investigated R0 spaces and introduced R1 spaces. Then, in 1975, William Dunham further investigated R1 spaces and proved that several well-known theorems can be generalized from a T2 setting to an R1 setting. In Chapter II R0 and R1 spaces are investigated and additional theorems that can be generalized from a T2 setting to a… more
Date: December 1976
Creator: Dorsett, Charles I.
open access

Finite Element Solutions to Nonlinear Partial Differential Equations

Description: 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 prov… more
Date: August 1981
Creator: Beasley, Craig J. (Craig Jackson)
open access

Operators on Continuous Function Spaces and Weak Precompactness

Description: 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 o… more
Date: August 1988
Creator: Abbott, Catherine Ann
open access

Iterative Solution of Linear Boundary Value Problems

Description: 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… more
Date: August 1983
Creator: Walsh, John Breslin
open access

Universally Measurable Sets And Nonisomorphic Subalgebras

Description: 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 m… more
Date: August 1983
Creator: Williams, Stanley C. (Stanley Carl)
open access

Measurable Selection Theorems for Partitions of Polish Spaces into Gδ Equivalence Classes

Description: 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.
Date: May 1980
Creator: Simrin, Harry S.
open access

Polynomial Isomorphisms of Cayley Objects Over a Finite Field

Description: In this dissertation the Bays-Lambossy theorem is generalized to GF(pn). The Bays-Lambossy theorem states that if two Cayley objects each based on GF(p) are isomorphic then they are isomorphic by a multiplier map. We use this characterization to show that under certain conditions two isomorphic Cayley objects over GF(pn) must be isomorphic by a function on GF(pn) of a particular type.
Date: December 1989
Creator: Park, Hong Goo
open access

Dually Semimodular Consistent Lattices

Description: A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the… more
Date: May 1988
Creator: Gragg, Karen E. (Karen Elizabeth)
open access

Uniqueness of Positive Solutions for Elliptic Dirichlet Problems

Description: In this paper we consider the question of uniqueness of positive solutions for Dirichlet problems of the form - Δ u(x)= g(λ,u(x)) in B, u(x) = 0 on ϑB, where A is the Laplace operator, B is the unit ball in RˆN, and A>0. We show that if g(λ,u)=uˆ(N+2)/(N-2) + λ, that is g has "critical growth", then large positive solutions are unique. We also prove uniqueness of large solutions when g(λ,u)=A f(u) with f(0) < 0, f "superlinear" and monotone. We use a number of methods from nonlinear functional … more
Date: December 1990
Creator: Ali, Ismail, 1961-
open access

Hausdorff, Packing and Capacity Dimensions

Description: 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… more
Date: August 1989
Creator: Spear, Donald W.
open access

Analysis Of Sequential Barycenter Random Probability Measures via Discrete Constructions

Description: Hill and Monticino (1998) introduced a constructive method for generating random probability measures with a prescribed mean or distribution on the mean. The method involves sequentially generating an array of barycenters that uniquely defines a probability measure. This work analyzes statistical properties of the measures generated by sequential barycenter array constructions. Specifically, this work addresses how changing the base measures of the construction affects the statististics of m… more
Date: December 2002
Creator: Valdes, LeRoy I.
open access

Automorphism Groups of Strong Bruhat Orders of Coxeter Groups

Description: 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 dihedr… more
Date: August 1986
Creator: Sutherland, David C. (David Craig)
Back to Top of Screen