Related papers: Growing words in the free group on two generators
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
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…
Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v= \phi(u) for some \phi \in \text {Aut}F_n}.…
The success of large language models (LLMs) has motivated formal theories of language generation and learning. We study the framework of \emph{language generation in the limit}, where an adversary enumerates strings from an unknown language…
This paper situates itself in the theory of variable length codes and of finite automata where the concepts of completeness and synchronization play a central role. In this theoretical setting, we investigate the problem of finding upper…
Complex networks provide powerful tools for analyzing and understanding the intricate structures present in various systems, including natural language. Here, we analyze topology of growing word-adjacency networks constructed from Chinese…
We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…
Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position. Improvements by Ilie to…
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…
We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…
We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of…
The automorphism group of a finitely generated free group is the normal closure of a single element of order 2. If $m$ is less than $n$ then a homomorphism $Aut(F_n)\to Aut(F_m)$ can have cardinality at most 2. More generally, this is true…
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…
Let $\Sigma$ be a surface of negative Euler characteristic and $S$ a generating set for $\pi_1(\Sigma,p)$ consisting of simple loops that are pairwise disjoint (except at $p$). We show that the word length with respect to $S$ of an element…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…
In this thesis, a detailed study shows that closed itemsets and minimal generators play a key role for concisely representing both frequent itemsets and association rules. These itemsets structure the search space into equivalence classes…
We provide upper and lower bounds on the length of the shortest non-trivial element in the derived series and lower central series in the free group on two generators. The techniques are used to provide new estimates on the nilpotent…
Let $\FP(X)$ be the free paratopological group on a topological space $X$. For $n\in \N$, denote by $\FP_n(X)$ the subset of $\FP(X)$ consisting of all words of reduced length at most $n$, and by $i_n$ the natural mapping from $(X\oplus…