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 measures generated by the SBA construction. A relationship between statistics associated with a finite level version of the SBA construction and the full construction is developed. Monte Carlo statistical experiments are used to simulate the effect changing base measures has on the statistics associated with the finite level construction.

Banach's contraction principle is probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's contraction principle are made. Some of these applications involve obtaining new metrics on a space, forcing a continuous map to have a fixed point, and using conditions on the boundary of a closed ball in a Banach space to obtain a fixed point. Finally, a development of the theorem due to Browder et al. is given with Hilbert spaces replaced by uniformly convex Banach spaces.

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 give a formula for R(n) in terms of binomial coefficients modulo two.

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 a Borel set of Turing degrees that neither contains nor omits a cone; so by another theorem of Martin, Borel Determinacy is not a theorem of ZC. This paper contains three main sections: Martin's proof of Borel Determinacy; a simpler example of Friedman's result, namely, (in ZFC) a coanalytic set of Turing degrees that neither contains nor omits a cone; and finally, the Friedman result.

We give conditions which, given two Bernoulli trial measures, determine whether there exists a homeomorphism of Cantor space which sends one measure to the other, answering a question of Oxtoby. We then provide examples, relating these results to the notions of good and refinable measures on Cantor space.

In this thesis, some characterizations of continua of finite degree are given. It turns out that being of finite degree (by formal definition) can be described by saying there exists an equivalent metric in which Hausdorff linear measure of the continuum is finite. I discuss this result in detail.

Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a) (the ideal of sets which force cof Π α < λ) is generated from J<λ+(a) by adding a singleton. Combining these results with a polarized partition relation on ω1

In this thesis I look at the theory of compact operators in a general Hilbert space, as well as the inverse of the Hamiltonian operator in the specific case of L2[a,b]. I show that this inverse is a compact, positive, and bounded linear operator. Also the eigenfunctions of this operator form a basis for the space of continuous functions as a subspace of L2[a,b]. A numerical method is proposed to solve for these eigenfunctions when the Hamiltonian is considered as an operator on Rn. The paper finishes with a discussion of examples of Schrödinger equations and the solutions.

For many years mathematicians have been interested in the problem of whether an operator ideal is complemented in the space of all bounded linear operators. In this dissertation the complementation of various classes of operators in the space of all bounded linear operators is considered. This paper begins with a preliminary discussion of linear bounded operators as well as operator ideals. Let L(X, Y ) be a Banach space of all bounded linear operator between Banach spaces X and Y , K(X, Y ) be the space of all compact operators, and W(X, Y ) be the space of all weakly compact operators. We denote space all operator ideals by O.

We compute the partial isomorphism rank, in the sense Scott and Karp, of a pair of ordinal structures using an Ehrenfeucht-Fraisse game. A complete formula is proven by induction given any two arbitrary ordinals written in Cantor normal form.

In this work I present a constructive method for finding critical points of the Ginzburg-Landau energy functional using the method of Sobolev gradients. I give a description of the construction of the Sobolev gradient and obtain convergence results for continuous steepest descent with this gradient. I study the Ginzburg-Landau functional with magnetic field and the Ginzburg-Landau functional without magnetic field. I then present the numerical results I obtained by using steepest descent with the discretized Sobolev gradient.

We follow a research paper that J. Elstrodt published in 1998 to prove the Prime Number Theorem for arithmetic progressions. We will review basic results from Dirichlet characters and L-functions. Furthermore, we establish a weak version of the Wiener-Ikehara Tauberian Theorem, which is an essential tool for the proof of our main result.

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 analysis of spike train summary statistics A complexity measure for the network structure is also presented which has a one-to-one correspondence with the standard time series complexity measure sample entropy.

In this dissertation we study graph directed Markov systems (GDMS) and limit sets associated with these systems. Given a GDMS S, by the Hausdorff dimension spectrum of S we mean the set of all positive real numbers which are the Hausdorff dimension of the limit set generated by a subsystem of S. We say that S has full Hausdorff dimension spectrum (full HD spectrum), if the dimension spectrum is the interval [0, h], where h is the Hausdorff dimension of the limit set of S. We give necessary conditions for a finitely primitive conformal GDMS to have full HD spectrum. A GDMS is said to be regular if the Hausdorff dimension of its limit set is also the zero of the topological pressure function. We show that every number in the Hausdorff dimension spectrum is the Hausdorff dimension of a regular subsystem. In the particular case of a conformal iterated function system we show that the Hausdorff dimension spectrum is compact. We introduce several new systems: the nearest integer GDMS, the Gauss-like continued fraction system, and the Renyi-like continued fraction system. We prove that these systems have full HD spectrum. A special attention is given to the backward continued fraction …

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.

In this dissertation, we study the dynamics, fractal geometry and the topology of the Julia set of functions in the family H which is a set in the class S, the Speiser class of entire transcendental functions which have only finitely many singular values. One can think of a function from H as a generalized expanding function from the cosh family. We shall build a version of thermodynamic formalism for functions in H and we shall show among others, the existence and uniqueness of a conformal measure. Then we prove a Bowen's type formula, i.e. we show that the Hausdorff dimension of the set of returning points, is the unique zero of the pressure function. We shall also study conjugacies in the family H, perturbation of functions in the family and related dynamical properties. We define Perron-Frobenius operators for some functions naturally associated with functions in the family H and then, using fundamental properties of these operators, we shall prove the important result that the Hausdorff dimension of the subset of returning points depends analytically on the parameter taken from a small open subset of the n-dimensional parameter space.

The aim of this work is the study of infinite conformal iterated function systems. More specifically, we investigate some properties of a limit set J associated to such system, its Hausdorff and packing measure and Hausdorff dimension. We provide necessary and sufficient conditions for such systems to be bi-Lipschitz equivalent. We use the concept of scaling functions to obtain some result about 1-dimensional systems. We discuss particular examples of infinite iterated function systems derived from complex continued fraction expansions with restricted entries. Each system is obtained from an infinite number of contractions. We show that under certain conditions the limit sets of such systems possess zero Hausdorff measure and positive finite packing measure. We include an algorithm for an approximation of the Hausdorff dimension of limit sets. One numerical result is presented. In this thesis we also explore the concept of positively recurrent function. We use iterated function systems to construct a natural, wide class of such functions that have strong ergodic properties.

In this paper, exhaustivity, continuity, and strong additivity are studied in the setting of topological Riesz spaces. Of particular interest is the link between strong additivity and exhaustive elements of Dedekind s-complete Banach lattices. There is a strong connection between the Diestel-Faires Theorem and the Meyer-Nieberg Lemma in this setting. Also, embedding properties of Banach lattices are linked to the notion of strong additivity. The Meyer-Nieberg Lemma is extended to the setting of topological Riesz spaces and uniform absolute continuity and uniformly exhaustive elements are studied in this setting. Counterexamples are provided to show that the Vitali-Hahn-Saks Theorem and the Brooks-Jewett Theorem cannot be extended to submeasures or to the setting of Banach lattices.

The Iwahori-Hecke algebras of Coxeter groups play a central role in the study of representations of semisimple Lie-type groups. An important tool is the combinatorial approach to representations of Iwahori-Hecke algebras introduced by Kazhdan and Lusztig in 1979. In this dissertation, I discuss a generalization of the Iwahori-Hecke algebra of the symmetric group that is instead based on the complex reflection group G(r,1,n). Using the analogues of Kazhdan and Lusztig's R-polynomials, I show that this algebra determines a partial order on G(r,1,n) that generalizes the Chevalley-Bruhat order on the symmetric group. I also consider possible analogues of Kazhdan-Lusztig polynomials.

I study sets of attractors and non-attractors of finite iterated function systems. I provide examples of compact sets which are attractors of iterated function systems as well as compact sets which are not attractors of any iterated function system. I show that the set of all attractors is a dense Fs set and the space of all non-attractors is a dense Gd set it the space of all non-empty compact subsets of a space X. I also investigate the small trans-finite inductive dimension of the space of all attractors of iterated function systems generated by similarity maps on [0,1].

In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and Ismail's work in the 1996 paper "Binomial and Q-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and their Q-Analogues," we defined subset graphs, subspace graphs, and their associated bipartite graphs. The main emphasis of this dissertation is to describe those graphs and study their Hamiltonicity. The results on subset graphs are presented in Chapter 3, on subset bipartite graphs in Chapter 4, and on subspace graphs and subspace bipartite graphs in Chapter 5. We conclude the dissertation by suggesting some generalizations of our results concerning the panciclicity of the graphs.

In this paper we use the Sobolev steepest descent method introduced by John W. Neuberger to solve the hyperbolic Monge-Ampère equation. First, we use the discrete Sobolev steepest descent method to find numerical solutions; we use several initial guesses, and explore the effect of some imposed boundary conditions on the solutions. Next, we prove convergence of the continuous Sobolev steepest descent to show local existence of solutions to the hyperbolic Monge-Ampère equation. Finally, we prove some results on the Sobolev gradients that mainly arise from general nonlinear differential equations.

In this paper we study properties of metric spaces. We consider the collection of all nonempty closed subsets, Cl(X), of a metric space (X,d) and topologies on C.(X) induced by d. In particular, we investigate the Hausdorff topology and the Wijsman topology. Necessary and sufficient conditions are given for when a particular pseudo-metric is a metric in the Wijsman topology. The metric properties of the two topologies are compared and contrasted to show which also hold in the respective topologies. We then look at the metric space R-n, and build two residual sets. One residual set is the collection of uncountable, closed subsets of R-n and the other residual set is the collection of closed subsets of R-n having n-dimensional Lebesgue measure zero. We conclude with the intersection of these two sets being a residual set representing the collection of uncountable, closed subsets of R-n having n-dimensional Lebesgue measure zero.

How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with positive excess at each vertex. The results of this paper show that there are an uncountable number of geodesic fibers for graphs in this extended class and that for any graph in this extended class the only bounded automorphism is the identity automorphism.