Related papers: Word Length Formulae and Normal Forms of Conjugacy…
This paper uses the Minimum Description Length paradigm to model the complexity of CxGs (operationalized as the encoding size of a grammar) alongside their descriptive adequacy (operationalized as the encoding size of a corpus given a…
We give a parametrization of square roots of the ideal class of the inverse different of rings defined by binary forms in terms of the orbits of a coregular representation. This parametrization, which can be construed as a new integral…
This document is a practical guide to computations using an automatic structure for the mapping class group of a once-punctured, oriented surface $S$. We describe a quadratic time algorithm for the word problem in this group, which can be…
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in…
Groups $\Pi_k(X;\sigma)$ of "flagged homotopies" are introduced of which the usual (abelian for $k>1$) homotopy groups $\pi_k(X;p)$ is the limit case for flags $\sigma$ contracted to a point $p$. Calculus of exterior forms with values in…
Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…
In this paper, a supersymmetric extension of the minimal surface equation is formulated. Based on this formulation, a Lie superalgebra of infinitesimal symmetries of this equation is determined. A classification of the one-dimensional…
Regular expressions with capture variables, also known as "regex formulas," extract relations of spans (interval positions) from text. These relations can be further manipulated via Relational Algebra as studied in the context of document…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…
Let $g, n \geq 0$ and $\Sigma = \Sigma_{g, n}$ be a connected oriented surface of genus $g$ with $n$ punctures. The $\mathrm{SL}_2$-character variety of $\Sigma$ has a rigid relative automorphism group, whose elements fix each monodromies…
We show that for any given n, there exists a sequence of words a_k in the generators sigma_1, ... sigma_{n-1} of the braid group B_n, representing the identity element of B_n, such that the number of braid relations of the form sigma_i…
The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…
A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…
We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…
We prove that a Kleinian surface groups is determined, up to conjugacy in the isometry group of $\mathbb H^3$, by its simple marked length spectrum. As a first application, we show that a discrete faithful representation of the fundamental…
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…
Let $G$ be a toral relatively hyperbolic group, and let $\varphi\in\mathrm{Aut}(G)$. We prove that, under iteration of $\varphi$, the conjugacy length $||\varphi^n(g)||$ of every element $g\in G$ grows like $n^d\lambda^n$ for some…
This paper contains a survey of recent developments in investigation of word equations in simple matrix groups and polynomial equations in simple (associative and Lie) matrix algebras along with some new results on the image of word maps on…
We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…