Related papers: Word Length Formulae and Normal Forms of Conjugacy…
By virtue of linguistic compositionality, few syntactic rules and a finite lexicon can generate an unbounded number of sentences. That is, language, though seemingly high-dimensional, can be explained using relatively few degrees of…
For simple algebraic groups defined over algebraically closed fields of good characteristic, we give upper bounds on the covering numbers of unipotent conjugacy classes in terms of their (co)ranks and in terms of their dimensions.
In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…
Let $\Sigma_g$ denote the closed orientable surface of genus $g$ and fix an arbitrary simplicial triangulation of $\Sigma_g$. We construct and study a natural surjective group homomorphism from the surface braid group on $n$ strands on…
We give an exact formula for the dimension of the variety of homomorphisms from $S_g$ to $\mathit{any}$ semisimple real algebraic group, where $S_g$ is a surface group of genus $g \geq 2$.
In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…
We develop a family of techniques to align word embeddings which are derived from different source datasets or created using different mechanisms (e.g., GloVe or word2vec). Our methods are simple and have a closed form to optimally rotate,…
Let $\Gamma_g$ be the fundamental group of a closed orientable surface of genus $g\geqslant 2$. The outer automorphism group $\mathrm{Out}(\Gamma_g)$ naturally acts on the character variety $\mathcal{X}(\Gamma_g,G)$ for any Lie group $G$.…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
We classify representations of the mapping class group of a surface of genus $g$ (with at most one puncture or boundary component) up to dimension $3g-3$. Any such representation is the direct sum of a representation in dimension $2g$ or…
Methods for learning word representations using large text corpora have received much attention lately due to their impressive performance in numerous natural language processing (NLP) tasks such as, semantic similarity measurement, and…
This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-random configuration. More precisely, we investigate the…
We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…
Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of forms -- a universal principle of natural communication.…
Let $\gamma_0$ be a curve on a surface $\Sigma$ of genus $g$ and with $r$ boundary components and let $\pi_1(\Sigma)\curvearrowright X$ be a discrete and cocompact action on some metric space. We study the asymptotic behavior of the number…
Given a simple digraph $D$ on $n$ vertices (with $n\ge2$), there is a natural construction of a semigroup $\langle D\rangle$ associated with $D$. For any edge $(a,b)$ of $D$, let $a\to b$ be the idempotent of defect $1$ mapping $a$ to $b$…
We describe standard forms for elements of the higher-dimensional Thompson groups $nV$ arising from gridding subdivision processes. These processes lead to standard normal form descriptions for elements in these groups, and sizes of these…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…