Related papers: The modular group and words in its two generators

A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] , \dots w[i_{|u|}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq |w|$. A word $w$ is $k$-subsequence universal over an alphabet $\Sigma$ if every word…

A finitely generated group $\G$ equipped with a word-length is said to satisfy property RD if there are $C, s\geq 0$ such that, for all non-negative integers $n$, we have $\|a\|\leq C (1+n)^s \|a\|_2$ whenever $a\in\C\G$ is supported on…

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an…

We extend results regarding a combinatorial model introduced by Black, Drellich, and Tymoczko (2017+) which generalizes the folding of the RNA molecule in biology. Consider a word on alphabet $\{A_1, \overline{A}_1, \ldots, A_m,…

We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…

Strongly motivated by a mathematical result by Lin and Yamashita (arXiv:2412.02298), we describe a long exact sequence formed by groups of equivalence classes of two-dimensional $\mathcal{N}{=}(0,1)$ supersymmetric quantum field theories…

The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices and let $\mathcal S$ be a generating set of $M_n(\mathbb{F})$ as an $\mathbb{F}$-algebra. The length of a finite generating set $\mathcal S$ of $M_n(\mathbb{F})$ is the smallest…

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

There is a standard "word length" metric canonically associated to any set of generators for a group. In particular, for any integers a and b greater than 1, the additive group of integers has generating sets {a^i}_{i=0}^{\infty} and…

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

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…

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Let $G$ be a finitely generated group with polynomial growth, and let $\om$ be a weight, i.e. a sub-multiplicative function on $G$ with positive values. We study when the weighted group algebra $\ell^1(G,\om)$ is isomorphic to an operator…

In this paper we prove that the unitary groups $SU_n(q^2)$ are $(2,3)$-generated for any prime power $q$ and any integer $n\geq 8$. By previous results this implies that, if $n\geq 3$, the groups $SU_n(q^2)$ and $PSU_n(q^2)$ are…

This is the second paper in a series of three, where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Here, for an arbitrary group $G$ of infinite words over an ordered abelian group…

The 4-simplex has vertices 5 unit quaternions, which we arrange so that one of them is the unit. We show that the remaining 4 vertices are the generators of a free group. For the proof, we introduce a new alternating length on words in free…

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…