Let F denote the field of real numbers, complex numbers, or a finite algebraic extension of the p-adic field. We prove that the special linear group SLn(F) with the usual topology induced by F is a minimal topological group. This is accomplished by first proving the minimality of the upper triangular group in SLn(F). The proof for the upper triangular group uses an induction argument on a chain of upper triangular subgroups and relies on general results for locally compact topological groups, quotient groups, and subgroups. Minimality of SLn(F) is concluded by appealing to the associated Lie group decomposition as the product of a compact group and an upper triangular group. We also prove the universal minimality of homeomorphism groups of one dimensional manifolds, and we give a new simple proof of the universal minimality of S∞.

In this paper, we prove, for a certain class of open billiard dynamical systems, the existence of a family of smooth probability measures on the leaves of the dynamical system's unstable manifold. These measures describe the conditional asymptotic behavior of forward trajectories of the system. Furthermore, properties of these families are proven which are germane to the PYC programme for these systems. Strong sufficient conditions for the uniqueness of such families are given which depend upon geometric properties of the system's phase space. In particular, these results hold for a fairly nonrestrictive class of triangular configurations of scatterers.

Given a real N by N matrix A, write p(A) for the maximum angle by which A rotates any unit vector. Suppose that A and B are positive definite symmetric (PDS) N by N matrices. Then their Jordan product {A, B} := AB + BA is also symmetric, but not necessarily positive definite. If p(A) + p(B) is obtuse, then there exists a special orthogonal matrix S such that {A, SBS^(-1)} is indefinite. Of course, if A and B commute, then {A, B} is positive definite. Our work grows from the following question: if A and B are commuting positive definite symmetric matrices such that p(A) + p(B) is obtuse, what is the minimal p(S) such that {A, SBS^(-1)} indefinite? In this dissertation we will describe the level curves of the angle function mapping a unit vector x to the angle between x and Ax for a 3 by 3 PDS matrix A, and discuss their interaction with those of a second such matrix.

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.

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

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 an R1 setting are obtained.

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.

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 analysis such as variational identities, Sturm comparison theorems and methods of order. We also present a regularity result on linear elliptic equation where a coefficient has critical growth.

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.

This paper is a study of T-sets of normed linear spaces. Geometrical properties of normed linear spaces are developed in terms of intersection properties shared by a subcollection of T-sets of the space and in terms of special spanning properties shared by each T-set of a subcollection of T-sets of the space. A characterization of the extreme points of the unit ball of the dual of a normed linear space is given in terms of the T-sets of the space. Conditions on the collection of T-sets of a normed linear space are determined so that the normed linear space has the property that extreme points of the unit ball of the dual space map canonically to extreme points of the unit ball of the third dual space.

We present the results from three papers concerning partitions of vector spaces V over the set R of reals and of the set of lines in V.

We consider the problem of maximum likelihood estimation of logistic sinusoidal regression models and develop some asymptotic theory including the consistency and joint rates of convergence for the maximum likelihood estimators. The key techniques build upon a synthesis of the results of Walker and Song and Li for the widely studied sinusoidal regression model and on making a connection to a result of Radchenko. Monte Carlo simulations are also presented to demonstrate the finite-sample performance of the estimators

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.

In this paper, we use the following scheme to construct a continuous, nowhere-differentiable function 𝑓 which is the uniform limit of a sequence of sawtooth functions 𝑓ₙ : [0, 1] → [0, 1] with increasingly sharp teeth. Let 𝑋 = [0, 1] x [0, 1] and 𝐹(𝑋) be the Hausdorff metric space determined by 𝑋. We define contraction maps 𝑤₁ , 𝑤₂ , 𝑤₃ on 𝑋. These maps define a contraction map 𝑤 on 𝐹(𝑋) via 𝑤(𝐴) = 𝑤₁(𝐴) ⋃ 𝑤₂(𝐴) ⋃ 𝑤₃(𝐴). The iteration under 𝑤 of the diagonal in 𝑋 defines a sequence of graphs of continuous functions 𝑓ₙ. Since 𝑤 is a contraction map in the compact metric space 𝐹(𝑋), 𝑤 has a unique fixed point. Hence, these iterations converge to the fixed point-which turns out to be the graph of our continuous, nowhere-differentiable function 𝑓. Chapter 2 contains the background we will need to engage our task. Chapter 3 includes two results from the Baire Category Theorem. The first is the well known fact that the set of continuous, nowhere-differentiable functions on [0,1] is a residual set in 𝐶[0,1]. The second fact is that the set of continuous functions on [0,1] which have a dense set …

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.

This paper is an exposition of the theory of the hyperspaces 2^X and C(X) of a topological space X. These spaces are obtained from X by collecting the nonempty closed and nonempty closed connected subsets respectively, and are topologized by the Vietoris topology. The paper is organized in terms of increasing specialization of spaces, beginning with T1 spaces and proceeding through compact spaces, compact metric spaces and metric continua. Several basic techniques in hyperspace theory are discussed, and these techniques are applied to elucidate the topological structure of hyperspaces.

The purpose of this paper is to investigate the integrability, measurability, and summability of certain set functions. The paper is divided into four chapters. The first chapter contains basic definitions and preliminary remarks about set functions and absolute continuity. In Chapter i, the integrability of bounded set functions is investigated. The chapter culminates with a theorem that characterizes the transmission of the integrability of a real function of n bounded set functions. In Chapter III, measurability is defined and a characterization of the transmission of measurability by a function of n variables is provided, In Chapter IV, summability is defined and the summability of set functions is investigated, Included is a characterization of the transmission of summability by a function of n variables.

We study weak convergence of sequences in Banach spaces. In particular, we compare the notions of weak and norm convergence. Although these modes of convergence usually differ, we show that in ℓ¹ they coincide. We then show a theorem of Rosenthal's which states that if {𝓍ₙ} is a bounded sequence in a Banach space, then {𝓍ₙ} has a subsequence {𝓍'ₙ} satisfying one of the following two mutually exclusive alternatives; (i) {𝓍'ₙ} is weakly Cauchy, or (ii) {𝓍'ₙ} is equivalent to the unit vector basis of ℓ¹.

Assume AD+V=L(R). In the first chapter, let W^1_1 denote the club measure on \omega_1. We analyze the embedding j_{W^1_1}\restr HOD from the point of view of inner model theory. We use our analysis to answer a question of Jackson-Ketchersid about codes for ordinals less than \omega_\omega. In the second chapter, we provide an indiscernibles analysis for models of the form L[T_n,x]. We use our analysis to provide new proofs of the strong partition property on \delta^1_{2n+1}

In this thesis, we define differential operators for Hermitian Jacobi forms and Hermitian modular forms over the Gaussian number field Q(i). In particular, we construct Rankin-Cohen brackets for such spaces of Hermitian Jacobi forms and Hermitian modular forms. As an application, we extend Rankin's method to the case of Hermitian Jacobi forms. Finally we compute Fourier series coefficients of Hermitian modular forms, which allow us to give an example of the first Rankin-Cohen bracket of two Hermitian modular forms. In the appendix, we provide tables of Fourier series coefficients of Hermitian modular forms and also the computer source code that we used to compute such Fourier coefficients.

The descent algebra of a Coxeter group is a subalgebra of the group algebra with interesting representation theoretic properties. For instance, the natural map from the descent algebra of the symmetric group to the character ring is a surjective algebra homomorphism, so the descent algebra implicitly encodes information about the representations of the symmetric group. However, this property does not hold for other Coxeter groups. Moreover, a complete set of primitive idempotents in the descent algebra of the symmetric group leads to a decomposition of the group algebra as a direct sum of induced linear characters of centralizers of conjugacy class representatives. In this dissertation, I consider the hyperoctahedral group. When the descent algebra of a hyperoctahedral group is replaced with a generalization called the Mantaci-Reutenauer algebra, the natural map to the character ring is surjective. In 2008, Bonnafé asked whether a complete set of idempotents in the Mantaci-Reutenauer algebra could lead to a decomposition of the group algebra of the hyperoctahedral group as a direct sum of induced linear characters of centralizers. In this dissertation, I will answer this question positively and go through the construction of the idempotents, conjugacy class representatives, and linear characters required to do so.

In this paper I formulate an explicit wavelet transform that, applied to any distribution in S^1(R^2), yields a function on phase space whose high-frequency singularities coincide precisely with the wave front set of the distribution. This characterizes the wave front set of a distribution in terms of the singularities of its wavelet transform with respect to a suitably chosen basic wavelet.

In this paper, we study continuous functions with no finite or infinite one-sided derivative anywhere. In 1925, A. S. Beskovitch published an example of such a function. Since then we call them Beskovitch functions. This construction is presented in chapter 2, The example was simple enough to clear the doubts about the existence of Besicovitch functions. In 1932, S. Saks showed that the set of Besicovitch functions is only a meager set in C[0,1]. Thus the Baire category method for showing the existence of Besicovitch functions cannot be directly applied. A. P. Morse in 1938 constructed Besicovitch functions. In 1984, Maly revived the Baire category method by finding a non-empty compact subspace of (C[0,1], || • ||) with respect to which the set of Morse-Besicovitch functions is comeager.

In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian.