Related papers: Growing words in the free group on two generators
A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…
In 2011, Fici and Lipt\'ak introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the prefix of the same length. Among the open problems regarding…
We show that a free action $G \curvearrowright X$ is almost finite if its restriction to some infinite normal subgroup of $G$ is almost finite. Consider the class of groups which contains all infinite groups of locally subexponential growth…
We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations…
The set of synchronizing words of a given $n$-state automaton forms a regular language recognizable by an automaton with $2^n - n$ states. The size of a recognizing automaton for the set of synchronizing words is linked to computational…
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…
The similarity of the evolution of human languages (or alphabets, bird songs, >...) to biological evolution of species is utilized to study with up to $10^9$ people the rise and fall of languages either by macroscopic differential equations…
This paper is concerned with the diameter of certain word norms on S-arithmetic split Chevalley groups. Such groups are well known to be boundedly generated by root elements. We prove that word metrics given by conjugacy classes on…
Natural languages are complexly structured entities. They exhibit characterising regularities that can be exploited to link them one another. In this work, I compare two morphological aspects of languages: Written Patterns and Sentence…
An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this…
We consider the growth of an infinite family of finite groups. We are motivated by the remarkable contribution of Bass, Wolf, Milnor, Gromov, Grigorchuk on the word growth and structure of infinite groups, and the results of Black on the…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
Extended affine root systems appear as the root systems of extended affine Lie algebras. A subclass of extended affine root systems, whose elements are called ``minimal" turns out to be of special interest mostly because of the geometric…
A subclass of nondeterministic Finite Automata generated by means of regular Grammars (GFAs, for short) is introduced. A process algebra is proposed, whose semantics maps a term to a GFA. We prove a representability theorem: for each GFA…
Morgan and Culler proved that a minimal action of a free group on a tree is determined by its translation length function. We prove an analogue of this theorem for 2-dimensional right-angled Artin groups acting on CAT(0) rectangle…
We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads…
Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…
We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…
A quantitative method is suggested, where meanings of words, and grammatic rules about these, of a vocabulary are represented by real numbers. People meet randomly, and average their vocabularies if they are equal; otherwise they either…
It is well-known that a Kleinian group is amenable if and only if it is elementary. We establish an analogous property for equivalence relations and foliations with Gromov hyperbolic leaves: they are amenable if and only if they are…