The Lie algebra Vec(ℝ) of polynomial vector fields on the line acts naturally on ℂ[]. This action has a one-parameter family of deformations called the tensor density modules F_λ. The bounded indecomposable modules of Vec(ℝ) of length 2 composed of tensor density modules have been classified by Feigin and Fuchs. We present progress towards describing the annihilators of the unique indecomposable extension of F_λ by F_(λ+2) in the non-resonant case λ ≠ -½. We give the intersection of the annihilator and the subalgebra of lowest weight vectors of the universal enveloping algebra (Vec(ℝ)) of Vec(ℝ). This result is found by applying structural descriptions of the lowest weight vectors of (Vec(ℝ)).

This dissertation deals with three topics in descriptive set theory. First, the order topology is a natural topology on ordinals. In Chapter 2, a complete classification of order topologies on ordinals up to Borel isomorphism is given, answering a question of Benedikt Löwe. Second, a map between separable metrizable spaces X and Y preserves complete metrizability if Y is completely metrizable whenever X is; the map is resolvable if the image of every open (closed) set in X is resolvable in Y. In Chapter 3, it is proven that resolvable maps preserve complete metrizability, generalizing results of Sierpiński, Vainštein, and Ostrovsky. Third, an equivalence relation on a Polish space has the Laczkovich-Komjáth property if the following holds: for every sequence of analytic sets such that the limit superior along any infinite set of indices meets uncountably many equivalence classes, there is an infinite subsequence such that the intersection of these sets contains a perfect set of pairwise inequivalent elements. In Chapter 4, it is shown that every coanalytic equivalence relation has the Laczkovich-Komjáth property, extending a theorem of Balcerzak and Głąb.

Spreading models have become fundamental to the study of asymptotic geometry in Banach spaces. The existence of spreading models in every Banach space, and the so-called good sequences which generate them, was one of the first applications of Ramsey theory in Banach space theory. We use Ramsey theory and other techniques from infinitary combinatorics to examine some old and new questions concerning spreading models and good sequences. First, we consider the lp spreading model problem which asks whether a Banach space contains lp provided that every spreading model of a normalized block basic sequence of the basis is isometrically equivalent to lp. Next, using the Hindman-Milliken-Taylor theorem, we prove a new stabilization theorem for spreading models which produces a basic sequence all of whose normalized constant coefficient block basic sequences are good. When the resulting basic sequence is semi-normalized, all the spreading models generated by the above good sequences must be uniformly equivalent to lp or c0. Finally, we investigate the assumption that every normalized block tree on a Banach space has a good branch. This turns out to be a very strong assumption and is equivalent to the space being 1-asymptotic lp. We also show that the stronger assumption …

We present a novel theorem of Borel Combinatorics that sheds light on the types of continuous functions that can be defined on the Cantor space. We specifically consider the part X=F(2ᴳ) from the Cantor space, where the group G is the additive group of integer pairs ℤ². That is, X is the set of aperiodic {0,1} labelings of the two-dimensional infinite lattice graph. We give X the Bernoulli shift action, and this action induces a graph on X in which each connected component is again a two-dimensional lattice graph. It is folklore that no continuous (indeed, Borel) function provides a two-coloring of the graph on X, despite the fact that any finite subgraph of X is bipartite. Our main result offers a much more complete analysis of continuous functions on this space. We construct a countable collection of finite graphs, each consisting of twelve "tiles", such that for any property P (such as "two-coloring") that is locally recognizable in the proper sense, a continuous function with property P exists on X if and only if a function with a corresponding property P' exists on one of the graphs in the collection. We present the theorem, and give several applications.

In 1980 Feigin and Fuchs classified the length 2 bounded representations of Vec(R), the Lie algebra of polynomial vector fields on the line, as a result of their work on the cohomology of Vec(R). This dissertation is concerned mainly with the uniserial (completely indecomposable) representations of Vec(R) with a single Casimir eigenvalue and weights bounded below. Such representations are composed of irreducible representations with semisimple Euler operator action, bounded weight space dimensions, and weights bounded below. These are known to be the tensor density modules with lowest weight λ, for any non-zero complex number λ, and the trivial module C, with Vec(R) actions π_λ and π_C, respectively. Our proofs are cohomology arguments involving the first cohomology groups of Vec(R) with values in the space of homomorphisms between two irreducible representations. These results classify the finite length uniserial extensions, with a single Casimir eigenvalue, of admissible irreducible Vec(R) representations with weights bounded below. In almost every case there is at most one uniserial representation with a given composition series. However, in the case of an odd length extension with composition series {π_1,π_C,π_1,…,π_C,π_1}, there is a one-parameter family of extensions. We also give preliminary results on uniserial representations of the Virasoro Lie …

In this paper, there are three chapters. The first chapter discusses interpolation. Here a theorem about the uniqueness of the solution to the general interpolation problem is proven. Then the problem of how to represent this unique solution is discussed. Finally, the error involved in the interpolation and the convergence of the interpolation process is developed. In the second chapter a theorem about the uniform approximation to continuous functions is proven. Then the best approximation and the least squares approximation (a special case of best approximation) is discussed. In the third chapter orthogonal polynomials as discussed as well as bounded linear functionals in Hilbert spaces, interpolation and approximation and approximation in Hilbert space.

The Hochschild cohomology of an associative algebra records information about the deformations of that algebra, and hence the first step toward understanding its deformations is an examination of the Hochschild cohomology. In this dissertation, we use techniques from homological algebra, invariant theory, and combinatorics to analyze the Hochschild cohomology of skew group algebras arising from finite cyclic groups acting on polynomial rings over fields of arbitrary characteristic. These algebras are the natural semidirect product of the group ring with the polynomial ring. Many families of algebras arise as deformations of skew group algebras, such as symplectic reflection algebras and rational Cherednik algebras. We give an explicit description of the Hochschild cohomology governing graded deformations of skew group algebras for cyclic groups acting on polynomial rings. For skew group algebras, a description of the Hochschild cohomology is known in the nonmodular setting (i.e., when the characteristic of the field and the order of the group are coprime). However, in the modular setting (i.e., when the characteristic of the field divides the order of the group), much less is known, as techniques commonly used in the nonmodular setting are not available.

This thesis is an exloration and exposition of a highly efficient shallow neural network algorithm called word2vec, which was developed by T. Mikolov et al. in order to create vector representations of a language vocabulary such that information about the meaning and usage of the vocabulary words is encoded in the vector space structure. Chapter 1 introduces natural language processing, vector representations of language vocabularies, and the word2vec algorithm. Chapter 2 reviews the basic mathematical theory of deterministic convex optimization. Chapter 3 provides background on some concepts from computer science that are used in the word2vec algorithm: Huffman trees, neural networks, and binary cross-entropy. Chapter 4 provides a detailed discussion of the word2vec algorithm itself and includes a discussion of continuous bag of words, skip-gram, hierarchical softmax, and negative sampling. Finally, Chapter 5 explores some applications of vector representations: word categorization, analogy completion, and language translation assistance.

This paper is an algebraic study of selected properties of semigroups. Since a semigroup is a result of weakening the group axioms, all groups are semigroups. One facet of the paper is to demonstrate various semigroup properties that induce the group axioms.

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

This dissertation considers certain issues in support vector machines (SVMs), including a description of their construction, aspects of certain exponential kernels used in some SVMs, and a presentation of an algorithm that computes the necessary elements of their operation with proof of convergence. In its first section, this dissertation provides a reasonably complete description of SVMs and their theoretical basis, along with a few motivating examples and counterexamples. This section may be used as an accessible, stand-alone introduction to the subject of SVMs for the advanced undergraduate. Its second section provides a proof of the positive-definiteness of a certain useful function here called E and dened as follows: Let V be a complex inner product space. Let N be a function that maps a vector from V to its norm. Let p be a real number between 0 and 2 inclusive and for any in V , let ( be N() raised to the p-th power. Finally, let a be a positive real number. Then E() is exp(()). Although the result is not new (other proofs are known but involve deep properties of stochastic processes) this proof is accessible to advanced undergraduates with a decent grasp of linear algebra. Its …

Let M be the class of simple matroids which do not contain the 5-point line U2,5 , the Fano plane F7 , the non-Fano plane F7- , or the matroid P7 , as minors. Let h(n) be the maximum number of points in a rank-n matroid in M. We show that h(2)=4, h(3)=7, and h(n)=n(n+1)/2 for n>3, and we also find all the maximum-sized matroids for each rank.

Consider a multidimensional shift space with a countably infinite alphabet, which serves in mathematical physics as a classical lattice gas or lattice spin system. A new definition of a Gibbs measure is introduced for suitable real-valued functions of the configuration space, which play the physical role of specific internal energy. The variational principle is proved for a large class of functions, and then a more restrictive modulus of continuity condition is provided that guarantees a function's Gibbs measures to be a nonempty, weakly compact, convex set of measures that coincides with the set of measures obeying a form of the DLR equations (which has been adapted so as to be stated entirely in terms of specific internal energy instead of the Hamiltonians for an interaction potential). The variational equilibrium measures for a such a function are then characterized as the shift invariant Gibbs measures of finite entropy, and a condition is provided to determine if a function's Gibbs measures have infinite entropy or not. Moreover the spatially averaged limiting Gibbs measures, i.e. constructive equilibria, are shown to exist and their weakly closed convex hull is shown to coincide with the set of true variational equilibrium measures. It follows that the …

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 lattice point problem in dynamical systems investigates the distribution of certain objects with some length property in the space that the dynamics is defined. This problem in different contexts can be interpreted differently. In the context of symbolic dynamical systems, we are trying to investigate the growth of N(T), the number of finite words subject to a specific ergodic length T, as T tends to infinity. This problem has been investigated by Pollicott and Urbański to a great extent. We try to investigate it further, by relaxing a condition in the context of deterministic dynamical systems. Moreover, we investigate this problem in the context of random dynamical systems. The method for us is considering the Fourier-Stieltjes transform of N(T) and expressing it via a Poincaré series for which the spectral gap property of the transfer operator, enables us to apply some appropriate Tauberian theorems to understand asymptotic growth of N(T). For counting in the random dynamics, we use some results from probability theory.

We investigate non-geometric sharp permutation groups of type {0,k} whose point stabilizers are certain Frobenius groups. We show that if a point stabilizer has a cyclic Frobenius kernel whose order is a power of a prime and Frobenius complement cyclic of prime order, then the point stabilizer is isomorphic to the symmetric group on 3 letters, and there is up to permutation isomorphism, one such permutation group. Further, we determine a significant structural description of non-geometric sharp permutation groups of type {0,k} whose point stabilizers are Frobenius groups with elementary abelian Frobenius kernel K and Frobenius complement L with |L| = |K|-1. As a result of this structural description, it is shown that the smallest non-solvable Frobenius group cannot be a point stabilizer in a non-geometric sharp permutation group of type {0,k}.

The non-resonant bounded uniserial representations of Vec(R) form a certain class of extensions composed of tensor density modules, all of whose subquotients are indecomposable. The problem of classifying the extensions with a given composition series is reduced via cohomological methods to computing the solution of a certain system of polynomial equations in several variables derived from the cup equations for the extension. Using this method, we classify all non-resonant bounded uniserial extensions of Vec(R) up to length 6. Beyond this length, all such extensions appear to arise as subquotients of extensions of arbitrary length, many of which are explained by the psuedodifferential operator modules. Others are explained by a wedge construction and by the pseudodifferential operator cocycle discovered by Khesin and Kravchenko.

We give some background on the free part of the action of tuples of integers into 2. We will construct specific structures on this space, and then show that certain other structures cannot exist.

The purpose of this dissertation is to introduce a natural and unifying multifractal formalism which contains the above mentioned multifractal parameters, and gives interesting results for a large class of natural measures. In Part 2 we introduce the proposed multifractal formalism and study it properties. We also show that this multifractal formalism gives natural and interesting results when applied to (nonrandom) graph directed self-similar measures in Rd and "cookie-cutter" measures in R. In Part 3 we use the multifractal formalism introduced in Part 2 to give a detailed discussion of the multifractal structure of random (and hence, as a special case, non-random) graph directed self-similar measures in R^d.

The purpose of this composition is to develop a rigorous, axiomatic proof of the comparability of the cardinals of infinite sets.

We prove the existence of a one-parameter family of solutions of the porous medium equation, a nonlinear heat equation. In our work, with space dimension 3, the interface is a half line whose end point advances at constant speed. We prove, by using maximum principle, that the solutions are stable under a suitable class of perturbations. We discuss the relevance of our solutions, when restricted to two dimensions, to gravity driven flows of thin films. Here we extend the results of J. Iaia and S. Betelu in the paper "Solutions of the porous medium equation with degenerate interfaces" to a higher dimension.

The purpose of this paper is to develop the Peano postulates from a weaker axiom system than the system used by John L. Kelley in General Topology. The axiom of regularity which states "If X is a non-empty set, then there is a member Y of X such that the intersection of X and Y is empty." is not assumed in this thesis. The axiom of amalgamation which states "If X is a set, then the union of the elements of X is a set." is also not assumed. All other axioms used by Kelley relevant to the Peano postulates are assumed. The word class is never used in the thesis, though the variables can be interpreted as classes.

We establish the existence of radial solutions to the p-Laplacian equation ∆p u + f(u)=0 in RN, where f behaves like |u|q-1 u when u is large and f(u) < 0 for small positive u. We show that for each nonnegative integer n, there is a localized solution u which has exactly n zeros. Also, we look for radial solutions of a superlinear Dirichlet problem in a ball. We show that for each nonnegative integer n, there is a solution u which has exactly n zeros. Here we give an alternate proof to that which was given by Castro and Kurepa.

Let L be a lattice. For x ∈ L, we say x is a consistent join-irreducible if x V y is a join-irreducible of the lattice [y,1] for all y in L. We say L is consistent if every join-irreducible of L is consistent. In this dissertation, we study the notion of consistent elements in semimodular lattices.