Search Results

Continuous Combinatorics of a Lattice Graph in the Cantor Space
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.
Contributions to Descriptive Set Theory
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}
A Decomposition of the Group Algebra of a Hyperoctahedral Group
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.
An Exploration of the Word2vec Algorithm: Creating a Vector Representation of a Language Vocabulary that Encodes Meaning and Usage Patterns in the Vector Space Structure
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.
Irreducible Modules for Yokonuma-Type Hecke Algebras
Yokonuma-type Hecke algebras are a class of Hecke algebras built from a Type A construction. In this thesis, I construct the irreducible representations for a class of generic Yokonuma-type Hecke algebras which specialize to group algebras of the complex reflection groups and to endomorphism rings of certain permutation characters of finite general linear groups.
Quantum Drinfeld Hecke Algebras
Quantum Drinfeld Hecke algebras extend both Lusztig's graded Hecke algebras and the symplectic reflection algebras of Etingof and Ginzburg to the quantum setting. A quantum (or skew) polynomial ring is generated by variables which commute only up to a set of quantum parameters. Certain finite groups may act by graded automorphisms on a quantum polynomial ring and quantum Drinfeld Hecke algebras deform the natural semi-direct product. We classify these algebras for the infinite family of complex reflection groups acting in arbitrary dimension. We also classify quantum Drinfeld Hecke algebras in arbitrary dimension for the infinite family of mystic reflection groups of Kirkman, Kuzmanovich, and Zhang, who showed they satisfy a Shephard-Todd-Chevalley theorem in the quantum setting. Using a classification of automorphisms of quantum polynomial rings in low dimension, we develop tools for studying quantum Drinfeld Hecke algebras in 3 dimensions. We describe the parameter space of such algebras using special properties of the quantum determinant in low dimension; although the quantum determinant is not a homomorphism in general, it is a homomorphism on the finite linear groups acting in dimension 3.
Rankin-Cohen Brackets for Hermitian Jacobi Forms and Hermitian Modular Forms
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 Relative Complexity of Various Classification Problems among Compact Metric Spaces
In this thesis, we discuss three main projects which are related to Polish groups and their actions on standard Borel spaces. In the first part, we show that the complexity of the classification problem of continua is Borel bireducible to a universal orbit equivalence relation induce by a Polish group on a standard Borel space. In the second part, we compare the relative complexity of various types of classification problems concerning subspaces of [0,1]^n for all natural number n. In the last chapter, we give a topological characterization theorem for the class of locally compact two-sided invariant non-Archimedean Polish groups. Using this theorem, we show the non-existence of a universal group and the existence of a surjectively universal group in the class.
Back to Top of Screen